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-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:54:47,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:54:47,623 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:54:47,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:54:47,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:54:47,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:54:47,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:54:47,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:54:47,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:54:47,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:54:47,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:54:47,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:54:47,649 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:54:47,651 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:54:47,651 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:54:47,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:54:47,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:54:47,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:54:47,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:54:47,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:54:47,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:54:47,665 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:54:47,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:54:47,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:54:47,667 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:54:47,668 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:54:47,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:54:47,669 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:54:47,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:54:47,670 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:54:47,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:54:47,671 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 05:54:47,681 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:54:47,682 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:54:47,682 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:54:47,683 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:54:47,683 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:54:47,683 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:54:47,683 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:54:47,684 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:54:47,684 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:54:47,685 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:54:47,685 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:54:47,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:54:47,685 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:54:47,685 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:54:47,686 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:54:47,686 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:54:47,686 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:54:47,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:54:47,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:54:47,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:54:47,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:54:47,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:54:47,687 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:54:47,687 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:54:47,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:54:47,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:54:47,688 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:54:47,688 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:54:47,688 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:54:47,689 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:54:47,689 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:54:47,689 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:54:47,689 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:54:47,690 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:54:47,691 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:54:47,691 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:54:47,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:54:47,741 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:54:47,745 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:54:47,747 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:54:47,747 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:54:47,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-25 05:54:47,929 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:54:47,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:54:47,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:54:47,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:54:47,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:54:47,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:54:47" (1/1) ... [2018-01-25 05:54:47,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbac6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:47, skipping insertion in model container [2018-01-25 05:54:47,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:54:47" (1/1) ... [2018-01-25 05:54:47,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:54:48,017 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:54:48,131 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:54:48,153 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:54:48,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48 WrapperNode [2018-01-25 05:54:48,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:54:48,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:54:48,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:54:48,163 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:54:48,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (1/1) ... [2018-01-25 05:54:48,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (1/1) ... [2018-01-25 05:54:48,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (1/1) ... [2018-01-25 05:54:48,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (1/1) ... [2018-01-25 05:54:48,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (1/1) ... [2018-01-25 05:54:48,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (1/1) ... [2018-01-25 05:54:48,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (1/1) ... [2018-01-25 05:54:48,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:54:48,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:54:48,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:54:48,193 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:54:48,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (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 05:54:48,245 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:54:48,245 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:54:48,245 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 05:54:48,245 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:54:48,245 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:54:48,245 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:54:48,245 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:54:48,246 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:54:48,476 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:54:48,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:54:48 BoogieIcfgContainer [2018-01-25 05:54:48,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:54:48,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:54:48,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:54:48,479 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:54:48,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:54:47" (1/3) ... [2018-01-25 05:54:48,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fef6bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:54:48, skipping insertion in model container [2018-01-25 05:54:48,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:54:48" (2/3) ... [2018-01-25 05:54:48,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fef6bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:54:48, skipping insertion in model container [2018-01-25 05:54:48,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:54:48" (3/3) ... [2018-01-25 05:54:48,483 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-25 05:54:48,489 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:54:48,495 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 05:54:48,540 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:54:48,540 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:54:48,540 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:54:48,540 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:54:48,541 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:54:48,541 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:54:48,541 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:54:48,541 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:54:48,542 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:54:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-25 05:54:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:54:48,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:48,570 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:48,570 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1159416495, now seen corresponding path program 1 times [2018-01-25 05:54:48,576 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:48,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:48,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:48,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:48,620 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:48,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:48,705 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 05:54:48,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:48,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:54:48,707 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:48,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:54:48,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:54:48,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:54:48,722 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-25 05:54:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:48,743 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-01-25 05:54:48,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:54:48,744 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-25 05:54:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:48,752 INFO L225 Difference]: With dead ends: 109 [2018-01-25 05:54:48,752 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 05:54:48,755 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 05:54:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 05:54:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-25 05:54:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:54:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-25 05:54:48,866 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2018-01-25 05:54:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:48,867 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-25 05:54:48,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:54:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-25 05:54:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:54:48,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:48,868 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:48,868 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 91943959, now seen corresponding path program 1 times [2018-01-25 05:54:48,868 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:48,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:48,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:48,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:48,870 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:48,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:48,965 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 05:54:48,965 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:48,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:48,965 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:48,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:54:48,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:54:48,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:48,968 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 4 states. [2018-01-25 05:54:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:49,097 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-01-25 05:54:49,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:54:49,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:54:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:49,099 INFO L225 Difference]: With dead ends: 56 [2018-01-25 05:54:49,100 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:54:49,101 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:54:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 05:54:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:54:49,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-25 05:54:49,108 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 14 [2018-01-25 05:54:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:49,109 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-25 05:54:49,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:54:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-25 05:54:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:54:49,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:49,110 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:49,110 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash 91943960, now seen corresponding path program 1 times [2018-01-25 05:54:49,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:49,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,112 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:49,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,112 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:49,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:49,226 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 05:54:49,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:49,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:54:49,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:49,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:49,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:49,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:49,227 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2018-01-25 05:54:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:49,319 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-01-25 05:54:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:49,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:54:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:49,321 INFO L225 Difference]: With dead ends: 55 [2018-01-25 05:54:49,321 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:54:49,321 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 05:54:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:54:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 05:54:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:54:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-01-25 05:54:49,327 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 14 [2018-01-25 05:54:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:49,327 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-01-25 05:54:49,327 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-01-25 05:54:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:54:49,328 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:49,328 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] [2018-01-25 05:54:49,328 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash -255124515, now seen corresponding path program 1 times [2018-01-25 05:54:49,329 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:49,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:49,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,330 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:49,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:49,468 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 05:54:49,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:49,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:54:49,469 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:49,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:54:49,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:54:49,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:54:49,470 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 6 states. [2018-01-25 05:54:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:49,582 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-01-25 05:54:49,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:49,583 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 05:54:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:49,583 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:54:49,584 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:54:49,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 05:54:49,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:54:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:54:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:54:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-25 05:54:49,589 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2018-01-25 05:54:49,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:49,590 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-25 05:54:49,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:54:49,590 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-25 05:54:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:54:49,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:49,591 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] [2018-01-25 05:54:49,591 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:49,591 INFO L82 PathProgramCache]: Analyzing trace with hash -255124514, now seen corresponding path program 1 times [2018-01-25 05:54:49,591 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:49,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:49,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,592 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:49,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:49,722 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 05:54:49,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:49,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:54:49,723 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:49,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:54:49,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:54:49,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:54:49,724 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 7 states. [2018-01-25 05:54:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:49,891 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-01-25 05:54:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:54:49,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-25 05:54:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:49,896 INFO L225 Difference]: With dead ends: 91 [2018-01-25 05:54:49,896 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 05:54:49,896 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:54:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 05:54:49,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-01-25 05:54:49,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:54:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-25 05:54:49,903 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 20 [2018-01-25 05:54:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:49,903 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-25 05:54:49,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:54:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-25 05:54:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:54:49,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:49,904 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] [2018-01-25 05:54:49,904 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:49,904 INFO L82 PathProgramCache]: Analyzing trace with hash 468265909, now seen corresponding path program 1 times [2018-01-25 05:54:49,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:49,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:49,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:49,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:49,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:49,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:49,987 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:49,988 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 05:54:49,990 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [57], [58], [59], [60], [61], [64], [93], [94], [95], [97] [2018-01-25 05:54:50,036 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:54:50,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:54:51,119 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:54:51,120 INFO L268 AbstractInterpreter]: Visited 22 different actions 31 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-25 05:54:51,130 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:54:51,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:51,130 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 05:54:51,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:51,146 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:51,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:51,267 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 05:54:51,267 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:51,306 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 05:54:51,327 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:54:51,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-25 05:54:51,327 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:51,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:51,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:51,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:54:51,328 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-25 05:54:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:51,392 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-01-25 05:54:51,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:51,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 05:54:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:51,394 INFO L225 Difference]: With dead ends: 124 [2018-01-25 05:54:51,394 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 05:54:51,395 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:54:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 05:54:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2018-01-25 05:54:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 05:54:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-25 05:54:51,401 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-25 05:54:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:51,402 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-25 05:54:51,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-25 05:54:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:54:51,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:51,403 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:51,403 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash -504403376, now seen corresponding path program 1 times [2018-01-25 05:54:51,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:51,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:51,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:51,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:51,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:51,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:51,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:51,681 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:51,681 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 05:54:51,682 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [53], [57], [58], [59], [60], [61], [64], [93], [94], [95], [97] [2018-01-25 05:54:51,683 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:54:51,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:54:53,306 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:54:53,306 INFO L268 AbstractInterpreter]: Visited 23 different actions 58 times. Merged at 15 different actions 28 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-01-25 05:54:53,360 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:54:53,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:53,360 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:53,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:53,368 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:53,404 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:53,431 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 05:54:53,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:53,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:53,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-25 05:54:53,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 16 treesize of output 15 [2018-01-25 05:54:53,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:53,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:54:53,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-01-25 05:54:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:53,612 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:54,012 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 15 treesize of output 19 [2018-01-25 05:54:54,035 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 8 treesize of output 1 [2018-01-25 05:54:54,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-01-25 05:54:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:54,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:54,078 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:54:54,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:54,082 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:54,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:54,134 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 05:54:54,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,140 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 05:54:54,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-01-25 05:54:54,191 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:54,192 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 16 treesize of output 19 [2018-01-25 05:54:54,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,214 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:54,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:54,216 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 05:54:54,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-25 05:54:54,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-01-25 05:54:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:54,442 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:54,542 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 10 treesize of output 3 [2018-01-25 05:54:54,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,545 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-01-25 05:54:54,555 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 8 treesize of output 1 [2018-01-25 05:54:54,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:54,561 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-01-25 05:54:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:54,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:54:54,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 8, 8] total 24 [2018-01-25 05:54:54,580 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:54:54,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:54:54,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:54:54,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=479, Unknown=1, NotChecked=0, Total=600 [2018-01-25 05:54:54,581 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 13 states. [2018-01-25 05:54:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:54,915 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-25 05:54:54,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:54:54,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-01-25 05:54:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:54,916 INFO L225 Difference]: With dead ends: 139 [2018-01-25 05:54:54,917 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 05:54:54,917 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=159, Invalid=596, Unknown=1, NotChecked=0, Total=756 [2018-01-25 05:54:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 05:54:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2018-01-25 05:54:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-25 05:54:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-01-25 05:54:54,927 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 27 [2018-01-25 05:54:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:54,927 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-01-25 05:54:54,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:54:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-01-25 05:54:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:54:54,928 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:54,928 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, 1, 1] [2018-01-25 05:54:54,929 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 616992647, now seen corresponding path program 1 times [2018-01-25 05:54:54,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:54,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:54,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:54,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:54,930 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:54,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:54,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:54,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:54,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:54,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:54:54,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:54:54,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:54,990 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 4 states. [2018-01-25 05:54:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:55,067 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-25 05:54:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:55,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-25 05:54:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:55,070 INFO L225 Difference]: With dead ends: 80 [2018-01-25 05:54:55,071 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 05:54:55,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 05:54:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-25 05:54:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 05:54:55,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-25 05:54:55,081 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 29 [2018-01-25 05:54:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:55,081 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-25 05:54:55,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:54:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-25 05:54:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:54:55,082 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:55,082 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, 1, 1] [2018-01-25 05:54:55,082 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash 616992648, now seen corresponding path program 1 times [2018-01-25 05:54:55,083 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:55,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:55,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:55,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:55,084 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:55,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:55,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:55,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:54:55,226 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:55,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:54:55,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:54:55,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:54:55,227 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 7 states. [2018-01-25 05:54:55,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:55,328 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-01-25 05:54:55,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:54:55,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-25 05:54:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:55,329 INFO L225 Difference]: With dead ends: 80 [2018-01-25 05:54:55,329 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 05:54:55,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 05:54:55,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-25 05:54:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-25 05:54:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-25 05:54:55,340 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 29 [2018-01-25 05:54:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:55,340 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-25 05:54:55,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:54:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-25 05:54:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:54:55,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:55,342 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, 1, 1, 1] [2018-01-25 05:54:55,342 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1946902913, now seen corresponding path program 1 times [2018-01-25 05:54:55,342 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:55,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:55,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:55,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:55,344 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:55,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:55,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:55,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:54:55,414 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:55,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:54:55,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:54:55,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:54:55,414 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 4 states. [2018-01-25 05:54:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:55,604 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-01-25 05:54:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:55,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-25 05:54:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:55,605 INFO L225 Difference]: With dead ends: 91 [2018-01-25 05:54:55,605 INFO L226 Difference]: Without dead ends: 90 [2018-01-25 05:54:55,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:54:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-25 05:54:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2018-01-25 05:54:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-25 05:54:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-25 05:54:55,612 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 30 [2018-01-25 05:54:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:55,613 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-25 05:54:55,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:54:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-25 05:54:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:54:55,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:55,614 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:55,614 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash 746385703, now seen corresponding path program 2 times [2018-01-25 05:54:55,615 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:55,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:55,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:55,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:55,616 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:55,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:55,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:55,730 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:55,730 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:54:55,731 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:54:55,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:55,731 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:55,744 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:54:55,744 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:54:55,759 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:55,765 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:55,766 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:54:55,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:55,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:55,887 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:55,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:55,936 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:54:55,939 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:54:55,939 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:54:55,957 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:55,986 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:54:55,997 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:54:56,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:56,007 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:56,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:54:56,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 15 [2018-01-25 05:54:56,025 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:54:56,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:54:56,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:54:56,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:54:56,026 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 12 states. [2018-01-25 05:54:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:56,225 INFO L93 Difference]: Finished difference Result 166 states and 171 transitions. [2018-01-25 05:54:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:54:56,225 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-01-25 05:54:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:56,226 INFO L225 Difference]: With dead ends: 166 [2018-01-25 05:54:56,226 INFO L226 Difference]: Without dead ends: 136 [2018-01-25 05:54:56,226 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:54:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-25 05:54:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 108. [2018-01-25 05:54:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-25 05:54:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-01-25 05:54:56,234 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 31 [2018-01-25 05:54:56,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:56,234 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-01-25 05:54:56,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:54:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-01-25 05:54:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:54:56,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:56,235 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, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:56,235 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:56,235 INFO L82 PathProgramCache]: Analyzing trace with hash 946337879, now seen corresponding path program 1 times [2018-01-25 05:54:56,235 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:56,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:56,236 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:54:56,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:56,236 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:56,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:56,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:56,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:54:56,300 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:56,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:54:56,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:54:56,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:54:56,301 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 6 states. [2018-01-25 05:54:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:56,348 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-01-25 05:54:56,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:54:56,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-25 05:54:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:56,349 INFO L225 Difference]: With dead ends: 108 [2018-01-25 05:54:56,349 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 05:54:56,350 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 05:54:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-01-25 05:54:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 05:54:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-01-25 05:54:56,361 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 33 [2018-01-25 05:54:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:56,361 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-01-25 05:54:56,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:54:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-01-25 05:54:56,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:54:56,363 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:56,363 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, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:56,363 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:56,363 INFO L82 PathProgramCache]: Analyzing trace with hash 946337880, now seen corresponding path program 1 times [2018-01-25 05:54:56,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:56,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:56,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:56,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:56,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:56,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:56,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:56,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:54:56,446 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:56,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:54:56,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:54:56,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:54:56,447 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 8 states. [2018-01-25 05:54:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:56,565 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-01-25 05:54:56,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 05:54:56,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-01-25 05:54:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:56,566 INFO L225 Difference]: With dead ends: 107 [2018-01-25 05:54:56,566 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 05:54:56,567 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:54:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 05:54:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-01-25 05:54:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 05:54:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-01-25 05:54:56,574 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 33 [2018-01-25 05:54:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:56,574 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-01-25 05:54:56,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:54:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-01-25 05:54:56,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:54:56,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:56,575 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, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:56,575 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash 946329935, now seen corresponding path program 1 times [2018-01-25 05:54:56,576 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:56,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:56,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:56,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:56,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:56,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:54:56,848 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:56,848 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:56,848 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 05:54:56,848 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [16], [20], [24], [27], [38], [42], [46], [48], [51], [57], [58], [59], [60], [61], [64], [66], [69], [74], [75], [79], [93], [94], [95], [97], [98] [2018-01-25 05:54:56,850 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:54:56,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:54:58,469 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:54:58,470 INFO L268 AbstractInterpreter]: Visited 32 different actions 51 times. Merged at 9 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 29 variables. [2018-01-25 05:54:58,521 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:54:58,522 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:58,522 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:58,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:58,530 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:54:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:58,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:58,617 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 19 treesize of output 15 [2018-01-25 05:54:58,619 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 15 treesize of output 3 [2018-01-25 05:54:58,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:58,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:58,636 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 05:54:58,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-01-25 05:54:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:58,648 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:58,674 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 18 treesize of output 14 [2018-01-25 05:54:58,676 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2018-01-25 05:54:58,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:58,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:58,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:54:58,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:10 [2018-01-25 05:54:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:54:58,724 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:54:58,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [14] total 17 [2018-01-25 05:54:58,724 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:58,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:54:58,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:54:58,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:54:58,725 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 5 states. [2018-01-25 05:54:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:58,815 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-01-25 05:54:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:54:58,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-25 05:54:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:58,816 INFO L225 Difference]: With dead ends: 114 [2018-01-25 05:54:58,816 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 05:54:58,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-01-25 05:54:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 05:54:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2018-01-25 05:54:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-25 05:54:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-25 05:54:58,826 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 33 [2018-01-25 05:54:58,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:58,826 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-25 05:54:58,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:54:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-25 05:54:58,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:54:58,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:58,827 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:58,828 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:58,828 INFO L82 PathProgramCache]: Analyzing trace with hash 529142380, now seen corresponding path program 1 times [2018-01-25 05:54:58,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:58,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:58,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:58,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:58,829 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:58,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-25 05:54:58,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:54:58,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:54:58,996 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:54:58,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:54:58,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:54:58,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:54:58,997 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-01-25 05:54:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:54:59,176 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-01-25 05:54:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:54:59,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-25 05:54:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:54:59,177 INFO L225 Difference]: With dead ends: 114 [2018-01-25 05:54:59,177 INFO L226 Difference]: Without dead ends: 113 [2018-01-25 05:54:59,178 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:54:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-25 05:54:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-01-25 05:54:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-25 05:54:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-01-25 05:54:59,187 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 34 [2018-01-25 05:54:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:54:59,188 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-01-25 05:54:59,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:54:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-01-25 05:54:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 05:54:59,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:54:59,189 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:54:59,189 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:54:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash 569056812, now seen corresponding path program 3 times [2018-01-25 05:54:59,189 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:54:59,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:59,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:54:59,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:54:59,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:54:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:54:59,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:54:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 05:54:59,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:59,268 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:54:59,269 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:54:59,269 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:54:59,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:59,269 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:54:59,287 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:54:59,287 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:54:59,302 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:54:59,308 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:54:59,309 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:54:59,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:59,316 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 05:54:59,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,321 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 05:54:59,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:54:59,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:59,365 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 16 treesize of output 19 [2018-01-25 05:54:59,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,381 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:59,382 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:59,383 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 05:54:59,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-25 05:54:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 05:54:59,526 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:54:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 05:54:59,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:54:59,739 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:54:59,743 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 05:54:59,743 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 05:54:59,760 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:54:59,788 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 05:54:59,800 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:54:59,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:54:59,809 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 05:54:59,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,819 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 05:54:59,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-25 05:54:59,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:59,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:54:59,829 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 05:54:59,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,836 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 16 treesize of output 19 [2018-01-25 05:54:59,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:54:59,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:54:59,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-25 05:54:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 05:54:59,889 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:55:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 05:55:00,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:55:00,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7, 7, 7] total 19 [2018-01-25 05:55:00,079 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:55:00,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-25 05:55:00,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-25 05:55:00,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2018-01-25 05:55:00,080 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 14 states. [2018-01-25 05:55:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:00,434 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-01-25 05:55:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:55:00,434 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-25 05:55:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:00,435 INFO L225 Difference]: With dead ends: 108 [2018-01-25 05:55:00,435 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 05:55:00,436 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2018-01-25 05:55:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 05:55:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-01-25 05:55:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-25 05:55:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-01-25 05:55:00,445 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 34 [2018-01-25 05:55:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:00,445 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-01-25 05:55:00,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-25 05:55:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2018-01-25 05:55:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:55:00,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:00,446 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:00,446 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:55:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1102363112, now seen corresponding path program 1 times [2018-01-25 05:55:00,447 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:00,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:00,448 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:55:00,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:00,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:00,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 05:55:00,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:00,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:55:00,623 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:00,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:55:00,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:55:00,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:55:00,624 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 9 states. [2018-01-25 05:55:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:00,810 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-01-25 05:55:00,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:55:00,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-25 05:55:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:00,811 INFO L225 Difference]: With dead ends: 105 [2018-01-25 05:55:00,811 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 05:55:00,811 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-25 05:55:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 05:55:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-25 05:55:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-25 05:55:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-01-25 05:55:00,818 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 35 [2018-01-25 05:55:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:00,818 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-01-25 05:55:00,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:55:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-01-25 05:55:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:55:00,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:00,819 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2018-01-25 05:55:00,819 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:55:00,819 INFO L82 PathProgramCache]: Analyzing trace with hash 984721596, now seen corresponding path program 1 times [2018-01-25 05:55:00,819 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:00,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:00,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:00,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:00,820 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:00,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-25 05:55:01,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:01,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:55:01,036 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:01,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:55:01,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:55:01,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:55:01,037 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 9 states. [2018-01-25 05:55:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:01,274 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-01-25 05:55:01,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:55:01,275 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-01-25 05:55:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:01,275 INFO L225 Difference]: With dead ends: 78 [2018-01-25 05:55:01,275 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 05:55:01,276 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:55:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 05:55:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-25 05:55:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 05:55:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-25 05:55:01,283 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 41 [2018-01-25 05:55:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:01,283 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-25 05:55:01,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:55:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-25 05:55:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:55:01,283 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:01,283 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:01,284 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:55:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1657687266, now seen corresponding path program 1 times [2018-01-25 05:55:01,284 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:01,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:01,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:01,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:01,285 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:01,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:55:01,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:01,436 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:55:01,436 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-01-25 05:55:01,436 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [16], [20], [24], [29], [30], [32], [34], [42], [46], [48], [51], [53], [57], [58], [59], [60], [61], [64], [93], [94], [95], [97] [2018-01-25 05:55:01,437 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:55:01,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:55:03,199 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:55:03,199 INFO L268 AbstractInterpreter]: Visited 29 different actions 110 times. Merged at 21 different actions 63 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 28 variables. [2018-01-25 05:55:03,209 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:55:03,209 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:03,209 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:55:03,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:03,226 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:55:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:03,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:55:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:55:03,470 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:55:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:55:03,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:03,658 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:55:03,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:03,664 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:55:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:03,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:55:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:55:03,708 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:55:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:55:03,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:55:03,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 12 [2018-01-25 05:55:03,755 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:55:03,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:55:03,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:55:03,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:55:03,756 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 11 states. [2018-01-25 05:55:03,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:03,916 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-01-25 05:55:03,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 05:55:03,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-25 05:55:03,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:03,917 INFO L225 Difference]: With dead ends: 119 [2018-01-25 05:55:03,917 INFO L226 Difference]: Without dead ends: 102 [2018-01-25 05:55:03,917 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 150 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2018-01-25 05:55:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-25 05:55:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2018-01-25 05:55:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 05:55:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-01-25 05:55:03,924 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 41 [2018-01-25 05:55:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:03,924 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-01-25 05:55:03,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:55:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-01-25 05:55:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 05:55:03,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:03,925 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2018-01-25 05:55:03,925 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 05:55:03,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1214448692, now seen corresponding path program 1 times [2018-01-25 05:55:03,925 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:03,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:03,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:03,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:03,926 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:03,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:03,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:04,702 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:04,702 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:55:04,702 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-25 05:55:04,702 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [12], [16], [20], [24], [27], [29], [30], [34], [38], [42], [46], [48], [51], [53], [57], [58], [59], [60], [61], [64], [66], [69], [74], [75], [79], [93], [94], [95], [97], [98] [2018-01-25 05:55:04,704 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:55:04,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:55:08,967 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:55:08,967 INFO L268 AbstractInterpreter]: Visited 36 different actions 148 times. Merged at 28 different actions 88 times. Never widened. Found 15 fixpoints after 7 different actions. Largest state had 30 variables. [2018-01-25 05:55:09,059 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:55:09,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:09,059 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:55:09,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:09,067 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:55:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:09,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:55:09,116 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 05:55:09,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:55:09,234 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:09,235 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:09,236 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 05:55:09,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-01-25 05:55:09,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-25 05:55:09,292 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 05:55:09,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:55:09,329 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 7 treesize of output 5 [2018-01-25 05:55:09,330 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 05:55:09,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:17 [2018-01-25 05:55:09,640 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 42 [2018-01-25 05:55:09,643 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 19 treesize of output 22 [2018-01-25 05:55:09,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 30 [2018-01-25 05:55:09,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,651 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,663 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 41 treesize of output 40 [2018-01-25 05:55:09,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:09,666 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 14 treesize of output 19 [2018-01-25 05:55:09,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,675 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-25 05:55:09,693 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:70, output treesize:50 [2018-01-25 05:55:09,831 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 81 treesize of output 63 [2018-01-25 05:55:09,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:09,834 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:09,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:09,835 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:09,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 81 [2018-01-25 05:55:09,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 10 [2018-01-25 05:55:09,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:09,858 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:88, output treesize:13 [2018-01-25 05:55:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:09,892 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:55:10,575 WARN L146 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 39 DAG size of output 37 [2018-01-25 05:55:29,599 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-25 05:55:29,608 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-01-25 05:55:29,623 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 9 treesize of output 8 [2018-01-25 05:55:29,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:29,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 99 [2018-01-25 05:55:29,909 WARN L146 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 167 DAG size of output 157 [2018-01-25 05:55:29,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2018-01-25 05:55:29,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 47 [2018-01-25 05:55:29,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-01-25 05:55:29,967 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-25 05:55:29,969 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-01-25 05:55:29,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:29,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:29,993 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:29,993 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:30,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:30,043 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:30,046 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-01-25 05:55:30,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 47 [2018-01-25 05:55:30,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-25 05:55:30,071 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:30,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:30,122 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:30,123 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:30,123 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:30,148 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:30,160 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:30,165 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-01-25 05:55:30,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 51 treesize of output 47 [2018-01-25 05:55:30,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-01-25 05:55:30,265 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-25 05:55:30,267 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-01-25 05:55:30,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:30,329 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:30,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-25 05:55:30,336 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:30,375 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:30,412 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:30,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 134 [2018-01-25 05:55:30,875 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:30,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 103 [2018-01-25 05:55:30,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-01-25 05:55:30,918 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:30,926 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-25 05:55:31,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-25 05:55:31,414 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,424 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-01-25 05:55:31,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 37 [2018-01-25 05:55:31,546 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,553 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,709 INFO L267 ElimStorePlain]: Start of recursive call 20: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:31,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 64 treesize of output 60 [2018-01-25 05:55:31,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-25 05:55:31,730 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:31,731 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-25 05:55:31,736 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:31,762 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:31,773 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,779 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:31,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 64 treesize of output 60 [2018-01-25 05:55:31,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-25 05:55:31,983 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:31,983 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:32,003 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:32,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-25 05:55:32,007 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,021 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,028 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 134 [2018-01-25 05:55:32,067 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:32,067 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 151 [2018-01-25 05:55:32,592 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 251 DAG size of output 138 [2018-01-25 05:55:32,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-01-25 05:55:32,601 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,750 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:32,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-01-25 05:55:32,753 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,860 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:32,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 101 [2018-01-25 05:55:32,869 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:32,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-01-25 05:55:32,931 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:32,986 INFO L267 ElimStorePlain]: Start of recursive call 39: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:33,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-01-25 05:55:33,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-01-25 05:55:33,087 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,093 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-01-25 05:55:33,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-01-25 05:55:33,190 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,199 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-01-25 05:55:33,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-25 05:55:33,306 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-01-25 05:55:33,340 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-25 05:55:33,341 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2018-01-25 05:55:33,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:33,374 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:33,401 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:33,508 INFO L267 ElimStorePlain]: Start of recursive call 37: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:33,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 114 [2018-01-25 05:55:33,825 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:33,825 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 67 treesize of output 63 [2018-01-25 05:55:33,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:33,892 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:33,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-01-25 05:55:33,894 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,902 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 70 treesize of output 66 [2018-01-25 05:55:33,959 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:33,960 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:33,962 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:33,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-01-25 05:55:33,963 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:33,972 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 145 [2018-01-25 05:55:34,268 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 221 DAG size of output 121 [2018-01-25 05:55:34,272 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,272 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,273 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:34,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-01-25 05:55:34,274 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,344 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 88 [2018-01-25 05:55:34,350 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:34,406 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,407 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,408 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 52 [2018-01-25 05:55:34,409 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,574 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,574 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,577 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:34,577 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:34,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2018-01-25 05:55:34,578 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,601 INFO L267 ElimStorePlain]: Start of recursive call 58: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:34,628 INFO L267 ElimStorePlain]: Start of recursive call 52: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:34,630 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 67 treesize of output 63 [2018-01-25 05:55:34,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 45 treesize of output 47 [2018-01-25 05:55:34,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-25 05:55:34,646 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-25 05:55:34,658 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:34,659 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:34,659 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,668 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,675 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 61 treesize of output 57 [2018-01-25 05:55:34,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-25 05:55:34,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-25 05:55:34,961 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:34,982 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:34,982 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:34,982 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,993 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:34,999 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:35,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 131 [2018-01-25 05:55:35,042 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:35,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 107 [2018-01-25 05:55:35,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-01-25 05:55:35,077 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:35,084 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:35,376 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:35,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 75 [2018-01-25 05:55:35,403 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:35,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-01-25 05:55:35,404 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:35,412 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:55:35,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 73 treesize of output 153 [2018-01-25 05:55:35,818 WARN L146 SmtUtils]: Spent 269ms on a formula simplification. DAG size of input: 249 DAG size of output 137 [2018-01-25 05:55:35,822 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:35,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 111 [2018-01-25 05:55:35,835 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:35,839 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:35,840 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:35,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 118 [2018-01-25 05:55:35,857 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 3 xjuncts. [2018-01-25 05:55:35,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-01-25 05:55:35,967 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,021 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:55:36,023 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:36,024 INFO L682 Elim1Store]: detected equality via solver [2018-01-25 05:55:36,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-01-25 05:55:36,027 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-01-25 05:55:36,101 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,152 INFO L267 ElimStorePlain]: Start of recursive call 78: 7 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:36,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-01-25 05:55:36,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 87 [2018-01-25 05:55:36,234 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:36,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-01-25 05:55:36,239 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 104 [2018-01-25 05:55:36,273 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-25 05:55:36,274 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 3 xjuncts. [2018-01-25 05:55:36,310 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:36,360 INFO L267 ElimStorePlain]: Start of recursive call 73: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:36,448 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 52 treesize of output 46 [2018-01-25 05:55:36,448 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,450 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 41 treesize of output 35 [2018-01-25 05:55:36,450 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 93 [2018-01-25 05:55:36,522 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 3 xjuncts. [2018-01-25 05:55:36,575 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-01-25 05:55:36,579 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-25 05:55:36,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 81 [2018-01-25 05:55:36,612 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 3 xjuncts. [2018-01-25 05:55:36,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 69 [2018-01-25 05:55:36,626 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 2 xjuncts. [2018-01-25 05:55:36,626 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:55:36,626 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,644 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:36,659 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:55:36,823 INFO L267 ElimStorePlain]: Start of recursive call 4: 13 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-25 05:55:36,828 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 1 case distinctions, treesize of input 36 treesize of output 38 [2018-01-25 05:55:36,851 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 26 treesize of output 20 [2018-01-25 05:55:36,851 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,853 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 34 treesize of output 28 [2018-01-25 05:55:36,853 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,855 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 32 treesize of output 26 [2018-01-25 05:55:36,855 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,885 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-25 05:55:36,886 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,887 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-25 05:55:36,887 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,907 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-25 05:55:36,907 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-01-25 05:55:36,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 45 [2018-01-25 05:55:36,919 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 3 xjuncts. Received shutdown request... [2018-01-25 05:55:36,926 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:55:36,926 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:55:36,929 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:55:36,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:55:36 BoogieIcfgContainer [2018-01-25 05:55:36,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:55:36,931 INFO L168 Benchmark]: Toolchain (without parser) took 49001.17 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 764.4 MB). Free memory was 264.0 MB in the beginning and 553.2 MB in the end (delta: -289.2 MB). Peak memory consumption was 700.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:55:36,931 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:55:36,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.15 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:55:36,931 INFO L168 Benchmark]: Boogie Preprocessor took 30.28 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:55:36,932 INFO L168 Benchmark]: RCFGBuilder took 283.86 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 231.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:55:36,932 INFO L168 Benchmark]: TraceAbstraction took 48452.29 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 764.4 MB). Free memory was 230.9 MB in the beginning and 553.2 MB in the end (delta: -322.2 MB). Peak memory consumption was 667.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:55:36,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.21 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.15 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.28 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 283.86 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 231.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48452.29 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 764.4 MB). Free memory was 230.9 MB in the beginning and 553.2 MB in the end (delta: -322.2 MB). Peak memory consumption was 667.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 303 LocStat_NO_SUPPORTING_DISEQUALITIES : 46 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 5.664420 RENAME_VARIABLES(MILLISECONDS) : 1.287735 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.570485 PROJECTAWAY(MILLISECONDS) : 0.166012 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.072028 DISJOIN(MILLISECONDS) : 0.388735 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.334099 ADD_EQUALITY(MILLISECONDS) : 0.041864 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016795 #CONJOIN_DISJUNCTIVE : 51 #RENAME_VARIABLES : 93 #UNFREEZE : 0 #CONJOIN : 111 #PROJECTAWAY : 79 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 87 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 288 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.970604 RENAME_VARIABLES(MILLISECONDS) : 0.606275 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.541143 PROJECTAWAY(MILLISECONDS) : 0.152464 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.056258 DISJOIN(MILLISECONDS) : 0.269020 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.627408 ADD_EQUALITY(MILLISECONDS) : 0.028383 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017019 #CONJOIN_DISJUNCTIVE : 87 #RENAME_VARIABLES : 171 #UNFREEZE : 0 #CONJOIN : 156 #PROJECTAWAY : 122 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 22 #RENAME_VARIABLES_DISJUNCTIVE : 159 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 31 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 471 LocStat_NO_SUPPORTING_DISEQUALITIES : 87 LocStat_NO_DISJUNCTIONS : -62 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 86 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.155886 RENAME_VARIABLES(MILLISECONDS) : 0.005356 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.374680 PROJECTAWAY(MILLISECONDS) : 12.070622 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.067641 DISJOIN(MILLISECONDS) : 0.450047 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.027879 ADD_EQUALITY(MILLISECONDS) : 0.033351 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010448 #CONJOIN_DISJUNCTIVE : 84 #RENAME_VARIABLES : 166 #UNFREEZE : 0 #CONJOIN : 189 #PROJECTAWAY : 136 #ADD_WEAK_EQUALITY : 10 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 162 #ADD_EQUALITY : 80 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 340 LocStat_NO_SUPPORTING_DISEQUALITIES : 53 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 73 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.955587 RENAME_VARIABLES(MILLISECONDS) : 0.106584 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.931573 PROJECTAWAY(MILLISECONDS) : 0.544990 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.072717 DISJOIN(MILLISECONDS) : 0.151336 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.122799 ADD_EQUALITY(MILLISECONDS) : 0.023286 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007555 #CONJOIN_DISJUNCTIVE : 170 #RENAME_VARIABLES : 341 #UNFREEZE : 0 #CONJOIN : 248 #PROJECTAWAY : 216 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 47 #RENAME_VARIABLES_DISJUNCTIVE : 323 #ADD_EQUALITY : 76 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 4 LocStat_NO_SUPPORTING_EQUALITIES : 449 LocStat_NO_SUPPORTING_DISEQUALITIES : 75 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 42 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 90 TransStat_NO_SUPPORTING_DISEQUALITIES : 9 TransStat_NO_DISJUNCTIONS : 46 TransStat_MAX_NO_DISJUNCTIONS : 4 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.824847 RENAME_VARIABLES(MILLISECONDS) : 0.125761 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.801141 PROJECTAWAY(MILLISECONDS) : 0.040886 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.065980 DISJOIN(MILLISECONDS) : 0.192105 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.143081 ADD_EQUALITY(MILLISECONDS) : 0.025715 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010182 #CONJOIN_DISJUNCTIVE : 241 #RENAME_VARIABLES : 542 #UNFREEZE : 0 #CONJOIN : 431 #PROJECTAWAY : 358 #ADD_WEAK_EQUALITY : 12 #DISJOIN : 45 #RENAME_VARIABLES_DISJUNCTIVE : 525 #ADD_EQUALITY : 85 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 26. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 59 locations, 19 error locations. TIMEOUT Result, 48.3s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 707 SDtfs, 1376 SDslu, 1526 SDs, 0 SdLazy, 1871 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 588 SyntacticMatches, 35 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 10.6s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 129 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 857 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1141 ConstructedInterpolants, 89 QuantifiedInterpolants, 231408 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1476 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 242/341 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/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-25_05-55-36-947.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-55-36-947.csv Completed graceful shutdown