java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:15:30,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:15:30,376 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:15:30,391 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:15:30,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:15:30,392 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:15:30,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:15:30,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:15:30,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:15:30,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:15:30,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:15:30,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:15:30,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:15:30,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:15:30,401 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:15:30,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:15:30,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:15:30,408 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:15:30,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:15:30,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:15:30,413 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:15:30,413 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:15:30,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:15:30,414 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:15:30,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:15:30,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:15:30,417 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:15:30,417 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:15:30,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:15:30,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:15:30,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:15:30,419 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:15:30,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:15:30,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:15:30,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:15:30,428 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:15:30,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:15:30,429 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:15:30,429 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:15:30,429 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:15:30,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:15:30,429 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:15:30,430 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:15:30,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:15:30,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:15:30,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:15:30,430 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:15:30,430 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:15:30,430 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:15:30,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:15:30,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:15:30,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:15:30,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:15:30,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:15:30,431 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:15:30,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:15:30,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:15:30,432 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:15:30,432 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:15:30,432 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:15:30,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:15:30,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:15:30,433 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:15:30,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:15:30,433 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:15:30,433 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:15:30,434 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:15:30,434 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:15:30,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:15:30,477 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:15:30,481 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:15:30,482 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:15:30,482 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:15:30,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:15:30,637 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:15:30,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:15:30,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:15:30,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:15:30,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:15:30,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d17d7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30, skipping insertion in model container [2018-01-25 06:15:30,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,663 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:15:30,701 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:15:30,822 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:15:30,844 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:15:30,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30 WrapperNode [2018-01-25 06:15:30,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:15:30,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:15:30,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:15:30,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:15:30,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... [2018-01-25 06:15:30,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:15:30,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:15:30,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:15:30,895 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:15:30,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:15:30,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:15:30,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:15:30,942 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 06:15:30,942 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:15:30,943 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:15:30,944 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:15:30,944 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 06:15:30,944 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:15:30,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:15:30,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:15:31,253 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:15:31,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:15:31 BoogieIcfgContainer [2018-01-25 06:15:31,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:15:31,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:15:31,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:15:31,277 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:15:31,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:15:30" (1/3) ... [2018-01-25 06:15:31,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8f94f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:15:31, skipping insertion in model container [2018-01-25 06:15:31,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:15:30" (2/3) ... [2018-01-25 06:15:31,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8f94f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:15:31, skipping insertion in model container [2018-01-25 06:15:31,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:15:31" (3/3) ... [2018-01-25 06:15:31,280 INFO L105 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:15:31,287 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:15:31,294 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-01-25 06:15:31,333 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:15:31,333 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:15:31,333 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:15:31,333 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:15:31,333 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:15:31,334 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:15:31,334 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:15:31,334 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:15:31,335 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:15:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-01-25 06:15:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 06:15:31,357 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:31,358 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:31,358 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1444354772, now seen corresponding path program 1 times [2018-01-25 06:15:31,364 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:31,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:31,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:31,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:31,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:31,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:31,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:31,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:15:31,486 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:31,488 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 06:15:31,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 06:15:31,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 06:15:31,501 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 2 states. [2018-01-25 06:15:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:31,608 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-01-25 06:15:31,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 06:15:31,610 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-25 06:15:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:31,618 INFO L225 Difference]: With dead ends: 126 [2018-01-25 06:15:31,618 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 06:15:31,622 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 06:15:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 06:15:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-25 06:15:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 06:15:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-25 06:15:31,658 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-01-25 06:15:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:31,658 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-25 06:15:31,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 06:15:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-25 06:15:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 06:15:31,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:31,659 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:31,659 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash 749299640, now seen corresponding path program 1 times [2018-01-25 06:15:31,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:31,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:31,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:31,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:31,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:31,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:31,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:31,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:15:31,736 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:31,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:15:31,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:15:31,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:15:31,738 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-01-25 06:15:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:31,980 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-01-25 06:15:31,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:15:31,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 06:15:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:31,982 INFO L225 Difference]: With dead ends: 103 [2018-01-25 06:15:31,982 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 06:15:31,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 06:15:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-01-25 06:15:31,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 06:15:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2018-01-25 06:15:31,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 14 [2018-01-25 06:15:31,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:31,991 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-01-25 06:15:31,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:15:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2018-01-25 06:15:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 06:15:31,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:31,991 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:31,991 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash 749299641, now seen corresponding path program 1 times [2018-01-25 06:15:31,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:31,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:31,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:31,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:31,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:32,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:32,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:32,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:15:32,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:32,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:15:32,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:15:32,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:15:32,143 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 5 states. [2018-01-25 06:15:32,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:32,307 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-01-25 06:15:32,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:15:32,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 06:15:32,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:32,309 INFO L225 Difference]: With dead ends: 114 [2018-01-25 06:15:32,309 INFO L226 Difference]: Without dead ends: 102 [2018-01-25 06:15:32,310 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:32,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-25 06:15:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2018-01-25 06:15:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 06:15:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2018-01-25 06:15:32,320 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 14 [2018-01-25 06:15:32,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:32,321 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-01-25 06:15:32,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:15:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2018-01-25 06:15:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:15:32,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:32,322 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:32,322 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:32,323 INFO L82 PathProgramCache]: Analyzing trace with hash 129960215, now seen corresponding path program 1 times [2018-01-25 06:15:32,323 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:32,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:32,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:32,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:32,324 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:32,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:32,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:32,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:15:32,461 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:32,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:15:32,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:15:32,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:15:32,462 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 6 states. [2018-01-25 06:15:32,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:32,662 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2018-01-25 06:15:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:15:32,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 06:15:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:32,663 INFO L225 Difference]: With dead ends: 134 [2018-01-25 06:15:32,663 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 06:15:32,664 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:15:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 06:15:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 118. [2018-01-25 06:15:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-25 06:15:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2018-01-25 06:15:32,674 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 25 [2018-01-25 06:15:32,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:32,675 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2018-01-25 06:15:32,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:15:32,675 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2018-01-25 06:15:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:15:32,676 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:32,676 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:32,676 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash 130009866, now seen corresponding path program 1 times [2018-01-25 06:15:32,676 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:32,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:32,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:32,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:32,677 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:32,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:32,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:32,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:15:32,741 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:32,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:15:32,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:15:32,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:15:32,743 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 6 states. [2018-01-25 06:15:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:32,889 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2018-01-25 06:15:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:15:32,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 06:15:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:32,891 INFO L225 Difference]: With dead ends: 130 [2018-01-25 06:15:32,891 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 06:15:32,891 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:15:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 06:15:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2018-01-25 06:15:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 06:15:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2018-01-25 06:15:32,903 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 25 [2018-01-25 06:15:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:32,904 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2018-01-25 06:15:32,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:15:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2018-01-25 06:15:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:15:32,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:32,904 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:32,904 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash 130009867, now seen corresponding path program 1 times [2018-01-25 06:15:32,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:32,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:32,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:32,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:32,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:32,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:32,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:32,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:15:32,954 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:32,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:15:32,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:15:32,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:15:32,954 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 6 states. [2018-01-25 06:15:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:33,137 INFO L93 Difference]: Finished difference Result 128 states and 146 transitions. [2018-01-25 06:15:33,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 06:15:33,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 06:15:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:33,138 INFO L225 Difference]: With dead ends: 128 [2018-01-25 06:15:33,138 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 06:15:33,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:15:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 06:15:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2018-01-25 06:15:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 06:15:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2018-01-25 06:15:33,148 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 25 [2018-01-25 06:15:33,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:33,149 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2018-01-25 06:15:33,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:15:33,149 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2018-01-25 06:15:33,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:15:33,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:33,150 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:33,151 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:33,151 INFO L82 PathProgramCache]: Analyzing trace with hash 825919103, now seen corresponding path program 1 times [2018-01-25 06:15:33,152 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:33,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:33,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,153 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:33,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:33,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:33,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:15:33,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:33,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:15:33,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:15:33,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:15:33,182 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 3 states. [2018-01-25 06:15:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:33,196 INFO L93 Difference]: Finished difference Result 270 states and 312 transitions. [2018-01-25 06:15:33,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:15:33,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-25 06:15:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:33,199 INFO L225 Difference]: With dead ends: 270 [2018-01-25 06:15:33,199 INFO L226 Difference]: Without dead ends: 175 [2018-01-25 06:15:33,199 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:15:33,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-25 06:15:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2018-01-25 06:15:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:15:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2018-01-25 06:15:33,213 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 25 [2018-01-25 06:15:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:33,213 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2018-01-25 06:15:33,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:15:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2018-01-25 06:15:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 06:15:33,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:33,215 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:33,215 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash 245290165, now seen corresponding path program 1 times [2018-01-25 06:15:33,215 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:33,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:33,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:33,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:33,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:33,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:33,374 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:33,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:15:33,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:15:33,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:15:33,375 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand 6 states. [2018-01-25 06:15:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:33,502 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2018-01-25 06:15:33,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:15:33,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 06:15:33,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:33,503 INFO L225 Difference]: With dead ends: 186 [2018-01-25 06:15:33,503 INFO L226 Difference]: Without dead ends: 139 [2018-01-25 06:15:33,504 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 06:15:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-25 06:15:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2018-01-25 06:15:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-25 06:15:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-01-25 06:15:33,511 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 25 [2018-01-25 06:15:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:33,511 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-01-25 06:15:33,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:15:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-01-25 06:15:33,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:15:33,512 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:33,512 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:33,512 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1978391014, now seen corresponding path program 1 times [2018-01-25 06:15:33,513 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:33,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:33,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,514 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:33,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:33,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:33,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:33,576 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:33,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:15:33,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:15:33,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:33,577 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 7 states. [2018-01-25 06:15:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:33,706 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-01-25 06:15:33,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:15:33,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 06:15:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:33,707 INFO L225 Difference]: With dead ends: 118 [2018-01-25 06:15:33,708 INFO L226 Difference]: Without dead ends: 115 [2018-01-25 06:15:33,708 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 06:15:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-25 06:15:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-25 06:15:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-25 06:15:33,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-01-25 06:15:33,714 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 26 [2018-01-25 06:15:33,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:33,714 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-01-25 06:15:33,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:15:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-01-25 06:15:33,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:15:33,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:33,715 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:33,715 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:33,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1978391015, now seen corresponding path program 1 times [2018-01-25 06:15:33,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:33,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:33,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:33,717 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:33,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:33,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:33,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:15:33,824 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:33,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:15:33,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:15:33,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:33,825 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2018-01-25 06:15:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:34,031 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2018-01-25 06:15:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 06:15:34,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 06:15:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:34,033 INFO L225 Difference]: With dead ends: 131 [2018-01-25 06:15:34,033 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 06:15:34,033 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-25 06:15:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 06:15:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 99. [2018-01-25 06:15:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-25 06:15:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-25 06:15:34,042 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 26 [2018-01-25 06:15:34,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:34,043 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-25 06:15:34,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:15:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-25 06:15:34,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:15:34,044 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:34,044 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:34,045 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:34,045 INFO L82 PathProgramCache]: Analyzing trace with hash 385432044, now seen corresponding path program 1 times [2018-01-25 06:15:34,045 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:34,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:34,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:34,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:34,046 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:34,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:34,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:15:34,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 06:15:34,094 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:15:34,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:15:34,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:15:34,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:15:34,094 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 7 states. [2018-01-25 06:15:34,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:34,214 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2018-01-25 06:15:34,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:15:34,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-25 06:15:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:34,215 INFO L225 Difference]: With dead ends: 138 [2018-01-25 06:15:34,215 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 06:15:34,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:15:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 06:15:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2018-01-25 06:15:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 06:15:34,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-01-25 06:15:34,221 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 27 [2018-01-25 06:15:34,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:34,221 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-01-25 06:15:34,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:15:34,222 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-01-25 06:15:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 06:15:34,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:34,222 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:34,223 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:34,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1053625897, now seen corresponding path program 1 times [2018-01-25 06:15:34,223 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:34,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:34,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:34,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:34,224 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:34,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:34,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:15:34,644 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:15:34,645 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-25 06:15:34,646 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [28], [36], [37], [43], [45], [48], [51], [55], [58], [62], [64], [69], [101], [105], [107], [112], [125], [128], [131], [136], [137], [145], [146], [147] [2018-01-25 06:15:34,695 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:15:34,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:15:43,963 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:15:43,965 INFO L268 AbstractInterpreter]: Visited 35 different actions 52 times. Merged at 16 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-25 06:15:43,986 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:15:43,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:15:43,986 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:15:43,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:43,994 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:15:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:44,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:15:44,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 06:15:44,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 06:15:44,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-25 06:15:44,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 06:15:44,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2018-01-25 06:15:44,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:15:44,313 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:15:44,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 06:15:44,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-25 06:15:44,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-25 06:15:44,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-25 06:15:44,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-25 06:15:44,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:15:44,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-25 06:15:44,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-25 06:15:44,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 06:15:44,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-25 06:15:44,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-25 06:15:44,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-25 06:15:44,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 06:15:44,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 06:15:44,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-25 06:15:44,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-25 06:15:44,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-25 06:15:44,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-25 06:15:44,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:44,846 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-01-25 06:15:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:44,902 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:15:45,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 06:15:45,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 06:15:45,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-25 06:15:45,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-01-25 06:15:45,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-25 06:15:45,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-25 06:15:45,281 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 06:15:45,282 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 06:15:45,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-25 06:15:45,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-25 06:15:45,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:15:45,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:15:45,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-25 06:15:45,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-25 06:15:45,346 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,356 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-25 06:15:45,376 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:44, output treesize:58 [2018-01-25 06:15:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:45,531 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:15:45,531 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 06:15:45,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:45,535 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:15:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:45,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:15:45,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 06:15:45,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 06:15:45,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-25 06:15:45,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 06:15:45,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-25 06:15:45,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:15:45,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:15:45,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 06:15:45,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-01-25 06:15:45,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-25 06:15:45,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-25 06:15:45,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-25 06:15:45,675 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:15:45,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-01-25 06:15:45,678 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-01-25 06:15:45,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 06:15:45,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-01-25 06:15:45,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-01-25 06:15:45,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-25 06:15:45,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 06:15:45,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 06:15:45,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-25 06:15:45,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-01-25 06:15:45,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-25 06:15:45,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-25 06:15:45,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,853 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-01-25 06:15:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:45,858 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:15:45,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:45,965 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 06:15:45,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 06:15:45,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-01-25 06:15:45,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-01-25 06:15:46,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-25 06:15:46,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-01-25 06:15:46,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-25 06:15:46,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:46,083 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 06:15:46,092 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 06:15:46,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-01-25 06:15:46,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:46,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:15:46,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:15:46,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-01-25 06:15:46,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-25 06:15:46,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 06:15:46,119 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:15:46,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-01-25 06:15:46,133 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:45 [2018-01-25 06:15:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:46,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:15:46,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15, 14, 14] total 42 [2018-01-25 06:15:46,250 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:15:46,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-25 06:15:46,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-25 06:15:46,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1524, Unknown=0, NotChecked=0, Total=1722 [2018-01-25 06:15:46,252 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 25 states. [2018-01-25 06:15:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:15:47,209 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2018-01-25 06:15:47,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 06:15:47,210 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 37 [2018-01-25 06:15:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:15:47,211 INFO L225 Difference]: With dead ends: 204 [2018-01-25 06:15:47,211 INFO L226 Difference]: Without dead ends: 196 [2018-01-25 06:15:47,212 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 118 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=592, Invalid=2948, Unknown=0, NotChecked=0, Total=3540 [2018-01-25 06:15:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-25 06:15:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2018-01-25 06:15:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 06:15:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2018-01-25 06:15:47,221 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 37 [2018-01-25 06:15:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:15:47,221 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2018-01-25 06:15:47,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-25 06:15:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2018-01-25 06:15:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 06:15:47,222 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:15:47,222 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:15:47,222 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr26EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 06:15:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1168955847, now seen corresponding path program 1 times [2018-01-25 06:15:47,223 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:15:47,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:47,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:15:47,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:15:47,223 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:15:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:15:47,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:15:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:15:47,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:15:47,461 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:15:47,461 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-25 06:15:47,461 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [21], [24], [25], [28], [36], [37], [43], [45], [48], [51], [55], [58], [62], [64], [65], [71], [74], [75], [82], [94], [97], [136], [137], [145], [146], [147] [2018-01-25 06:15:47,462 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:15:47,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:16:18,896 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:16:18,897 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:16:18,897 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:16:18,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:16:18,897 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:16:18,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:16:18,903 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:16:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:16:18,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:16:18,924 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:16:18,924 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:16:18,928 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:16:18,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:16:18 BoogieIcfgContainer [2018-01-25 06:16:18,929 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:16:18,929 INFO L168 Benchmark]: Toolchain (without parser) took 48292.01 ms. Allocated memory was 297.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 257.9 MB in the beginning and 573.5 MB in the end (delta: -315.6 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-25 06:16:18,930 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:16:18,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.54 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 245.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:16:18,931 INFO L168 Benchmark]: Boogie Preprocessor took 39.90 ms. Allocated memory is still 297.8 MB. Free memory was 245.8 MB in the beginning and 244.8 MB in the end (delta: 996.5 kB). Peak memory consumption was 996.5 kB. Max. memory is 5.3 GB. [2018-01-25 06:16:18,931 INFO L168 Benchmark]: RCFGBuilder took 378.81 ms. Allocated memory is still 297.8 MB. Free memory was 243.8 MB in the beginning and 220.2 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:16:18,931 INFO L168 Benchmark]: TraceAbstraction took 47654.13 ms. Allocated memory was 297.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 220.2 MB in the beginning and 573.5 MB in the end (delta: -353.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-25 06:16:18,933 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 297.8 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 211.54 ms. Allocated memory is still 297.8 MB. Free memory was 256.8 MB in the beginning and 245.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.90 ms. Allocated memory is still 297.8 MB. Free memory was 245.8 MB in the beginning and 244.8 MB in the end (delta: 996.5 kB). Peak memory consumption was 996.5 kB. Max. memory is 5.3 GB. * RCFGBuilder took 378.81 ms. Allocated memory is still 297.8 MB. Free memory was 243.8 MB in the beginning and 220.2 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47654.13 ms. Allocated memory was 297.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 220.2 MB in the beginning and 573.5 MB in the end (delta: -353.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 34 LocStat_MAX_WEQGRAPH_SIZE : 10 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 471 LocStat_NO_SUPPORTING_DISEQUALITIES : 171 LocStat_NO_DISJUNCTIONS : -68 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 74 TransStat_NO_SUPPORTING_DISEQUALITIES : 17 TransStat_NO_DISJUNCTIONS : 44 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 90.602237 RENAME_VARIABLES(MILLISECONDS) : 24.336891 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 90.538644 PROJECTAWAY(MILLISECONDS) : 0.115542 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.092376 DISJOIN(MILLISECONDS) : 8.546041 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 24.402268 ADD_EQUALITY(MILLISECONDS) : 0.054333 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015623 #CONJOIN_DISJUNCTIVE : 90 #RENAME_VARIABLES : 156 #UNFREEZE : 0 #CONJOIN : 176 #PROJECTAWAY : 113 #ADD_WEAK_EQUALITY : 24 #DISJOIN : 16 #RENAME_VARIABLES_DISJUNCTIVE : 145 #ADD_EQUALITY : 80 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 10 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 83 locations, 27 error locations. TIMEOUT Result, 47.6s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 2.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 677 SDtfs, 1646 SDslu, 1807 SDs, 0 SdLazy, 1631 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 40.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 223 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 413 ConstructedInterpolants, 38 QuantifiedInterpolants, 92803 SizeOfPredicates, 36 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 12/27 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-16-18-943.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-16-18-943.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-16-18-943.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-16-18-943.csv Completed graceful shutdown