/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:12:52,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:12:52,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:12:52,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:12:52,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:12:52,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:12:52,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:12:52,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:12:52,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:12:52,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:12:52,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:12:52,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:12:52,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:12:52,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:12:52,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:12:52,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:12:52,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:12:52,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:12:52,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:12:52,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:12:52,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:12:52,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:12:52,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:12:52,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:12:52,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:12:52,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:12:52,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:12:52,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:12:52,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:12:52,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:12:52,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:12:52,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:12:52,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:12:52,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:12:52,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:12:52,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:12:52,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:12:52,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:12:52,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:12:52,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:12:52,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:12:52,375 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:12:52,389 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:12:52,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:12:52,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:12:52,390 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:12:52,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:12:52,390 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:12:52,391 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:12:52,391 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:12:52,391 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:12:52,391 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:12:52,391 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:12:52,392 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:12:52,392 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:12:52,392 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:12:52,392 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:12:52,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:12:52,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:12:52,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:12:52,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:12:52,393 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:12:52,393 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:12:52,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:12:52,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:12:52,394 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:12:52,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:12:52,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:12:52,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:12:52,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:12:52,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:12:52,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:12:52,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:12:52,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:12:52,575 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:12:52,575 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:12:52,576 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:12:52,682 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Jpm6oM/tmp/4548f7dcd7d247f2a80864ac28b0a6aa/FLAGc8ef4a770 [2020-07-01 13:12:53,018 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:12:53,019 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:12:53,019 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:12:53,026 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Jpm6oM/tmp/4548f7dcd7d247f2a80864ac28b0a6aa/FLAGc8ef4a770 [2020-07-01 13:12:53,443 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_Jpm6oM/tmp/4548f7dcd7d247f2a80864ac28b0a6aa [2020-07-01 13:12:53,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:12:53,455 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:12:53,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:12:53,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:12:53,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:12:53,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149bb15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53, skipping insertion in model container [2020-07-01 13:12:53,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:12:53,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:12:53,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:12:53,735 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:12:53,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:12:53,767 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:12:53,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53 WrapperNode [2020-07-01 13:12:53,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:12:53,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:12:53,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:12:53,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:12:53,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:12:53,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:12:53,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:12:53,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:12:53,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,822 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... [2020-07-01 13:12:53,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:12:53,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:12:53,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:12:53,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:12:53,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:12:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:12:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:12:53,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:12:53,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:12:53,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:12:53,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:12:54,202 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:12:54,202 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 13:12:54,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:54 BoogieIcfgContainer [2020-07-01 13:12:54,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:12:54,207 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:12:54,207 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:12:54,209 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:12:54,210 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:54" (1/1) ... [2020-07-01 13:12:54,225 INFO L313 BlockEncoder]: Initial Icfg 47 locations, 48 edges [2020-07-01 13:12:54,227 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:12:54,227 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:12:54,228 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:12:54,228 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:12:54,231 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:12:54,232 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:12:54,232 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:12:54,258 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:12:54,295 INFO L200 BlockEncoder]: SBE split 25 edges [2020-07-01 13:12:54,300 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:12:54,302 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:12:54,334 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:12:54,343 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:12:54,345 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:12:54,345 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:12:54,345 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:12:54,346 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:12:54,346 INFO L313 BlockEncoder]: Encoded RCFG 39 locations, 70 edges [2020-07-01 13:12:54,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:12:54 BasicIcfg [2020-07-01 13:12:54,347 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:12:54,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:12:54,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:12:54,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:12:54,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:12:53" (1/4) ... [2020-07-01 13:12:54,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f35f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:12:54, skipping insertion in model container [2020-07-01 13:12:54,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (2/4) ... [2020-07-01 13:12:54,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f35f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:12:54, skipping insertion in model container [2020-07-01 13:12:54,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:54" (3/4) ... [2020-07-01 13:12:54,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f35f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:12:54, skipping insertion in model container [2020-07-01 13:12:54,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:12:54" (4/4) ... [2020-07-01 13:12:54,362 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:12:54,373 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:12:54,381 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 24 error locations. [2020-07-01 13:12:54,395 INFO L251 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2020-07-01 13:12:54,419 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:12:54,420 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:12:54,420 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:12:54,420 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:12:54,420 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:12:54,420 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:12:54,420 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:12:54,421 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:12:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-07-01 13:12:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:12:54,442 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:12:54,443 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash 124423, now seen corresponding path program 1 times [2020-07-01 13:12:54,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051721862] [2020-07-01 13:12:54,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051721862] [2020-07-01 13:12:54,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:54,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114863329] [2020-07-01 13:12:54,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:54,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:54,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,643 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-07-01 13:12:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,778 INFO L93 Difference]: Finished difference Result 76 states and 131 transitions. [2020-07-01 13:12:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:54,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:12:54,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,792 INFO L225 Difference]: With dead ends: 76 [2020-07-01 13:12:54,792 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 13:12:54,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 13:12:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 13:12:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 13:12:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2020-07-01 13:12:54,835 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 3 [2020-07-01 13:12:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,835 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2020-07-01 13:12:54,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:54,836 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2020-07-01 13:12:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:12:54,836 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:12:54,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:12:54,838 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash 124547, now seen corresponding path program 1 times [2020-07-01 13:12:54,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105390415] [2020-07-01 13:12:54,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:54,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105390415] [2020-07-01 13:12:54,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:54,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:54,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498662655] [2020-07-01 13:12:54,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:54,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:54,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:54,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,884 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 3 states. [2020-07-01 13:12:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:54,967 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2020-07-01 13:12:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:54,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:12:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:54,969 INFO L225 Difference]: With dead ends: 43 [2020-07-01 13:12:54,969 INFO L226 Difference]: Without dead ends: 39 [2020-07-01 13:12:54,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:54,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-01 13:12:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-07-01 13:12:54,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-01 13:12:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 59 transitions. [2020-07-01 13:12:54,976 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 59 transitions. Word has length 3 [2020-07-01 13:12:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:54,977 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 59 transitions. [2020-07-01 13:12:54,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:54,977 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 59 transitions. [2020-07-01 13:12:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:12:54,977 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:54,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:12:54,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:12:54,978 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:54,978 INFO L82 PathProgramCache]: Analyzing trace with hash 124548, now seen corresponding path program 1 times [2020-07-01 13:12:54,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:54,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356129922] [2020-07-01 13:12:54,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356129922] [2020-07-01 13:12:55,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362129287] [2020-07-01 13:12:55,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,031 INFO L87 Difference]: Start difference. First operand 39 states and 59 transitions. Second operand 3 states. [2020-07-01 13:12:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,141 INFO L93 Difference]: Finished difference Result 39 states and 59 transitions. [2020-07-01 13:12:55,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:12:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,142 INFO L225 Difference]: With dead ends: 39 [2020-07-01 13:12:55,142 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 13:12:55,143 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 13:12:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 13:12:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 13:12:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2020-07-01 13:12:55,148 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 3 [2020-07-01 13:12:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,148 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 55 transitions. [2020-07-01 13:12:55,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2020-07-01 13:12:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:12:55,149 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:12:55,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:12:55,149 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 124545, now seen corresponding path program 1 times [2020-07-01 13:12:55,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398062889] [2020-07-01 13:12:55,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,182 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398062889] [2020-07-01 13:12:55,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090668409] [2020-07-01 13:12:55,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,184 INFO L87 Difference]: Start difference. First operand 35 states and 55 transitions. Second operand 3 states. [2020-07-01 13:12:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,257 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2020-07-01 13:12:55,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:12:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,258 INFO L225 Difference]: With dead ends: 35 [2020-07-01 13:12:55,258 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:12:55,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:12:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:12:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:12:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2020-07-01 13:12:55,264 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 3 [2020-07-01 13:12:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,264 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2020-07-01 13:12:55,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2020-07-01 13:12:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:12:55,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:12:55,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:12:55,265 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash 3858871, now seen corresponding path program 1 times [2020-07-01 13:12:55,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,266 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242321809] [2020-07-01 13:12:55,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242321809] [2020-07-01 13:12:55,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432021943] [2020-07-01 13:12:55,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,319 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 3 states. [2020-07-01 13:12:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,402 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2020-07-01 13:12:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:12:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,403 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:12:55,403 INFO L226 Difference]: Without dead ends: 27 [2020-07-01 13:12:55,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-01 13:12:55,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-01 13:12:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-01 13:12:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2020-07-01 13:12:55,407 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 4 [2020-07-01 13:12:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,408 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2020-07-01 13:12:55,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2020-07-01 13:12:55,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:12:55,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:12:55,409 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:12:55,409 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,409 INFO L82 PathProgramCache]: Analyzing trace with hash 3858873, now seen corresponding path program 1 times [2020-07-01 13:12:55,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787832471] [2020-07-01 13:12:55,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787832471] [2020-07-01 13:12:55,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562157511] [2020-07-01 13:12:55,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,457 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 3 states. [2020-07-01 13:12:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,525 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2020-07-01 13:12:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:12:55,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,526 INFO L225 Difference]: With dead ends: 27 [2020-07-01 13:12:55,527 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 13:12:55,527 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 13:12:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 13:12:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 13:12:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-07-01 13:12:55,530 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 4 [2020-07-01 13:12:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,531 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-01 13:12:55,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-01 13:12:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:12:55,531 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:55,532 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:12:55,532 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,532 INFO L82 PathProgramCache]: Analyzing trace with hash 119623322, now seen corresponding path program 1 times [2020-07-01 13:12:55,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307436962] [2020-07-01 13:12:55,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307436962] [2020-07-01 13:12:55,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030197582] [2020-07-01 13:12:55,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,567 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2020-07-01 13:12:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,625 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-01 13:12:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:12:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,626 INFO L225 Difference]: With dead ends: 23 [2020-07-01 13:12:55,626 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 13:12:55,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 13:12:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 13:12:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 13:12:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-07-01 13:12:55,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 5 [2020-07-01 13:12:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,629 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-07-01 13:12:55,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-07-01 13:12:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:12:55,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:12:55,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:55,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:12:55,631 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:12:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 119623324, now seen corresponding path program 1 times [2020-07-01 13:12:55,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898866574] [2020-07-01 13:12:55,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898866574] [2020-07-01 13:12:55,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721929290] [2020-07-01 13:12:55,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:12:55,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,667 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 3 states. [2020-07-01 13:12:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:55,709 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2020-07-01 13:12:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:55,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:12:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:12:55,710 INFO L225 Difference]: With dead ends: 19 [2020-07-01 13:12:55,710 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:12:55,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:12:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:12:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:12:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:12:55,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:12:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:12:55,711 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:12:55,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:12:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:12:55,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:12:55,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:12:55,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:12:55,748 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:12:55,748 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 13:12:55,748 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 13:12:55,748 INFO L268 CegarLoopResult]: For program point L13-1(lines 13 17) no Hoare annotation was computed. [2020-07-01 13:12:55,748 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:12:55,749 INFO L264 CegarLoopResult]: At program point L13-3(lines 12 17) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:12:55,749 INFO L268 CegarLoopResult]: For program point L13-4(lines 13 17) no Hoare annotation was computed. [2020-07-01 13:12:55,749 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:12:55,749 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:12:55,750 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:12:55,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:12:55,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:12:55,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:12:55,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:12:55,751 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:12:55,751 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:12:55,751 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:12:55,752 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:12:55,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:12:55,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:12:55,752 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 13:12:55,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:12:55,752 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:12:55,752 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:12:55,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:12:55,753 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:12:55,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:12:55,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:12:55,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:12:55,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:12:55,753 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:12:55,756 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:12:55,765 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:55,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:55,766 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:12:55,767 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:55,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:55,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:55,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:12:55,773 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:55,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:12:55 BasicIcfg [2020-07-01 13:12:55,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:12:55,776 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:12:55,776 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:12:55,780 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:12:55,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:55,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:12:53" (1/5) ... [2020-07-01 13:12:55,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c491115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:12:55, skipping insertion in model container [2020-07-01 13:12:55,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:55,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:12:53" (2/5) ... [2020-07-01 13:12:55,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c491115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:12:55, skipping insertion in model container [2020-07-01 13:12:55,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:55,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:12:54" (3/5) ... [2020-07-01 13:12:55,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c491115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:12:55, skipping insertion in model container [2020-07-01 13:12:55,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:55,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:12:54" (4/5) ... [2020-07-01 13:12:55,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c491115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:12:55, skipping insertion in model container [2020-07-01 13:12:55,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:12:55,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:12:55" (5/5) ... [2020-07-01 13:12:55,784 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:12:55,806 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:12:55,806 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:12:55,806 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:12:55,807 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:12:55,807 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:12:55,807 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:12:55,807 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:12:55,807 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:12:55,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-07-01 13:12:55,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:12:55,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:12:55,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:12:55,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:55,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,823 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:12:55,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states. [2020-07-01 13:12:55,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-01 13:12:55,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:12:55,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:12:55,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:12:55,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:12:55,832 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [94] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 14#L-1true [141] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet9_1|) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~ret11=|v_ULTIMATE.start_main_#t~ret11_1|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret11, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 16#L10true [72] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 29#L10-1true [87] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 34#L11true [95] L11-->L13-3: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 31#L13-3true [2020-07-01 13:12:55,833 INFO L796 eck$LassoCheckResult]: Loop: 31#L13-3true [91] L13-3-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 38#L13true [101] L13-->L13-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem4_2|) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 36#L13-1true [100] L13-1-->L14: Formula: (< |v_ULTIMATE.start_test_fun_#t~mem4_6| |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_6|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_5|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem3] 22#L14true [80] L14-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_15|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 20#L14-1true [191] L14-1-->L15: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_11) (= (store |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15 (store (select |v_#memory_int_21| v_ULTIMATE.start_test_fun_~x_ref~0.base_15) v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem5_6| (- 1)))) |v_#memory_int_20|) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_11 4) (select |v_#length_30| v_ULTIMATE.start_test_fun_~x_ref~0.base_15)) (= 1 (select |v_#valid_37| v_ULTIMATE.start_test_fun_~x_ref~0.base_15))) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_30|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_11, #length=|v_#length_30|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, #memory_int] 23#L15true [84] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem6_2|) (= 1 (select |v_#valid_21| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_21|} OutVars{#valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 40#L15-1true [195] L15-1-->L16: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 4) (select |v_#length_34| v_ULTIMATE.start_test_fun_~y_ref~0.base_15)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_11) (= (store |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15 (store (select |v_#memory_int_26| v_ULTIMATE.start_test_fun_~y_ref~0.base_15) v_ULTIMATE.start_test_fun_~y_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem6_6| 1))) |v_#memory_int_25|) (= 1 (select |v_#valid_44| v_ULTIMATE.start_test_fun_~y_ref~0.base_15))) InVars {#valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_6|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} OutVars{#valid=|v_#valid_44|, #memory_int=|v_#memory_int_25|, #length=|v_#length_34|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_15, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_11} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem6] 6#L16true [63] L16-->L16-1: Formula: (and (= 1 (select |v_#valid_25| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_23| v_ULTIMATE.start_test_fun_~c~0.base_6)) (= |v_ULTIMATE.start_test_fun_#t~mem7_2| (select (select |v_#memory_int_15| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5)) InVars {#memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_25|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem7] 3#L16-1true [196] L16-1-->L13-3: Formula: (and (= (store |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_28| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem7_6| 1))) |v_#memory_int_27|) (= 1 (select |v_#valid_45| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_35| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15)) InVars {ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_28|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_6|} OutVars{ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_27|, #length=|v_#length_35|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem7] 31#L13-3true [2020-07-01 13:12:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash 119712640, now seen corresponding path program 1 times [2020-07-01 13:12:55,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593939922] [2020-07-01 13:12:55,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:12:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:12:55,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593939922] [2020-07-01 13:12:55,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:12:55,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:12:55,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124018839] [2020-07-01 13:12:55,857 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:12:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:12:55,858 INFO L82 PathProgramCache]: Analyzing trace with hash -510456228, now seen corresponding path program 1 times [2020-07-01 13:12:55,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:12:55,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233913194] [2020-07-01 13:12:55,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:12:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:12:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:12:55,900 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:12:56,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:12:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:12:56,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:12:56,057 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2020-07-01 13:12:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:12:56,146 INFO L93 Difference]: Finished difference Result 39 states and 63 transitions. [2020-07-01 13:12:56,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:12:56,149 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:12:56,153 INFO L168 Benchmark]: Toolchain (without parser) took 2697.01 ms. Allocated memory was 514.9 MB in the beginning and 594.0 MB in the end (delta: 79.2 MB). Free memory was 435.9 MB in the beginning and 448.8 MB in the end (delta: -13.0 MB). Peak memory consumption was 66.2 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,154 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:12:56,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.31 ms. Allocated memory was 514.9 MB in the beginning and 565.2 MB in the end (delta: 50.3 MB). Free memory was 435.9 MB in the beginning and 533.2 MB in the end (delta: -97.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.70 ms. Allocated memory is still 565.2 MB. Free memory was 533.2 MB in the beginning and 531.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,155 INFO L168 Benchmark]: Boogie Preprocessor took 24.49 ms. Allocated memory is still 565.2 MB. Free memory was 531.6 MB in the beginning and 530.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,156 INFO L168 Benchmark]: RCFGBuilder took 372.21 ms. Allocated memory is still 565.2 MB. Free memory was 530.0 MB in the beginning and 506.6 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,156 INFO L168 Benchmark]: BlockEncodingV2 took 140.14 ms. Allocated memory is still 565.2 MB. Free memory was 506.6 MB in the beginning and 495.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,157 INFO L168 Benchmark]: TraceAbstraction took 1427.52 ms. Allocated memory was 565.2 MB in the beginning and 594.0 MB in the end (delta: 28.8 MB). Free memory was 495.1 MB in the beginning and 490.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 33.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,158 INFO L168 Benchmark]: BuchiAutomizer took 374.29 ms. Allocated memory is still 594.0 MB. Free memory was 490.9 MB in the beginning and 448.8 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:12:56,162 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 47 locations, 48 edges - StatisticsResult: Encoded RCFG 39 locations, 70 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 311.31 ms. Allocated memory was 514.9 MB in the beginning and 565.2 MB in the end (delta: 50.3 MB). Free memory was 435.9 MB in the beginning and 533.2 MB in the end (delta: -97.4 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.70 ms. Allocated memory is still 565.2 MB. Free memory was 533.2 MB in the beginning and 531.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.49 ms. Allocated memory is still 565.2 MB. Free memory was 531.6 MB in the beginning and 530.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 372.21 ms. Allocated memory is still 565.2 MB. Free memory was 530.0 MB in the beginning and 506.6 MB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 140.14 ms. Allocated memory is still 565.2 MB. Free memory was 506.6 MB in the beginning and 495.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1427.52 ms. Allocated memory was 565.2 MB in the beginning and 594.0 MB in the end (delta: 28.8 MB). Free memory was 495.1 MB in the beginning and 490.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 33.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 374.29 ms. Allocated memory is still 594.0 MB. Free memory was 490.9 MB in the beginning and 448.8 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:12:56,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:56,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:56,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:12:56,173 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:56,173 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:56,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:12:56,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:12:56,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 24 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.2s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 SDtfs, 311 SDslu, 4 SDs, 0 SdLazy, 301 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 43 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:12:50.139 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_Jpm6oM/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:12:56.399 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check