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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:04:15,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:04:15,601 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:04:15,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:04:15,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:04:15,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:04:15,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:04:15,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:04:15,620 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:04:15,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:04:15,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:04:15,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:04:15,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:04:15,623 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:04:15,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:04:15,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:04:15,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:04:15,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:04:15,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:04:15,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:04:15,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:04:15,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:04:15,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:04:15,635 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:04:15,636 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:04:15,637 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:04:15,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:04:15,638 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:04:15,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:04:15,638 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:04:15,639 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:04:15,639 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:04:15,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:04:15,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:04:15,650 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:04:15,650 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:04:15,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:04:15,651 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:04:15,651 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:04:15,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:04:15,652 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:04:15,652 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:04:15,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:04:15,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:04:15,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:04:15,653 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:04:15,653 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:04:15,653 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:04:15,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:04:15,653 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:04:15,654 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:04:15,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:04:15,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:04:15,654 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:04:15,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:04:15,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:04:15,655 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:04:15,655 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:04:15,655 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:04:15,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:04:15,656 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:04:15,656 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:04:15,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:04:15,656 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:04:15,657 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:04:15,657 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:04:15,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:04:15,704 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:04:15,708 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:04:15,709 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:04:15,710 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:04:15,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-24 12:04:15,899 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:04:15,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:04:15,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:04:15,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:04:15,914 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:04:15,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:04:15" (1/1) ... [2018-01-24 12:04:15,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4661c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:15, skipping insertion in model container [2018-01-24 12:04:15,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:04:15" (1/1) ... [2018-01-24 12:04:15,933 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:04:15,975 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:04:16,081 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:04:16,095 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:04:16,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16 WrapperNode [2018-01-24 12:04:16,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:04:16,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:04:16,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:04:16,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:04:16,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (1/1) ... [2018-01-24 12:04:16,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (1/1) ... [2018-01-24 12:04:16,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (1/1) ... [2018-01-24 12:04:16,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (1/1) ... [2018-01-24 12:04:16,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (1/1) ... [2018-01-24 12:04:16,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (1/1) ... [2018-01-24 12:04:16,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (1/1) ... [2018-01-24 12:04:16,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:04:16,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:04:16,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:04:16,144 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:04:16,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (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-24 12:04:16,196 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:04:16,196 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:04:16,196 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 12:04:16,196 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:04:16,196 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:04:16,196 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:04:16,196 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-24 12:04:16,197 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 12:04:16,197 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:04:16,198 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:04:16,198 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:04:16,316 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 12:04:16,419 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:04:16,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:04:16 BoogieIcfgContainer [2018-01-24 12:04:16,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:04:16,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:04:16,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:04:16,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:04:16,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:04:15" (1/3) ... [2018-01-24 12:04:16,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77411a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:04:16, skipping insertion in model container [2018-01-24 12:04:16,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:04:16" (2/3) ... [2018-01-24 12:04:16,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77411a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:04:16, skipping insertion in model container [2018-01-24 12:04:16,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:04:16" (3/3) ... [2018-01-24 12:04:16,424 INFO L105 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-24 12:04:16,430 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:04:16,436 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 12:04:16,480 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:04:16,480 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:04:16,481 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:04:16,481 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:04:16,481 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:04:16,481 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:04:16,481 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:04:16,482 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:04:16,482 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:04:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-24 12:04:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:04:16,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:16,510 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:04:16,510 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:16,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-01-24 12:04:16,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:16,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:16,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:16,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:16,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:16,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:16,660 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-24 12:04:16,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:04:16,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:04:16,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:04:16,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:04:16,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:16,677 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-24 12:04:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:16,821 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-24 12:04:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:04:16,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:04:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:16,900 INFO L225 Difference]: With dead ends: 65 [2018-01-24 12:04:16,900 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 12:04:16,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 12:04:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 12:04:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 12:04:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-24 12:04:16,937 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-01-24 12:04:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:16,938 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-24 12:04:16,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:04:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-24 12:04:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:04:16,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:16,938 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:04:16,939 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-01-24 12:04:16,939 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:16,939 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:16,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:16,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:16,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:16,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:17,012 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-24 12:04:17,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:04:17,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:04:17,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:04:17,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:04:17,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:17,015 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-01-24 12:04:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:17,060 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-01-24 12:04:17,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:04:17,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:04:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:17,061 INFO L225 Difference]: With dead ends: 57 [2018-01-24 12:04:17,061 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 12:04:17,062 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 12:04:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 12:04:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 12:04:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-01-24 12:04:17,071 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-01-24 12:04:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:17,071 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-01-24 12:04:17,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:04:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-01-24 12:04:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:04:17,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:17,072 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:04:17,072 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-01-24 12:04:17,073 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:17,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:17,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:17,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:17,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:17,187 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-24 12:04:17,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:04:17,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:04:17,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:04:17,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:04:17,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:17,188 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-01-24 12:04:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:17,276 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-01-24 12:04:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:04:17,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 12:04:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:17,277 INFO L225 Difference]: With dead ends: 53 [2018-01-24 12:04:17,278 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 12:04:17,278 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:17,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 12:04:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 12:04:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 12:04:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-01-24 12:04:17,285 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-01-24 12:04:17,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:17,285 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-01-24 12:04:17,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:04:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-01-24 12:04:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:04:17,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:17,287 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:04:17,287 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-01-24 12:04:17,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:17,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:17,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:17,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:17,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:17,373 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-24 12:04:17,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:04:17,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:04:17,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:04:17,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:04:17,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:04:17,374 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-01-24 12:04:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:17,454 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-01-24 12:04:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:04:17,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:04:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:17,456 INFO L225 Difference]: With dead ends: 51 [2018-01-24 12:04:17,456 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 12:04:17,456 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:04:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 12:04:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 12:04:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 12:04:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-01-24 12:04:17,463 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-01-24 12:04:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:17,464 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-01-24 12:04:17,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:04:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-01-24 12:04:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 12:04:17,464 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:17,465 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:04:17,465 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-01-24 12:04:17,465 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:17,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:17,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:17,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:17,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:17,657 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-24 12:04:17,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:04:17,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:04:17,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:04:17,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:04:17,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:04:17,659 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 8 states. [2018-01-24 12:04:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:17,801 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-01-24 12:04:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:04:17,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 12:04:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:17,802 INFO L225 Difference]: With dead ends: 49 [2018-01-24 12:04:17,802 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:04:17,802 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:04:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:04:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 12:04:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:04:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 12:04:17,808 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 15 [2018-01-24 12:04:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:17,808 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 12:04:17,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:04:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 12:04:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:04:17,809 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:17,810 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:04:17,810 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:17,810 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-01-24 12:04:17,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:17,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:17,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:17,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:17,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:17,866 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-24 12:04:17,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:04:17,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:04:17,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:04:17,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:04:17,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:17,868 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2018-01-24 12:04:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:17,901 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-01-24 12:04:17,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:04:17,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-24 12:04:17,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:17,903 INFO L225 Difference]: With dead ends: 46 [2018-01-24 12:04:17,903 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 12:04:17,903 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:04:17,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 12:04:17,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 12:04:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 12:04:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-01-24 12:04:17,909 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-01-24 12:04:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:17,910 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-01-24 12:04:17,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:04:17,910 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-01-24 12:04:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:04:17,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:17,911 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:04:17,911 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:17,911 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-01-24 12:04:17,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:17,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:17,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:17,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:17,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:17,961 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-24 12:04:17,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:04:17,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:04:17,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:04:17,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:04:17,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:04:17,963 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 4 states. [2018-01-24 12:04:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:17,992 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-24 12:04:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:04:17,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-24 12:04:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:17,994 INFO L225 Difference]: With dead ends: 74 [2018-01-24 12:04:17,994 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:04:17,994 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 12:04:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:04:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 12:04:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:04:17,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-24 12:04:18,000 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-01-24 12:04:18,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:18,000 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-24 12:04:18,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:04:18,000 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-24 12:04:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:04:18,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:18,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:04:18,001 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:18,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1523422321, now seen corresponding path program 1 times [2018-01-24 12:04:18,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:18,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:18,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:18,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:18,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:18,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:04:18,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:04:18,097 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-24 12:04:18,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:18,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:04:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:04:18,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:04:18,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-01-24 12:04:18,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:04:18,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:04:18,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:04:18,252 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 8 states. [2018-01-24 12:04:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:18,289 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-24 12:04:18,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:04:18,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 12:04:18,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:18,290 INFO L225 Difference]: With dead ends: 77 [2018-01-24 12:04:18,290 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:04:18,291 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:04:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:04:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 12:04:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:04:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-24 12:04:18,295 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 28 [2018-01-24 12:04:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:18,296 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-24 12:04:18,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:04:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-24 12:04:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 12:04:18,298 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:18,298 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-24 12:04:18,298 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash -944250098, now seen corresponding path program 2 times [2018-01-24 12:04:18,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:18,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:18,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:18,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:18,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:18,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:04:18,419 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:04:18,419 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-24 12:04:18,430 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:04:18,458 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:04:18,462 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:04:18,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:04:18,497 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-24 12:04:18,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:18,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:18,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:04:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:04:18,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:04:18,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2018-01-24 12:04:18,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:04:18,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:04:18,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:04:18,540 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 7 states. [2018-01-24 12:04:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:18,604 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-24 12:04:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:04:18,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-24 12:04:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:18,605 INFO L225 Difference]: With dead ends: 78 [2018-01-24 12:04:18,605 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 12:04:18,606 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:04:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 12:04:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 12:04:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:04:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-24 12:04:18,613 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 29 [2018-01-24 12:04:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:18,613 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-24 12:04:18,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:04:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-24 12:04:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:04:18,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:18,615 INFO L322 BasicCegarLoop]: trace histogram [6, 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] [2018-01-24 12:04:18,615 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 304342049, now seen corresponding path program 1 times [2018-01-24 12:04:18,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:18,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:18,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:18,616 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:04:18,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:18,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:18,768 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 12:04:18,769 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:04:18,769 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:04:18,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:18,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:04:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:04:18,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:04:18,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-01-24 12:04:18,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:04:18,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:04:18,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:04:18,927 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 12 states. [2018-01-24 12:04:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:18,987 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-01-24 12:04:18,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:04:18,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-24 12:04:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:18,997 INFO L225 Difference]: With dead ends: 79 [2018-01-24 12:04:18,997 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 12:04:18,998 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:04:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 12:04:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 12:04:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:04:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-01-24 12:04:19,005 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 41 [2018-01-24 12:04:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:19,006 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-01-24 12:04:19,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:04:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-01-24 12:04:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:04:19,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:19,007 INFO L322 BasicCegarLoop]: trace histogram [8, 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] [2018-01-24 12:04:19,008 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 747384917, now seen corresponding path program 2 times [2018-01-24 12:04:19,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:19,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:19,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:19,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:19,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:19,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-24 12:04:20,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:04:20,000 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-24 12:04:20,005 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:04:20,027 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:04:20,046 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:04:20,050 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:04:20,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:04:20,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:04:20,128 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-24 12:04:20,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-01-24 12:04:20,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-01-24 12:04:20,520 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 40 treesize of output 50 [2018-01-24 12:04:20,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,524 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:04:20,530 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-01-24 12:04:20,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,534 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:04:20,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 46 [2018-01-24 12:04:20,543 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,543 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:04:20,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 32 [2018-01-24 12:04:20,545 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,551 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,579 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 47 treesize of output 53 [2018-01-24 12:04:20,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,611 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 46 treesize of output 58 [2018-01-24 12:04:20,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 78 [2018-01-24 12:04:20,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 109 [2018-01-24 12:04:20,631 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,641 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,647 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,653 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:20,669 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:173, output treesize:65 [2018-01-24 12:04:20,692 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:20,693 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 12 treesize of output 5 [2018-01-24 12:04:20,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-01-24 12:04:20,728 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 7 treesize of output 5 [2018-01-24 12:04:20,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:20,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:20,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-01-24 12:04:27,718 WARN L146 SmtUtils]: Spent 276ms on a formula simplification. DAG size of input: 98 DAG size of output 37 [2018-01-24 12:04:27,720 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-24 12:04:27,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:27,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 54 [2018-01-24 12:04:27,763 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 51 treesize of output 53 [2018-01-24 12:04:27,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,770 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 42 treesize of output 50 [2018-01-24 12:04:27,786 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,789 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 66 [2018-01-24 12:04:27,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,799 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 93 [2018-01-24 12:04:27,811 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:27,827 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:27,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:27,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:27,881 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:27,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:27,897 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:194, output treesize:77 [2018-01-24 12:04:27,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2018-01-24 12:04:27,980 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,981 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,984 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,985 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,986 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:27,999 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-24 12:04:28,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:28,045 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 8 [2018-01-24 12:04:28,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:28,053 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:04:28,053 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 11 treesize of output 7 [2018-01-24 12:04:28,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:28,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:28,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:28,064 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:7 [2018-01-24 12:04:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 3 proven. 44 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:04:28,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:04:28,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 37 [2018-01-24 12:04:28,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-24 12:04:28,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-24 12:04:28,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1247, Unknown=10, NotChecked=0, Total=1406 [2018-01-24 12:04:28,114 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 38 states. [2018-01-24 12:04:36,991 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 69 [2018-01-24 12:04:45,968 WARN L143 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 71 [2018-01-24 12:04:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:04:50,518 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-01-24 12:04:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 12:04:50,518 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 43 [2018-01-24 12:04:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:04:50,521 INFO L225 Difference]: With dead ends: 92 [2018-01-24 12:04:50,521 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:04:50,522 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=352, Invalid=3054, Unknown=16, NotChecked=0, Total=3422 [2018-01-24 12:04:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:04:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 68. [2018-01-24 12:04:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 12:04:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-24 12:04:50,542 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 43 [2018-01-24 12:04:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:04:50,542 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-24 12:04:50,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-24 12:04:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-24 12:04:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:04:50,545 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:04:50,545 INFO L322 BasicCegarLoop]: trace histogram [8, 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] [2018-01-24 12:04:50,545 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-24 12:04:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash 747384918, now seen corresponding path program 1 times [2018-01-24 12:04:50,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:04:50,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:04:50,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:50,546 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:04:50,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:04:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:50,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:04:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-24 12:04:52,250 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:04:52,250 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:04:52,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:04:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:04:52,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:04:52,296 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-24 12:04:52,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:52,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:52,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:04:52,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:52,328 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:52,329 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:04:52,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:52,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:52,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-01-24 12:04:52,368 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-24 12:04:52,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:04:52,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:52,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:52,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:52,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-01-24 12:04:52,450 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-24 12:04:52,452 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 14 treesize of output 10 [2018-01-24 12:04:52,452 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:52,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:52,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:52,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-24 12:04:53,108 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 110 DAG size of output 46 [2018-01-24 12:04:53,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 68 [2018-01-24 12:04:53,138 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 67 treesize of output 69 [2018-01-24 12:04:53,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,144 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 48 treesize of output 57 [2018-01-24 12:04:53,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2018-01-24 12:04:53,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 105 [2018-01-24 12:04:53,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,190 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,200 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:53,253 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:226, output treesize:99 [2018-01-24 12:04:53,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,348 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-01-24 12:04:53,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:53,363 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:91, output treesize:77 [2018-01-24 12:04:53,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,451 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-24 12:04:53,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 12:04:53,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 12:04:53,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:86, output treesize:174 [2018-01-24 12:04:53,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2018-01-24 12:04:53,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,599 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,607 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-01-24 12:04:53,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,644 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 12:04:53,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:53,668 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-01-24 12:04:53,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:53,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:04:53,731 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 88 treesize of output 76 [2018-01-24 12:04:53,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,737 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:04:53,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 80 [2018-01-24 12:04:53,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:04:53,772 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 32 treesize of output 28 [2018-01-24 12:04:53,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:53,793 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 28 treesize of output 24 [2018-01-24 12:04:53,794 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:04:53,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 12:04:53,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-01-24 12:04:53,851 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:174, output treesize:95 [2018-01-24 12:04:54,136 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 34 DAG size of output 30 Received shutdown request... [2018-01-24 12:05:27,851 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 12:05:27,852 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:05:27,855 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:05:27,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:05:27 BoogieIcfgContainer [2018-01-24 12:05:27,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:05:27,856 INFO L168 Benchmark]: Toolchain (without parser) took 71956.52 ms. Allocated memory was 302.0 MB in the beginning and 592.4 MB in the end (delta: 290.5 MB). Free memory was 262.0 MB in the beginning and 533.8 MB in the end (delta: -271.8 MB). Peak memory consumption was 233.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:05:27,857 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:05:27,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.43 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:05:27,858 INFO L168 Benchmark]: Boogie Preprocessor took 37.59 ms. Allocated memory is still 302.0 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:05:27,858 INFO L168 Benchmark]: RCFGBuilder took 275.65 ms. Allocated memory is still 302.0 MB. Free memory was 248.1 MB in the beginning and 227.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:05:27,858 INFO L168 Benchmark]: TraceAbstraction took 71435.93 ms. Allocated memory was 302.0 MB in the beginning and 592.4 MB in the end (delta: 290.5 MB). Free memory was 227.5 MB in the beginning and 533.8 MB in the end (delta: -306.3 MB). Peak memory consumption was 199.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:05:27,860 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 268.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.43 ms. Allocated memory is still 302.0 MB. Free memory was 261.0 MB in the beginning and 250.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.59 ms. Allocated memory is still 302.0 MB. Free memory was 250.1 MB in the beginning and 248.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.65 ms. Allocated memory is still 302.0 MB. Free memory was 248.1 MB in the beginning and 227.5 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 71435.93 ms. Allocated memory was 302.0 MB in the beginning and 592.4 MB in the end (delta: 290.5 MB). Free memory was 227.5 MB in the beginning and 533.8 MB in the end (delta: -306.3 MB). Peak memory consumption was 199.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 421. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 71.3s OverallTime, 12 OverallIterations, 8 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 394 SDtfs, 215 SDslu, 843 SDs, 0 SdLazy, 776 SolverSat, 103 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 126 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 387 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 372 ConstructedInterpolants, 8 QuantifiedInterpolants, 117086 SizeOfPredicates, 12 NumberOfNonLiveVariables, 826 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 51/170 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/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-05-27-869.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-05-27-869.csv Completed graceful shutdown