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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:37:19,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:37:19,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:37:19,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:37:19,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:37:19,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:37:19,020 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:37:19,021 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:37:19,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:37:19,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:37:19,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:37:19,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:37:19,025 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:37:19,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:37:19,027 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:37:19,028 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:37:19,030 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:37:19,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:37:19,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:37:19,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:37:19,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:37:19,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:37:19,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:37:19,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:37:19,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:37:19,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:37:19,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:37:19,038 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:37:19,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:37:19,038 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:37:19,039 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:37:19,039 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:37:19,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:37:19,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:37:19,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:37:19,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:37:19,050 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:37:19,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:37:19,051 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:37:19,051 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:37:19,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:37:19,051 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:37:19,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:37:19,051 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:37:19,051 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:37:19,052 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:37:19,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:37:19,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:37:19,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:37:19,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:37:19,052 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:37:19,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:37:19,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:37:19,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:37:19,053 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:37:19,053 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:37:19,053 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:37:19,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:37:19,091 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:37:19,094 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:37:19,095 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:37:19,096 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:37:19,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-02-02 18:37:19,234 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:37:19,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:37:19,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:37:19,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:37:19,241 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:37:19,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebe4d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19, skipping insertion in model container [2018-02-02 18:37:19,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,255 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:37:19,282 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:37:19,371 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:37:19,388 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:37:19,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19 WrapperNode [2018-02-02 18:37:19,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:37:19,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:37:19,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:37:19,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:37:19,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... [2018-02-02 18:37:19,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:37:19,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:37:19,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:37:19,426 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:37:19,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 18:37:19,461 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:37:19,461 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:37:19,461 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-02 18:37:19,461 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-02 18:37:19,461 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:37:19,461 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:37:19,462 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-02 18:37:19,463 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-02 18:37:19,463 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:37:19,463 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:37:19,463 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:37:19,694 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:37:19,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:37:19 BoogieIcfgContainer [2018-02-02 18:37:19,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:37:19,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:37:19,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:37:19,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:37:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:37:19" (1/3) ... [2018-02-02 18:37:19,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cabad46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:37:19, skipping insertion in model container [2018-02-02 18:37:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:19" (2/3) ... [2018-02-02 18:37:19,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cabad46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:37:19, skipping insertion in model container [2018-02-02 18:37:19,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:37:19" (3/3) ... [2018-02-02 18:37:19,700 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-02-02 18:37:19,705 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:37:19,710 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 18:37:19,734 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:37:19,735 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:37:19,735 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:37:19,735 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:37:19,735 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:37:19,735 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:37:19,735 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:37:19,735 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:37:19,736 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:37:19,746 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 18:37:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 18:37:19,754 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:19,755 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:19,755 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:19,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-02 18:37:19,759 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:19,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:19,790 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:19,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:19,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:19,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:19,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:19,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:37:19,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 18:37:19,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 18:37:19,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 18:37:19,891 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-02 18:37:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:19,965 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-02 18:37:19,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 18:37:19,966 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 18:37:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:19,976 INFO L225 Difference]: With dead ends: 76 [2018-02-02 18:37:19,976 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 18:37:19,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 18:37:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 18:37:20,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 18:37:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 18:37:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-02 18:37:20,006 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-02 18:37:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,006 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-02 18:37:20,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 18:37:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-02 18:37:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:37:20,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,007 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,007 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-02 18:37:20,008 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,009 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:20,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:20,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:20,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:20,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:20,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:20,058 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-02 18:37:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:20,083 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-02 18:37:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:20,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 18:37:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:20,084 INFO L225 Difference]: With dead ends: 74 [2018-02-02 18:37:20,085 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 18:37:20,085 INFO L554 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-02-02 18:37:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 18:37:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 18:37:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 18:37:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-02 18:37:20,091 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-02 18:37:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,092 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-02 18:37:20,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-02 18:37:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 18:37:20,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,093 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,093 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-02 18:37:20,093 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:20,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:20,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:20,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:20,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:20,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:20,165 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-02 18:37:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:20,194 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-02 18:37:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:20,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 18:37:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:20,196 INFO L225 Difference]: With dead ends: 132 [2018-02-02 18:37:20,196 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 18:37:20,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 18:37:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-02 18:37:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 18:37:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-02 18:37:20,206 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-02 18:37:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,206 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-02 18:37:20,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:20,207 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-02 18:37:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 18:37:20,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,207 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,207 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-02 18:37:20,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,209 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:20,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:20,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:37:20,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:20,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:20,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:20,248 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-02 18:37:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:20,296 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-02 18:37:20,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:20,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 18:37:20,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:20,298 INFO L225 Difference]: With dead ends: 147 [2018-02-02 18:37:20,298 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 18:37:20,298 INFO L554 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-02-02 18:37:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 18:37:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-02 18:37:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 18:37:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-02 18:37:20,306 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-02 18:37:20,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,306 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-02 18:37:20,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-02 18:37:20,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 18:37:20,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,307 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,307 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-02 18:37:20,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,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-02-02 18:37:20,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:20,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:37:20,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:37:20,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:37:20,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:20,375 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-02 18:37:20,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:20,429 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-02 18:37:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:37:20,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 18:37:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:20,432 INFO L225 Difference]: With dead ends: 255 [2018-02-02 18:37:20,432 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 18:37:20,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:37:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 18:37:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-02 18:37:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 18:37:20,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-02 18:37:20,449 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-02 18:37:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,449 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-02 18:37:20,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:37:20,450 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-02 18:37:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:37:20,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,450 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,450 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-02 18:37:20,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:20,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:20,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:20,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:37:20,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:37:20,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:37:20,496 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-02 18:37:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:20,602 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-02 18:37:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:37:20,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:37:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:20,606 INFO L225 Difference]: With dead ends: 386 [2018-02-02 18:37:20,606 INFO L226 Difference]: Without dead ends: 386 [2018-02-02 18:37:20,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-02 18:37:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-02 18:37:20,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 18:37:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-02 18:37:20,621 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-02 18:37:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,622 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-02 18:37:20,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:37:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-02 18:37:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:37:20,622 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,623 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,623 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-02 18:37:20,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:20,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:20,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:20,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:37:20,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:37:20,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:37:20,671 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-02 18:37:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:20,765 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-02 18:37:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:37:20,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:37:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:20,769 INFO L225 Difference]: With dead ends: 485 [2018-02-02 18:37:20,769 INFO L226 Difference]: Without dead ends: 485 [2018-02-02 18:37:20,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-02 18:37:20,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-02 18:37:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-02 18:37:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-02 18:37:20,788 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-02 18:37:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,789 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-02 18:37:20,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:37:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-02 18:37:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:37:20,789 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,790 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,790 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-02 18:37:20,790 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,791 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:20,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:20,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:37:20,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:37:20,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:37:20,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:20,832 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-02 18:37:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:20,865 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-02 18:37:20,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:37:20,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 18:37:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:20,869 INFO L225 Difference]: With dead ends: 861 [2018-02-02 18:37:20,870 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 18:37:20,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:37:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 18:37:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-02 18:37:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-02 18:37:20,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-02 18:37:20,891 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-02 18:37:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:20,891 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-02 18:37:20,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:37:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-02 18:37:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 18:37:20,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:20,892 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:20,893 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-02 18:37:20,893 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:20,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:20,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,894 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:20,894 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:20,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:20,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:20,938 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:20,959 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:21,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:21,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:21,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 9 [2018-02-02 18:37:21,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:37:21,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:37:21,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:37:21,101 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 9 states. [2018-02-02 18:37:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:21,479 INFO L93 Difference]: Finished difference Result 1420 states and 2030 transitions. [2018-02-02 18:37:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 18:37:21,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-02 18:37:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:21,488 INFO L225 Difference]: With dead ends: 1420 [2018-02-02 18:37:21,488 INFO L226 Difference]: Without dead ends: 1420 [2018-02-02 18:37:21,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:37:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-02-02 18:37:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1268. [2018-02-02 18:37:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-02-02 18:37:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1792 transitions. [2018-02-02 18:37:21,531 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1792 transitions. Word has length 26 [2018-02-02 18:37:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:21,532 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1792 transitions. [2018-02-02 18:37:21,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:37:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1792 transitions. [2018-02-02 18:37:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 18:37:21,533 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:21,533 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:21,533 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-02 18:37:21,533 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:21,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:21,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:21,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:21,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:21,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:21,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:21,642 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:21,650 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:21,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:21,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:21,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:37:21,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-02 18:37:21,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:37:21,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:37:21,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:37:21,750 INFO L87 Difference]: Start difference. First operand 1268 states and 1792 transitions. Second operand 12 states. [2018-02-02 18:37:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:22,707 INFO L93 Difference]: Finished difference Result 5418 states and 7954 transitions. [2018-02-02 18:37:22,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 18:37:22,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 18:37:22,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:22,732 INFO L225 Difference]: With dead ends: 5418 [2018-02-02 18:37:22,732 INFO L226 Difference]: Without dead ends: 5418 [2018-02-02 18:37:22,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 18:37:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5418 states. [2018-02-02 18:37:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5418 to 5126. [2018-02-02 18:37:22,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5126 states. [2018-02-02 18:37:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 7531 transitions. [2018-02-02 18:37:22,869 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 7531 transitions. Word has length 27 [2018-02-02 18:37:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:22,869 INFO L432 AbstractCegarLoop]: Abstraction has 5126 states and 7531 transitions. [2018-02-02 18:37:22,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:37:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 7531 transitions. [2018-02-02 18:37:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 18:37:22,870 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:22,871 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:22,873 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:22,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-02 18:37:22,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:22,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:22,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:22,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:22,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:22,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:22,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:22,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:22,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:37:22,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:37:22,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:37:22,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:37:22,944 INFO L87 Difference]: Start difference. First operand 5126 states and 7531 transitions. Second operand 7 states. [2018-02-02 18:37:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:23,135 INFO L93 Difference]: Finished difference Result 2190 states and 2828 transitions. [2018-02-02 18:37:23,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:37:23,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 18:37:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:23,140 INFO L225 Difference]: With dead ends: 2190 [2018-02-02 18:37:23,140 INFO L226 Difference]: Without dead ends: 1842 [2018-02-02 18:37:23,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:37:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2018-02-02 18:37:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1685. [2018-02-02 18:37:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2018-02-02 18:37:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2271 transitions. [2018-02-02 18:37:23,166 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 2271 transitions. Word has length 31 [2018-02-02 18:37:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:23,166 INFO L432 AbstractCegarLoop]: Abstraction has 1685 states and 2271 transitions. [2018-02-02 18:37:23,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:37:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 2271 transitions. [2018-02-02 18:37:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:37:23,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:23,168 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:23,168 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:23,168 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-02 18:37:23,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:23,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:23,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:23,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:23,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:23,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:23,230 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:23,230 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:23,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:23,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 18:37:23,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:37:23,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-02 18:37:23,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:37:23,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:37:23,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:37:23,336 INFO L87 Difference]: Start difference. First operand 1685 states and 2271 transitions. Second operand 10 states. [2018-02-02 18:37:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:23,969 INFO L93 Difference]: Finished difference Result 1778 states and 2397 transitions. [2018-02-02 18:37:23,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:37:23,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 18:37:23,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:23,974 INFO L225 Difference]: With dead ends: 1778 [2018-02-02 18:37:23,974 INFO L226 Difference]: Without dead ends: 1778 [2018-02-02 18:37:23,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-02-02 18:37:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2018-02-02 18:37:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1546. [2018-02-02 18:37:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-02-02 18:37:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2062 transitions. [2018-02-02 18:37:24,042 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2062 transitions. Word has length 38 [2018-02-02 18:37:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:24,043 INFO L432 AbstractCegarLoop]: Abstraction has 1546 states and 2062 transitions. [2018-02-02 18:37:24,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:37:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2062 transitions. [2018-02-02 18:37:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 18:37:24,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:24,044 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:24,044 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:24,051 INFO L82 PathProgramCache]: Analyzing trace with hash -510703423, now seen corresponding path program 1 times [2018-02-02 18:37:24,052 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:24,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:24,052 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:24,052 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:24,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:24,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:24,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:24,185 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:24,192 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:24,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:37:24,403 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:24,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-02-02 18:37:24,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:37:24,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:37:24,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:37:24,404 INFO L87 Difference]: Start difference. First operand 1546 states and 2062 transitions. Second operand 15 states. [2018-02-02 18:37:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:25,391 INFO L93 Difference]: Finished difference Result 1229 states and 1535 transitions. [2018-02-02 18:37:25,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 18:37:25,391 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-02 18:37:25,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:25,395 INFO L225 Difference]: With dead ends: 1229 [2018-02-02 18:37:25,395 INFO L226 Difference]: Without dead ends: 1175 [2018-02-02 18:37:25,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 18:37:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-02-02 18:37:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1053. [2018-02-02 18:37:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2018-02-02 18:37:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1330 transitions. [2018-02-02 18:37:25,419 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1330 transitions. Word has length 41 [2018-02-02 18:37:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:25,419 INFO L432 AbstractCegarLoop]: Abstraction has 1053 states and 1330 transitions. [2018-02-02 18:37:25,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:37:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1330 transitions. [2018-02-02 18:37:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 18:37:25,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:25,420 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:25,420 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-02 18:37:25,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:25,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:25,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:25,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:25,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:25,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 18:37:25,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:25,500 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:37:25,525 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:25,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:25,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:25,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-02-02 18:37:25,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:37:25,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:37:25,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:37:25,651 INFO L87 Difference]: Start difference. First operand 1053 states and 1330 transitions. Second operand 12 states. [2018-02-02 18:37:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:25,977 INFO L93 Difference]: Finished difference Result 1468 states and 1874 transitions. [2018-02-02 18:37:25,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:37:25,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-02 18:37:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:25,983 INFO L225 Difference]: With dead ends: 1468 [2018-02-02 18:37:25,983 INFO L226 Difference]: Without dead ends: 1468 [2018-02-02 18:37:25,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-02-02 18:37:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-02-02 18:37:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1360. [2018-02-02 18:37:26,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-02-02 18:37:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1732 transitions. [2018-02-02 18:37:26,010 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1732 transitions. Word has length 42 [2018-02-02 18:37:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:26,011 INFO L432 AbstractCegarLoop]: Abstraction has 1360 states and 1732 transitions. [2018-02-02 18:37:26,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:37:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1732 transitions. [2018-02-02 18:37:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:37:26,012 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:26,012 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2018-02-02 18:37:26,012 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-02 18:37:26,012 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:26,012 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:26,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:26,013 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:26,013 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:26,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:26,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:26,096 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:26,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:26,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:26,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:26,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:37:26,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:37:26,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:37:26,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:37:26,230 INFO L87 Difference]: Start difference. First operand 1360 states and 1732 transitions. Second operand 11 states. [2018-02-02 18:37:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:26,400 INFO L93 Difference]: Finished difference Result 1787 states and 2346 transitions. [2018-02-02 18:37:26,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:37:26,401 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 18:37:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:26,405 INFO L225 Difference]: With dead ends: 1787 [2018-02-02 18:37:26,406 INFO L226 Difference]: Without dead ends: 1787 [2018-02-02 18:37:26,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:37:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-02-02 18:37:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1392. [2018-02-02 18:37:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-02-02 18:37:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1780 transitions. [2018-02-02 18:37:26,427 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1780 transitions. Word has length 54 [2018-02-02 18:37:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:26,427 INFO L432 AbstractCegarLoop]: Abstraction has 1392 states and 1780 transitions. [2018-02-02 18:37:26,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:37:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1780 transitions. [2018-02-02 18:37:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:37:26,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:26,428 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:26,428 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-02 18:37:26,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:26,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:26,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:26,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:26,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:26,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 18:37:26,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:26,494 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:26,512 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:26,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 18:37:26,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:26,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-02 18:37:26,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:37:26,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:37:26,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:37:26,678 INFO L87 Difference]: Start difference. First operand 1392 states and 1780 transitions. Second operand 15 states. [2018-02-02 18:37:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:27,091 INFO L93 Difference]: Finished difference Result 2328 states and 3100 transitions. [2018-02-02 18:37:27,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 18:37:27,091 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 18:37:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:27,101 INFO L225 Difference]: With dead ends: 2328 [2018-02-02 18:37:27,101 INFO L226 Difference]: Without dead ends: 2292 [2018-02-02 18:37:27,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 18:37:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2018-02-02 18:37:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 1891. [2018-02-02 18:37:27,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2018-02-02 18:37:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2436 transitions. [2018-02-02 18:37:27,131 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2436 transitions. Word has length 54 [2018-02-02 18:37:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:27,131 INFO L432 AbstractCegarLoop]: Abstraction has 1891 states and 2436 transitions. [2018-02-02 18:37:27,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:37:27,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2436 transitions. [2018-02-02 18:37:27,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 18:37:27,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:27,132 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2018-02-02 18:37:27,132 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-02 18:37:27,132 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:27,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:27,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:27,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:27,133 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:27,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-02 18:37:27,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:27,198 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:27,204 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:27,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 18:37:27,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:27,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:37:27,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:37:27,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:37:27,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:37:27,331 INFO L87 Difference]: Start difference. First operand 1891 states and 2436 transitions. Second operand 11 states. [2018-02-02 18:37:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:27,530 INFO L93 Difference]: Finished difference Result 2286 states and 2984 transitions. [2018-02-02 18:37:27,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:37:27,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-02 18:37:27,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:27,535 INFO L225 Difference]: With dead ends: 2286 [2018-02-02 18:37:27,535 INFO L226 Difference]: Without dead ends: 2286 [2018-02-02 18:37:27,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-02-02 18:37:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2018-02-02 18:37:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2262. [2018-02-02 18:37:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-02-02 18:37:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2964 transitions. [2018-02-02 18:37:27,569 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 2964 transitions. Word has length 68 [2018-02-02 18:37:27,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:27,569 INFO L432 AbstractCegarLoop]: Abstraction has 2262 states and 2964 transitions. [2018-02-02 18:37:27,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:37:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 2964 transitions. [2018-02-02 18:37:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 18:37:27,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:27,571 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:27,571 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-02 18:37:27,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:27,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:27,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:27,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:27,572 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:27,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 18:37:27,723 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:27,723 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:27,731 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:27,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 18:37:27,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:27,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-02 18:37:27,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 18:37:27,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 18:37:27,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-02 18:37:27,949 INFO L87 Difference]: Start difference. First operand 2262 states and 2964 transitions. Second operand 18 states. [2018-02-02 18:37:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:28,795 INFO L93 Difference]: Finished difference Result 3956 states and 5250 transitions. [2018-02-02 18:37:28,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 18:37:28,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-02 18:37:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:28,807 INFO L225 Difference]: With dead ends: 3956 [2018-02-02 18:37:28,808 INFO L226 Difference]: Without dead ends: 3908 [2018-02-02 18:37:28,808 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 18:37:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2018-02-02 18:37:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 2893. [2018-02-02 18:37:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2018-02-02 18:37:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 3736 transitions. [2018-02-02 18:37:28,879 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 3736 transitions. Word has length 70 [2018-02-02 18:37:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:28,880 INFO L432 AbstractCegarLoop]: Abstraction has 2893 states and 3736 transitions. [2018-02-02 18:37:28,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 18:37:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3736 transitions. [2018-02-02 18:37:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 18:37:28,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:28,881 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:28,881 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:28,882 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-02 18:37:28,882 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:28,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:28,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:28,883 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:28,883 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:28,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 18:37:29,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:29,084 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:29,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:29,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-02 18:37:29,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:29,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-02 18:37:29,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 18:37:29,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 18:37:29,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:37:29,300 INFO L87 Difference]: Start difference. First operand 2893 states and 3736 transitions. Second operand 17 states. [2018-02-02 18:37:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:29,880 INFO L93 Difference]: Finished difference Result 3874 states and 5090 transitions. [2018-02-02 18:37:29,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 18:37:29,880 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-02 18:37:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:29,892 INFO L225 Difference]: With dead ends: 3874 [2018-02-02 18:37:29,892 INFO L226 Difference]: Without dead ends: 3806 [2018-02-02 18:37:29,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 18:37:29,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3806 states. [2018-02-02 18:37:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3806 to 2827. [2018-02-02 18:37:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2018-02-02 18:37:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3616 transitions. [2018-02-02 18:37:29,956 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3616 transitions. Word has length 84 [2018-02-02 18:37:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:29,957 INFO L432 AbstractCegarLoop]: Abstraction has 2827 states and 3616 transitions. [2018-02-02 18:37:29,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 18:37:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3616 transitions. [2018-02-02 18:37:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 18:37:29,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:29,958 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:29,958 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-02 18:37:29,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:29,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:29,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:29,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:29,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:29,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 18:37:30,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:30,057 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:30,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:30,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:30,271 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 18:37:30,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:30,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-02 18:37:30,305 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 18:37:30,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 18:37:30,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:37:30,306 INFO L87 Difference]: Start difference. First operand 2827 states and 3616 transitions. Second operand 17 states. [2018-02-02 18:37:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:31,589 INFO L93 Difference]: Finished difference Result 6759 states and 8680 transitions. [2018-02-02 18:37:31,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-02 18:37:31,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-02-02 18:37:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:31,604 INFO L225 Difference]: With dead ends: 6759 [2018-02-02 18:37:31,604 INFO L226 Difference]: Without dead ends: 6699 [2018-02-02 18:37:31,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1093, Invalid=5387, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 18:37:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2018-02-02 18:37:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 5964. [2018-02-02 18:37:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5964 states. [2018-02-02 18:37:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5964 states to 5964 states and 7670 transitions. [2018-02-02 18:37:31,685 INFO L78 Accepts]: Start accepts. Automaton has 5964 states and 7670 transitions. Word has length 87 [2018-02-02 18:37:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:31,685 INFO L432 AbstractCegarLoop]: Abstraction has 5964 states and 7670 transitions. [2018-02-02 18:37:31,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 18:37:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5964 states and 7670 transitions. [2018-02-02 18:37:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 18:37:31,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:31,688 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:31,688 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:31,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-02-02 18:37:31,688 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:31,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:31,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:31,689 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:31,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:31,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-02 18:37:31,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:31,836 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:31,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:31,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 81 proven. 41 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-02 18:37:32,060 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:32,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-02-02 18:37:32,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 18:37:32,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 18:37:32,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:37:32,061 INFO L87 Difference]: Start difference. First operand 5964 states and 7670 transitions. Second operand 20 states. [2018-02-02 18:37:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:36,940 INFO L93 Difference]: Finished difference Result 17760 states and 23174 transitions. [2018-02-02 18:37:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-02-02 18:37:36,941 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2018-02-02 18:37:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:36,977 INFO L225 Difference]: With dead ends: 17760 [2018-02-02 18:37:36,977 INFO L226 Difference]: Without dead ends: 17586 [2018-02-02 18:37:36,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15935 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4644, Invalid=34362, Unknown=0, NotChecked=0, Total=39006 [2018-02-02 18:37:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17586 states. [2018-02-02 18:37:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17586 to 14223. [2018-02-02 18:37:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14223 states. [2018-02-02 18:37:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14223 states to 14223 states and 18426 transitions. [2018-02-02 18:37:37,183 INFO L78 Accepts]: Start accepts. Automaton has 14223 states and 18426 transitions. Word has length 99 [2018-02-02 18:37:37,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:37,184 INFO L432 AbstractCegarLoop]: Abstraction has 14223 states and 18426 transitions. [2018-02-02 18:37:37,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 18:37:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 14223 states and 18426 transitions. [2018-02-02 18:37:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 18:37:37,185 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:37,185 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2018-02-02 18:37:37,185 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:37,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-02-02 18:37:37,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:37,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:37,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:37,186 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:37,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:37,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 18:37:37,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:37,414 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:37,419 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:37,497 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 18:37:37,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:37,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-02-02 18:37:37,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 18:37:37,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 18:37:37,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:37:37,712 INFO L87 Difference]: Start difference. First operand 14223 states and 18426 transitions. Second operand 20 states. [2018-02-02 18:37:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:39,399 INFO L93 Difference]: Finished difference Result 21029 states and 27224 transitions. [2018-02-02 18:37:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 18:37:39,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 105 [2018-02-02 18:37:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:39,445 INFO L225 Difference]: With dead ends: 21029 [2018-02-02 18:37:39,445 INFO L226 Difference]: Without dead ends: 21029 [2018-02-02 18:37:39,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 109 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=2000, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 18:37:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21029 states. [2018-02-02 18:37:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21029 to 20343. [2018-02-02 18:37:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20343 states. [2018-02-02 18:37:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20343 states to 20343 states and 26286 transitions. [2018-02-02 18:37:39,719 INFO L78 Accepts]: Start accepts. Automaton has 20343 states and 26286 transitions. Word has length 105 [2018-02-02 18:37:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:39,719 INFO L432 AbstractCegarLoop]: Abstraction has 20343 states and 26286 transitions. [2018-02-02 18:37:39,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 18:37:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20343 states and 26286 transitions. [2018-02-02 18:37:39,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-02 18:37:39,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:39,725 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:39,725 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:39,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-02-02 18:37:39,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:39,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:39,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:39,726 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:39,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:39,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-02 18:37:39,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:37:39,847 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:37:39,854 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:39,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-02 18:37:39,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:37:39,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-02 18:37:39,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:37:39,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:37:39,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:37:39,969 INFO L87 Difference]: Start difference. First operand 20343 states and 26286 transitions. Second operand 11 states. [2018-02-02 18:37:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:40,140 INFO L93 Difference]: Finished difference Result 21745 states and 27900 transitions. [2018-02-02 18:37:40,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:37:40,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-02-02 18:37:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:40,175 INFO L225 Difference]: With dead ends: 21745 [2018-02-02 18:37:40,175 INFO L226 Difference]: Without dead ends: 21223 [2018-02-02 18:37:40,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-02 18:37:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21223 states. [2018-02-02 18:37:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21223 to 20285. [2018-02-02 18:37:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20285 states. [2018-02-02 18:37:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20285 states to 20285 states and 25913 transitions. [2018-02-02 18:37:40,422 INFO L78 Accepts]: Start accepts. Automaton has 20285 states and 25913 transitions. Word has length 131 [2018-02-02 18:37:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:40,423 INFO L432 AbstractCegarLoop]: Abstraction has 20285 states and 25913 transitions. [2018-02-02 18:37:40,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:37:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 20285 states and 25913 transitions. [2018-02-02 18:37:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-02 18:37:40,428 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:40,428 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 9, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:40,428 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-02 18:37:40,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1800322707, now seen corresponding path program 1 times [2018-02-02 18:37:40,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:40,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:40,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:40,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:40,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 18:37:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 18:37:40,508 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 18:37:40,556 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 18:37:40,563 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,564 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,565 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,566 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,566 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,568 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,569 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,571 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,572 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,573 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,574 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,575 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,576 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,578 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,579 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,579 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,581 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,581 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,582 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,583 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-02 18:37:40,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:37:40 BoogieIcfgContainer [2018-02-02 18:37:40,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:37:40,595 INFO L168 Benchmark]: Toolchain (without parser) took 21359.93 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 728.8 MB). Free memory was 355.4 MB in the beginning and 816.9 MB in the end (delta: -461.6 MB). Peak memory consumption was 267.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:40,595 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 398.5 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:37:40,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.49 ms. Allocated memory is still 398.5 MB. Free memory was 355.4 MB in the beginning and 344.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:40,596 INFO L168 Benchmark]: Boogie Preprocessor took 29.04 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 342.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:40,596 INFO L168 Benchmark]: RCFGBuilder took 270.00 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 314.8 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:40,596 INFO L168 Benchmark]: TraceAbstraction took 20897.76 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 728.8 MB). Free memory was 314.8 MB in the beginning and 816.9 MB in the end (delta: -502.2 MB). Peak memory consumption was 226.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:37:40,597 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.17 ms. Allocated memory is still 398.5 MB. Free memory is still 362.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.49 ms. Allocated memory is still 398.5 MB. Free memory was 355.4 MB in the beginning and 344.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.04 ms. Allocated memory is still 398.5 MB. Free memory was 344.8 MB in the beginning and 342.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 270.00 ms. Allocated memory is still 398.5 MB. Free memory was 342.1 MB in the beginning and 314.8 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20897.76 ms. Allocated memory was 398.5 MB in the beginning and 1.1 GB in the end (delta: 728.8 MB). Free memory was 314.8 MB in the beginning and 816.9 MB in the end (delta: -502.2 MB). Peak memory consumption was 226.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, t4->next={0:0}, x1={12:0}, x4={0:0}] [L672] RET x4 = t4->next [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L675] COND TRUE S == t4 [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. UNSAFE Result, 20.8s OverallTime, 24 OverallIterations, 11 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2553 SDtfs, 8992 SDslu, 6111 SDs, 0 SdLazy, 14457 SolverSat, 2648 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1708 GetRequests, 1059 SyntacticMatches, 18 SemanticMatches, 631 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20275 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20343occurred in iteration=22, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 9740 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2137 NumberOfCodeBlocks, 2137 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1955 ConstructedInterpolants, 10 QuantifiedInterpolants, 486860 SizeOfPredicates, 65 NumberOfNonLiveVariables, 6933 ConjunctsInSsa, 241 ConjunctsInUnsatCore, 37 InterpolantComputations, 11 PerfectInterpolantSequences, 2100/2639 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-37-40-602.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-37-40-602.csv Received shutdown request...