java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:05:40,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:05:40,280 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:05:40,294 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:05:40,295 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:05:40,296 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:05:40,297 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:05:40,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:05:40,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:05:40,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:05:40,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:05:40,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:05:40,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:05:40,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:05:40,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:05:40,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:05:40,309 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:05:40,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:05:40,312 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:05:40,313 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:05:40,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:05:40,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:05:40,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:05:40,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:05:40,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:05:40,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:05:40,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:05:40,320 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:05:40,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:05:40,320 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:05:40,321 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:05:40,321 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:05:40,331 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:05:40,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:05:40,332 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:05:40,332 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:05:40,332 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:05:40,333 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:05:40,333 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:05:40,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:05:40,334 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:05:40,334 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:05:40,334 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:05:40,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:05:40,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:05:40,334 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:05:40,335 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:05:40,335 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:05:40,335 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:05:40,335 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:05:40,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:05:40,336 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:05:40,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:05:40,336 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:05:40,336 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:05:40,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:05:40,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:05:40,337 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:05:40,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:05:40,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:05:40,337 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:05:40,337 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:05:40,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:05:40,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:05:40,339 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:05:40,339 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:05:40,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:05:40,385 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:05:40,389 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:05:40,391 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:05:40,391 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:05:40,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-01-29 23:05:40,554 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:05:40,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:05:40,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:05:40,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:05:40,565 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:05:40,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be68e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40, skipping insertion in model container [2018-01-29 23:05:40,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,586 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:05:40,629 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:05:40,745 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:05:40,765 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:05:40,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40 WrapperNode [2018-01-29 23:05:40,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:05:40,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:05:40,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:05:40,776 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:05:40,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... [2018-01-29 23:05:40,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:05:40,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:05:40,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:05:40,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:05:40,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:05:40,856 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:05:40,857 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:05:40,857 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-29 23:05:40,857 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-29 23:05:40,857 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:05:40,857 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:05:40,857 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:05:40,857 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:05:40,857 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:05:40,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:05:40,857 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:05:40,857 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:05:40,858 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:05:41,254 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:05:41,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:05:41 BoogieIcfgContainer [2018-01-29 23:05:41,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:05:41,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:05:41,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:05:41,259 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:05:41,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:05:40" (1/3) ... [2018-01-29 23:05:41,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1329bddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:05:41, skipping insertion in model container [2018-01-29 23:05:41,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:05:40" (2/3) ... [2018-01-29 23:05:41,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1329bddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:05:41, skipping insertion in model container [2018-01-29 23:05:41,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:05:41" (3/3) ... [2018-01-29 23:05:41,262 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-01-29 23:05:41,269 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:05:41,277 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-29 23:05:41,316 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:05:41,317 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:05:41,317 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:05:41,317 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:05:41,317 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:05:41,317 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:05:41,317 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:05:41,317 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:05:41,318 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:05:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-29 23:05:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:05:41,343 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:41,344 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:41,344 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-01-29 23:05:41,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1543413146, now seen corresponding path program 1 times [2018-01-29 23:05:41,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:41,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:41,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:41,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:41,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:41,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:41,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:41,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:05:41,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:05:41,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:05:41,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:05:41,534 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-29 23:05:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:41,653 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2018-01-29 23:05:41,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:05:41,655 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-29 23:05:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:41,670 INFO L225 Difference]: With dead ends: 149 [2018-01-29 23:05:41,670 INFO L226 Difference]: Without dead ends: 124 [2018-01-29 23:05:41,674 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:05:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-29 23:05:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-29 23:05:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-29 23:05:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-01-29 23:05:41,717 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 19 [2018-01-29 23:05:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:41,718 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-01-29 23:05:41,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:05:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-01-29 23:05:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:05:41,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:41,719 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:41,719 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-01-29 23:05:41,719 INFO L82 PathProgramCache]: Analyzing trace with hash 883750857, now seen corresponding path program 1 times [2018-01-29 23:05:41,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:41,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:41,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:41,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:41,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:41,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:41,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:41,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:05:41,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:05:41,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:05:41,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:05:41,799 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 3 states. [2018-01-29 23:05:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:41,828 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2018-01-29 23:05:41,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:05:41,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-29 23:05:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:41,830 INFO L225 Difference]: With dead ends: 146 [2018-01-29 23:05:41,831 INFO L226 Difference]: Without dead ends: 125 [2018-01-29 23:05:41,831 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:05:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-29 23:05:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-29 23:05:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-29 23:05:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2018-01-29 23:05:41,840 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 24 [2018-01-29 23:05:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:41,840 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2018-01-29 23:05:41,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:05:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-01-29 23:05:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:05:41,841 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:41,841 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:41,841 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-01-29 23:05:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash -783947252, now seen corresponding path program 1 times [2018-01-29 23:05:41,842 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:41,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:41,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:41,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:41,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:41,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:41,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:41,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:05:41,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:05:41,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:05:41,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:05:41,940 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 3 states. [2018-01-29 23:05:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:41,977 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-01-29 23:05:41,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:05:41,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-29 23:05:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:41,980 INFO L225 Difference]: With dead ends: 236 [2018-01-29 23:05:41,980 INFO L226 Difference]: Without dead ends: 217 [2018-01-29 23:05:41,981 INFO L553 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-01-29 23:05:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-29 23:05:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 198. [2018-01-29 23:05:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-29 23:05:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-01-29 23:05:41,997 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 26 [2018-01-29 23:05:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:41,997 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-01-29 23:05:41,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:05:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-01-29 23:05:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:05:41,998 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:41,999 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:41,999 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-01-29 23:05:41,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1866928143, now seen corresponding path program 1 times [2018-01-29 23:05:41,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:41,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:42,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:42,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:42,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:42,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:42,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:05:42,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:05:42,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:05:42,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:05:42,064 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 4 states. [2018-01-29 23:05:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:42,237 INFO L93 Difference]: Finished difference Result 371 states and 462 transitions. [2018-01-29 23:05:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:05:42,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-29 23:05:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:42,241 INFO L225 Difference]: With dead ends: 371 [2018-01-29 23:05:42,241 INFO L226 Difference]: Without dead ends: 367 [2018-01-29 23:05:42,242 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:05:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-01-29 23:05:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 332. [2018-01-29 23:05:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-29 23:05:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 424 transitions. [2018-01-29 23:05:42,266 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 424 transitions. Word has length 32 [2018-01-29 23:05:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:42,267 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 424 transitions. [2018-01-29 23:05:42,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:05:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 424 transitions. [2018-01-29 23:05:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:05:42,268 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:42,268 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:42,268 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-01-29 23:05:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1866928144, now seen corresponding path program 1 times [2018-01-29 23:05:42,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:42,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:42,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:42,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:42,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:42,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:42,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:05:42,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:05:42,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:05:42,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:05:42,360 INFO L87 Difference]: Start difference. First operand 332 states and 424 transitions. Second operand 4 states. [2018-01-29 23:05:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:42,672 INFO L93 Difference]: Finished difference Result 504 states and 640 transitions. [2018-01-29 23:05:42,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:05:42,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-29 23:05:42,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:42,676 INFO L225 Difference]: With dead ends: 504 [2018-01-29 23:05:42,676 INFO L226 Difference]: Without dead ends: 500 [2018-01-29 23:05:42,676 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:05:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-01-29 23:05:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 470. [2018-01-29 23:05:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-01-29 23:05:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 607 transitions. [2018-01-29 23:05:42,706 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 607 transitions. Word has length 32 [2018-01-29 23:05:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:42,706 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 607 transitions. [2018-01-29 23:05:42,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:05:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 607 transitions. [2018-01-29 23:05:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:05:42,708 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:42,708 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:42,708 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-01-29 23:05:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1867205263, now seen corresponding path program 1 times [2018-01-29 23:05:42,709 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:42,709 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:42,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,710 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:42,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:42,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:42,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:42,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:05:42,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:05:42,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:05:42,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:05:42,801 INFO L87 Difference]: Start difference. First operand 470 states and 607 transitions. Second operand 6 states. [2018-01-29 23:05:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:42,920 INFO L93 Difference]: Finished difference Result 1328 states and 1737 transitions. [2018-01-29 23:05:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:05:42,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-29 23:05:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:42,926 INFO L225 Difference]: With dead ends: 1328 [2018-01-29 23:05:42,926 INFO L226 Difference]: Without dead ends: 873 [2018-01-29 23:05:42,930 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:05:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-01-29 23:05:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 836. [2018-01-29 23:05:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-01-29 23:05:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1076 transitions. [2018-01-29 23:05:42,977 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1076 transitions. Word has length 32 [2018-01-29 23:05:42,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:42,978 INFO L432 AbstractCegarLoop]: Abstraction has 836 states and 1076 transitions. [2018-01-29 23:05:42,978 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:05:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1076 transitions. [2018-01-29 23:05:42,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:05:42,980 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:42,980 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:42,980 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-01-29 23:05:42,980 INFO L82 PathProgramCache]: Analyzing trace with hash -756017955, now seen corresponding path program 1 times [2018-01-29 23:05:42,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:42,981 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:42,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:42,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:42,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:43,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:43,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:05:43,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:05:43,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:05:43,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:05:43,025 INFO L87 Difference]: Start difference. First operand 836 states and 1076 transitions. Second operand 3 states. [2018-01-29 23:05:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:43,107 INFO L93 Difference]: Finished difference Result 860 states and 1100 transitions. [2018-01-29 23:05:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:05:43,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-29 23:05:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:43,116 INFO L225 Difference]: With dead ends: 860 [2018-01-29 23:05:43,116 INFO L226 Difference]: Without dead ends: 848 [2018-01-29 23:05:43,117 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:05:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-01-29 23:05:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 836. [2018-01-29 23:05:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-01-29 23:05:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1072 transitions. [2018-01-29 23:05:43,148 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1072 transitions. Word has length 32 [2018-01-29 23:05:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:43,149 INFO L432 AbstractCegarLoop]: Abstraction has 836 states and 1072 transitions. [2018-01-29 23:05:43,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:05:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1072 transitions. [2018-01-29 23:05:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:05:43,150 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:43,150 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:43,150 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-01-29 23:05:43,151 INFO L82 PathProgramCache]: Analyzing trace with hash 13497930, now seen corresponding path program 1 times [2018-01-29 23:05:43,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:43,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:43,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:43,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:43,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:43,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:43,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:43,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:05:43,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:05:43,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:05:43,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:05:43,282 INFO L87 Difference]: Start difference. First operand 836 states and 1072 transitions. Second operand 6 states. [2018-01-29 23:05:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:43,443 INFO L93 Difference]: Finished difference Result 2352 states and 3018 transitions. [2018-01-29 23:05:43,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:05:43,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-29 23:05:43,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:43,451 INFO L225 Difference]: With dead ends: 2352 [2018-01-29 23:05:43,451 INFO L226 Difference]: Without dead ends: 1531 [2018-01-29 23:05:43,454 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:05:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-01-29 23:05:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1486. [2018-01-29 23:05:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-01-29 23:05:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1854 transitions. [2018-01-29 23:05:43,524 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1854 transitions. Word has length 34 [2018-01-29 23:05:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:43,525 INFO L432 AbstractCegarLoop]: Abstraction has 1486 states and 1854 transitions. [2018-01-29 23:05:43,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:05:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1854 transitions. [2018-01-29 23:05:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 23:05:43,527 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:43,527 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2018-01-29 23:05:43,527 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-01-29 23:05:43,527 INFO L82 PathProgramCache]: Analyzing trace with hash 256921732, now seen corresponding path program 1 times [2018-01-29 23:05:43,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:43,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:43,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:43,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:43,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:43,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:43,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:43,646 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:05:43,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:43,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:43,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:05:43,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-29 23:05:43,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:05:43,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:05:43,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:05:43,835 INFO L87 Difference]: Start difference. First operand 1486 states and 1854 transitions. Second operand 8 states. [2018-01-29 23:05:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:44,210 INFO L93 Difference]: Finished difference Result 3748 states and 4702 transitions. [2018-01-29 23:05:44,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:05:44,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-01-29 23:05:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:44,224 INFO L225 Difference]: With dead ends: 3748 [2018-01-29 23:05:44,224 INFO L226 Difference]: Without dead ends: 2277 [2018-01-29 23:05:44,228 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:05:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2018-01-29 23:05:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2160. [2018-01-29 23:05:44,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2018-01-29 23:05:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 2684 transitions. [2018-01-29 23:05:44,332 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 2684 transitions. Word has length 51 [2018-01-29 23:05:44,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:44,332 INFO L432 AbstractCegarLoop]: Abstraction has 2160 states and 2684 transitions. [2018-01-29 23:05:44,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:05:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2684 transitions. [2018-01-29 23:05:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 23:05:44,334 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:44,334 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:44,334 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-01-29 23:05:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash 530643588, now seen corresponding path program 1 times [2018-01-29 23:05:44,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:44,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:44,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:44,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:44,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:44,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:44,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:05:44,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:05:44,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:05:44,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:05:44,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:05:44,439 INFO L87 Difference]: Start difference. First operand 2160 states and 2684 transitions. Second operand 6 states. [2018-01-29 23:05:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:45,154 INFO L93 Difference]: Finished difference Result 5031 states and 6310 transitions. [2018-01-29 23:05:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:05:45,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-01-29 23:05:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:45,171 INFO L225 Difference]: With dead ends: 5031 [2018-01-29 23:05:45,171 INFO L226 Difference]: Without dead ends: 2886 [2018-01-29 23:05:45,177 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:05:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2018-01-29 23:05:45,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2772. [2018-01-29 23:05:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-01-29 23:05:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3419 transitions. [2018-01-29 23:05:45,319 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3419 transitions. Word has length 52 [2018-01-29 23:05:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:45,319 INFO L432 AbstractCegarLoop]: Abstraction has 2772 states and 3419 transitions. [2018-01-29 23:05:45,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:05:45,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3419 transitions. [2018-01-29 23:05:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:05:45,321 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:45,321 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:45,321 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-01-29 23:05:45,322 INFO L82 PathProgramCache]: Analyzing trace with hash 311400492, now seen corresponding path program 1 times [2018-01-29 23:05:45,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:45,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:45,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:45,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:45,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:45,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:45,730 WARN L146 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-29 23:05:46,006 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 19 DAG size of output 14 [2018-01-29 23:05:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:46,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:46,108 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:05:46,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:46,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:46,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:05:46,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2018-01-29 23:05:46,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:05:46,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:05:46,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:05:46,393 INFO L87 Difference]: Start difference. First operand 2772 states and 3419 transitions. Second operand 14 states. [2018-01-29 23:05:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:48,660 INFO L93 Difference]: Finished difference Result 4514 states and 5507 transitions. [2018-01-29 23:05:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:05:48,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-01-29 23:05:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:48,668 INFO L225 Difference]: With dead ends: 4514 [2018-01-29 23:05:48,668 INFO L226 Difference]: Without dead ends: 1613 [2018-01-29 23:05:48,675 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:05:48,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2018-01-29 23:05:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1491. [2018-01-29 23:05:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2018-01-29 23:05:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1813 transitions. [2018-01-29 23:05:48,750 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1813 transitions. Word has length 60 [2018-01-29 23:05:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:48,750 INFO L432 AbstractCegarLoop]: Abstraction has 1491 states and 1813 transitions. [2018-01-29 23:05:48,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:05:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1813 transitions. [2018-01-29 23:05:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:05:48,751 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:48,752 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-01-29 23:05:48,752 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-01-29 23:05:48,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1184136510, now seen corresponding path program 1 times [2018-01-29 23:05:48,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:48,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:48,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:48,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:48,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:48,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:48,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:48,996 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:05:49,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:49,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:49,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:05:49,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-01-29 23:05:49,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:05:49,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:05:49,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:05:49,275 INFO L87 Difference]: Start difference. First operand 1491 states and 1813 transitions. Second operand 16 states. [2018-01-29 23:05:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:51,350 INFO L93 Difference]: Finished difference Result 4855 states and 6008 transitions. [2018-01-29 23:05:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-29 23:05:51,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-01-29 23:05:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:51,368 INFO L225 Difference]: With dead ends: 4855 [2018-01-29 23:05:51,368 INFO L226 Difference]: Without dead ends: 3379 [2018-01-29 23:05:51,374 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=385, Invalid=1595, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:05:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2018-01-29 23:05:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2585. [2018-01-29 23:05:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2018-01-29 23:05:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3134 transitions. [2018-01-29 23:05:51,507 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3134 transitions. Word has length 60 [2018-01-29 23:05:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:51,508 INFO L432 AbstractCegarLoop]: Abstraction has 2585 states and 3134 transitions. [2018-01-29 23:05:51,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:05:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3134 transitions. [2018-01-29 23:05:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-29 23:05:51,509 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:51,510 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-01-29 23:05:51,510 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-01-29 23:05:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1545139132, now seen corresponding path program 1 times [2018-01-29 23:05:51,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:51,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:51,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:51,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:51,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:51,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:51,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:51,643 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:05:51,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:51,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-29 23:05:51,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:05:51,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-01-29 23:05:51,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:05:51,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:05:51,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:05:51,888 INFO L87 Difference]: Start difference. First operand 2585 states and 3134 transitions. Second operand 11 states. [2018-01-29 23:05:52,445 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 23 DAG size of output 21 [2018-01-29 23:05:52,783 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 25 DAG size of output 23 [2018-01-29 23:05:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:54,464 INFO L93 Difference]: Finished difference Result 9514 states and 11679 transitions. [2018-01-29 23:05:54,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-29 23:05:54,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-01-29 23:05:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:54,500 INFO L225 Difference]: With dead ends: 9514 [2018-01-29 23:05:54,500 INFO L226 Difference]: Without dead ends: 6944 [2018-01-29 23:05:54,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=475, Invalid=2075, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 23:05:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6944 states. [2018-01-29 23:05:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6944 to 6147. [2018-01-29 23:05:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2018-01-29 23:05:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7443 transitions. [2018-01-29 23:05:54,824 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7443 transitions. Word has length 70 [2018-01-29 23:05:54,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:54,824 INFO L432 AbstractCegarLoop]: Abstraction has 6147 states and 7443 transitions. [2018-01-29 23:05:54,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:05:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7443 transitions. [2018-01-29 23:05:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-29 23:05:54,828 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:54,828 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:54,828 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-01-29 23:05:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -124703866, now seen corresponding path program 1 times [2018-01-29 23:05:54,828 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:54,828 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:54,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:54,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:54,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:54,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:54,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:54,986 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:05:54,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:55,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:55,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:05:55,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-01-29 23:05:55,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:05:55,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:05:55,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:05:55,105 INFO L87 Difference]: Start difference. First operand 6147 states and 7443 transitions. Second operand 13 states. [2018-01-29 23:05:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:55,591 INFO L93 Difference]: Finished difference Result 11680 states and 14114 transitions. [2018-01-29 23:05:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:05:55,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-01-29 23:05:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:55,636 INFO L225 Difference]: With dead ends: 11680 [2018-01-29 23:05:55,636 INFO L226 Difference]: Without dead ends: 6271 [2018-01-29 23:05:55,647 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:05:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2018-01-29 23:05:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 6069. [2018-01-29 23:05:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6069 states. [2018-01-29 23:05:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 7339 transitions. [2018-01-29 23:05:55,807 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 7339 transitions. Word has length 81 [2018-01-29 23:05:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:55,808 INFO L432 AbstractCegarLoop]: Abstraction has 6069 states and 7339 transitions. [2018-01-29 23:05:55,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:05:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 7339 transitions. [2018-01-29 23:05:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-29 23:05:55,809 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:55,810 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:55,810 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-01-29 23:05:55,810 INFO L82 PathProgramCache]: Analyzing trace with hash 4400356, now seen corresponding path program 1 times [2018-01-29 23:05:55,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:55,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:55,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:55,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:55,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:55,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:55,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:55,963 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:05:55,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:56,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:05:56,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:05:56,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-01-29 23:05:56,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:05:56,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:05:56,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:05:56,087 INFO L87 Difference]: Start difference. First operand 6069 states and 7339 transitions. Second operand 13 states. [2018-01-29 23:05:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:56,929 INFO L93 Difference]: Finished difference Result 13498 states and 16978 transitions. [2018-01-29 23:05:56,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:05:56,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-01-29 23:05:56,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:56,965 INFO L225 Difference]: With dead ends: 13498 [2018-01-29 23:05:56,965 INFO L226 Difference]: Without dead ends: 8245 [2018-01-29 23:05:56,981 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:05:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2018-01-29 23:05:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 5205. [2018-01-29 23:05:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5205 states. [2018-01-29 23:05:57,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 6265 transitions. [2018-01-29 23:05:57,241 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 6265 transitions. Word has length 82 [2018-01-29 23:05:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:57,242 INFO L432 AbstractCegarLoop]: Abstraction has 5205 states and 6265 transitions. [2018-01-29 23:05:57,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:05:57,242 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 6265 transitions. [2018-01-29 23:05:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-29 23:05:57,245 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:57,245 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 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, 1] [2018-01-29 23:05:57,246 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-01-29 23:05:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2112447677, now seen corresponding path program 1 times [2018-01-29 23:05:57,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:57,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:57,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:57,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:57,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:57,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:05:57,417 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:57,417 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:05:57,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:57,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-29 23:05:57,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:05:57,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-29 23:05:57,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:05:57,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:05:57,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:05:57,534 INFO L87 Difference]: Start difference. First operand 5205 states and 6265 transitions. Second operand 11 states. [2018-01-29 23:05:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:05:58,310 INFO L93 Difference]: Finished difference Result 13339 states and 16723 transitions. [2018-01-29 23:05:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:05:58,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-01-29 23:05:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:05:58,347 INFO L225 Difference]: With dead ends: 13339 [2018-01-29 23:05:58,347 INFO L226 Difference]: Without dead ends: 8029 [2018-01-29 23:05:58,362 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:05:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8029 states. [2018-01-29 23:05:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8029 to 6125. [2018-01-29 23:05:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6125 states. [2018-01-29 23:05:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6125 states to 6125 states and 7315 transitions. [2018-01-29 23:05:58,698 INFO L78 Accepts]: Start accepts. Automaton has 6125 states and 7315 transitions. Word has length 100 [2018-01-29 23:05:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:05:58,699 INFO L432 AbstractCegarLoop]: Abstraction has 6125 states and 7315 transitions. [2018-01-29 23:05:58,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:05:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6125 states and 7315 transitions. [2018-01-29 23:05:58,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-29 23:05:58,703 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:05:58,703 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:05:58,703 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-01-29 23:05:58,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1901413795, now seen corresponding path program 1 times [2018-01-29 23:05:58,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:05:58,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:05:58,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:58,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:58,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:05:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:58,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:05:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:05:58,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:05:58,914 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:05:58,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:05:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:05:58,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:05:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:05:59,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:05:59,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:05:59,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:05:59,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:05:59,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:05:59,136 INFO L87 Difference]: Start difference. First operand 6125 states and 7315 transitions. Second operand 14 states. [2018-01-29 23:06:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:00,420 INFO L93 Difference]: Finished difference Result 12663 states and 15215 transitions. [2018-01-29 23:06:00,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:06:00,420 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 100 [2018-01-29 23:06:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:00,454 INFO L225 Difference]: With dead ends: 12663 [2018-01-29 23:06:00,454 INFO L226 Difference]: Without dead ends: 7438 [2018-01-29 23:06:00,467 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:06:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7438 states. [2018-01-29 23:06:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7438 to 7229. [2018-01-29 23:06:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7229 states. [2018-01-29 23:06:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7229 states to 7229 states and 8723 transitions. [2018-01-29 23:06:00,817 INFO L78 Accepts]: Start accepts. Automaton has 7229 states and 8723 transitions. Word has length 100 [2018-01-29 23:06:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:00,818 INFO L432 AbstractCegarLoop]: Abstraction has 7229 states and 8723 transitions. [2018-01-29 23:06:00,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:06:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7229 states and 8723 transitions. [2018-01-29 23:06:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-29 23:06:00,822 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:00,822 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:00,823 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-01-29 23:06:00,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1650986556, now seen corresponding path program 1 times [2018-01-29 23:06:00,823 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:00,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:00,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:00,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:00,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:00,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 42 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:06:01,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:01,029 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:06:01,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:01,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:01,165 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:06:01,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:01,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-01-29 23:06:01,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:06:01,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:06:01,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:06:01,188 INFO L87 Difference]: Start difference. First operand 7229 states and 8723 transitions. Second operand 13 states. [2018-01-29 23:06:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:01,784 INFO L93 Difference]: Finished difference Result 13703 states and 16527 transitions. [2018-01-29 23:06:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:06:01,784 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-01-29 23:06:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:01,804 INFO L225 Difference]: With dead ends: 13703 [2018-01-29 23:06:01,804 INFO L226 Difference]: Without dead ends: 7066 [2018-01-29 23:06:01,819 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:06:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2018-01-29 23:06:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 6985. [2018-01-29 23:06:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6985 states. [2018-01-29 23:06:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 8351 transitions. [2018-01-29 23:06:02,146 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 8351 transitions. Word has length 102 [2018-01-29 23:06:02,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:02,146 INFO L432 AbstractCegarLoop]: Abstraction has 6985 states and 8351 transitions. [2018-01-29 23:06:02,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:06:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 8351 transitions. [2018-01-29 23:06:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-29 23:06:02,150 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:02,150 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-01-29 23:06:02,150 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-01-29 23:06:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1027238307, now seen corresponding path program 2 times [2018-01-29 23:06:02,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:02,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:02,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:02,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:02,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:02,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:06:02,312 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:02,312 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:06:02,324 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:06:02,361 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:06:02,386 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:06:02,389 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:06:02,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-29 23:06:02,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:02,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-01-29 23:06:02,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:06:02,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:06:02,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:06:02,470 INFO L87 Difference]: Start difference. First operand 6985 states and 8351 transitions. Second operand 12 states. [2018-01-29 23:06:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:03,265 INFO L93 Difference]: Finished difference Result 11813 states and 14590 transitions. [2018-01-29 23:06:03,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:06:03,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-01-29 23:06:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:03,277 INFO L225 Difference]: With dead ends: 11813 [2018-01-29 23:06:03,277 INFO L226 Difference]: Without dead ends: 4804 [2018-01-29 23:06:03,288 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:06:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2018-01-29 23:06:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 3508. [2018-01-29 23:06:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3508 states. [2018-01-29 23:06:03,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 4151 transitions. [2018-01-29 23:06:03,449 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 4151 transitions. Word has length 109 [2018-01-29 23:06:03,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:03,450 INFO L432 AbstractCegarLoop]: Abstraction has 3508 states and 4151 transitions. [2018-01-29 23:06:03,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:06:03,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 4151 transitions. [2018-01-29 23:06:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-29 23:06:03,453 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:03,454 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:03,454 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-01-29 23:06:03,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1739520311, now seen corresponding path program 1 times [2018-01-29 23:06:03,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:03,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:03,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:03,455 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:06:03,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:03,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:03,636 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 14 DAG size of output 13 [2018-01-29 23:06:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:06:03,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:03,761 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:06:03,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:03,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:06:04,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:04,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-29 23:06:04,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:06:04,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:06:04,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:06:04,058 INFO L87 Difference]: Start difference. First operand 3508 states and 4151 transitions. Second operand 21 states. [2018-01-29 23:06:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:05,489 INFO L93 Difference]: Finished difference Result 8570 states and 10257 transitions. [2018-01-29 23:06:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:06:05,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-01-29 23:06:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:05,501 INFO L225 Difference]: With dead ends: 8570 [2018-01-29 23:06:05,502 INFO L226 Difference]: Without dead ends: 5158 [2018-01-29 23:06:05,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:06:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2018-01-29 23:06:05,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 4483. [2018-01-29 23:06:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4483 states. [2018-01-29 23:06:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 5267 transitions. [2018-01-29 23:06:05,764 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 5267 transitions. Word has length 109 [2018-01-29 23:06:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:05,764 INFO L432 AbstractCegarLoop]: Abstraction has 4483 states and 5267 transitions. [2018-01-29 23:06:05,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:06:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 5267 transitions. [2018-01-29 23:06:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-29 23:06:05,769 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:05,769 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:05,769 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-01-29 23:06:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1551451171, now seen corresponding path program 1 times [2018-01-29 23:06:05,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:05,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:05,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:05,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:05,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:05,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 114 proven. 27 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:06:06,048 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:06,048 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:06:06,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:06,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 148 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:06:06,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:06,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:06:06,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:06:06,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:06:06,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:06:06,511 INFO L87 Difference]: Start difference. First operand 4483 states and 5267 transitions. Second operand 14 states. [2018-01-29 23:06:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:07,487 INFO L93 Difference]: Finished difference Result 10073 states and 11946 transitions. [2018-01-29 23:06:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:06:07,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2018-01-29 23:06:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:07,501 INFO L225 Difference]: With dead ends: 10073 [2018-01-29 23:06:07,501 INFO L226 Difference]: Without dead ends: 5578 [2018-01-29 23:06:07,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:06:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2018-01-29 23:06:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 5386. [2018-01-29 23:06:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5386 states. [2018-01-29 23:06:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 6350 transitions. [2018-01-29 23:06:07,820 INFO L78 Accepts]: Start accepts. Automaton has 5386 states and 6350 transitions. Word has length 142 [2018-01-29 23:06:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:07,820 INFO L432 AbstractCegarLoop]: Abstraction has 5386 states and 6350 transitions. [2018-01-29 23:06:07,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:06:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5386 states and 6350 transitions. [2018-01-29 23:06:07,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-01-29 23:06:07,824 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:07,824 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:07,824 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-01-29 23:06:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1997766460, now seen corresponding path program 1 times [2018-01-29 23:06:07,824 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:07,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:07,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:07,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:07,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:07,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-01-29 23:06:08,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:08,254 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:06:08,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:08,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-01-29 23:06:08,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:08,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:06:08,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:06:08,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:06:08,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:06:08,523 INFO L87 Difference]: Start difference. First operand 5386 states and 6350 transitions. Second operand 14 states. [2018-01-29 23:06:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:09,146 INFO L93 Difference]: Finished difference Result 12281 states and 14663 transitions. [2018-01-29 23:06:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:06:09,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-01-29 23:06:09,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:09,155 INFO L225 Difference]: With dead ends: 12281 [2018-01-29 23:06:09,156 INFO L226 Difference]: Without dead ends: 6982 [2018-01-29 23:06:09,161 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:06:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6982 states. [2018-01-29 23:06:09,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6982 to 5239. [2018-01-29 23:06:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5239 states. [2018-01-29 23:06:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 6193 transitions. [2018-01-29 23:06:09,370 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 6193 transitions. Word has length 144 [2018-01-29 23:06:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:09,370 INFO L432 AbstractCegarLoop]: Abstraction has 5239 states and 6193 transitions. [2018-01-29 23:06:09,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:06:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 6193 transitions. [2018-01-29 23:06:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-29 23:06:09,374 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:09,374 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:09,374 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-01-29 23:06:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1705580956, now seen corresponding path program 1 times [2018-01-29 23:06:09,375 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:09,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:09,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:09,376 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:09,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:09,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:06:09,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:09,582 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 23:06:09,587 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:09,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 152 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:06:09,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:09,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:06:09,723 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:06:09,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:06:09,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:06:09,724 INFO L87 Difference]: Start difference. First operand 5239 states and 6193 transitions. Second operand 14 states. [2018-01-29 23:06:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:10,327 INFO L93 Difference]: Finished difference Result 11582 states and 13792 transitions. [2018-01-29 23:06:10,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:06:10,327 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2018-01-29 23:06:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:10,336 INFO L225 Difference]: With dead ends: 11582 [2018-01-29 23:06:10,336 INFO L226 Difference]: Without dead ends: 6475 [2018-01-29 23:06:10,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:06:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6475 states. [2018-01-29 23:06:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6475 to 5818. [2018-01-29 23:06:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5818 states. [2018-01-29 23:06:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 6895 transitions. [2018-01-29 23:06:10,613 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 6895 transitions. Word has length 147 [2018-01-29 23:06:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:10,613 INFO L432 AbstractCegarLoop]: Abstraction has 5818 states and 6895 transitions. [2018-01-29 23:06:10,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:06:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 6895 transitions. [2018-01-29 23:06:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-29 23:06:10,617 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:10,617 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:10,617 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-01-29 23:06:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1798126083, now seen corresponding path program 1 times [2018-01-29 23:06:10,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:10,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:10,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:10,618 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:10,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:10,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 106 proven. 42 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:06:10,825 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:10,825 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:06:10,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:10,898 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 158 proven. 6 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:06:10,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:10,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:06:10,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:06:10,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:06:10,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:06:10,995 INFO L87 Difference]: Start difference. First operand 5818 states and 6895 transitions. Second operand 14 states. [2018-01-29 23:06:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:11,536 INFO L93 Difference]: Finished difference Result 12125 states and 14422 transitions. [2018-01-29 23:06:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:06:11,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2018-01-29 23:06:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:11,546 INFO L225 Difference]: With dead ends: 12125 [2018-01-29 23:06:11,546 INFO L226 Difference]: Without dead ends: 6439 [2018-01-29 23:06:11,553 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:06:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6439 states. [2018-01-29 23:06:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6439 to 6397. [2018-01-29 23:06:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6397 states. [2018-01-29 23:06:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6397 states to 6397 states and 7615 transitions. [2018-01-29 23:06:11,813 INFO L78 Accepts]: Start accepts. Automaton has 6397 states and 7615 transitions. Word has length 149 [2018-01-29 23:06:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:11,813 INFO L432 AbstractCegarLoop]: Abstraction has 6397 states and 7615 transitions. [2018-01-29 23:06:11,813 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:06:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6397 states and 7615 transitions. [2018-01-29 23:06:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-29 23:06:11,816 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:11,816 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:11,816 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:11,816 INFO L82 PathProgramCache]: Analyzing trace with hash 636520571, now seen corresponding path program 1 times [2018-01-29 23:06:11,816 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:11,816 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:11,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:11,817 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:11,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:11,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 114 proven. 40 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:06:12,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:12,156 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:06:12,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:12,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 162 proven. 34 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-29 23:06:12,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:12,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-01-29 23:06:12,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:06:12,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:06:12,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:06:12,579 INFO L87 Difference]: Start difference. First operand 6397 states and 7615 transitions. Second operand 22 states. [2018-01-29 23:06:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:14,632 INFO L93 Difference]: Finished difference Result 14903 states and 17785 transitions. [2018-01-29 23:06:14,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:06:14,633 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 154 [2018-01-29 23:06:14,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:14,645 INFO L225 Difference]: With dead ends: 14903 [2018-01-29 23:06:14,645 INFO L226 Difference]: Without dead ends: 8638 [2018-01-29 23:06:14,693 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 23:06:14,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8638 states. [2018-01-29 23:06:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8638 to 6883. [2018-01-29 23:06:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6883 states. [2018-01-29 23:06:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6883 states to 6883 states and 8017 transitions. [2018-01-29 23:06:14,997 INFO L78 Accepts]: Start accepts. Automaton has 6883 states and 8017 transitions. Word has length 154 [2018-01-29 23:06:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:14,997 INFO L432 AbstractCegarLoop]: Abstraction has 6883 states and 8017 transitions. [2018-01-29 23:06:14,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:06:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 8017 transitions. [2018-01-29 23:06:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-29 23:06:15,000 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:15,000 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:15,000 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:15,001 INFO L82 PathProgramCache]: Analyzing trace with hash -727462505, now seen corresponding path program 1 times [2018-01-29 23:06:15,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:15,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:15,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:15,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:15,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:15,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:06:15,331 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-01-29 23:06:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 106 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:06:15,409 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:06:15,409 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:06:15,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:06:15,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:06:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 164 proven. 28 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-01-29 23:06:15,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:06:15,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-29 23:06:15,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:06:15,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:06:15,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:06:15,791 INFO L87 Difference]: Start difference. First operand 6883 states and 8017 transitions. Second operand 21 states. [2018-01-29 23:06:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:06:17,142 INFO L93 Difference]: Finished difference Result 14375 states and 16738 transitions. [2018-01-29 23:06:17,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:06:17,143 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 158 [2018-01-29 23:06:17,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:06:17,152 INFO L225 Difference]: With dead ends: 14375 [2018-01-29 23:06:17,152 INFO L226 Difference]: Without dead ends: 7471 [2018-01-29 23:06:17,158 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=463, Invalid=1889, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:06:17,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2018-01-29 23:06:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7381. [2018-01-29 23:06:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7381 states. [2018-01-29 23:06:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7381 states to 7381 states and 8516 transitions. [2018-01-29 23:06:17,447 INFO L78 Accepts]: Start accepts. Automaton has 7381 states and 8516 transitions. Word has length 158 [2018-01-29 23:06:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:06:17,447 INFO L432 AbstractCegarLoop]: Abstraction has 7381 states and 8516 transitions. [2018-01-29 23:06:17,447 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:06:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7381 states and 8516 transitions. [2018-01-29 23:06:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-01-29 23:06:17,449 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:06:17,449 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:06:17,449 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:06:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1053299623, now seen corresponding path program 1 times [2018-01-29 23:06:17,449 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:06:17,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:06:17,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:17,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:06:17,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:06:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-29 23:06:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-29 23:06:17,568 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-29 23:06:17,681 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-29 23:06:17,702 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-01-29 23:06:17,703 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-01-29 23:06:17,704 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-01-29 23:06:17,705 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-01-29 23:06:17,706 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-01-29 23:06:17,710 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-01-29 23:06:17,711 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-01-29 23:06:17,712 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-01-29 23:06:17,716 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-01-29 23:06:17,716 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-01-29 23:06:17,717 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-01-29 23:06:17,718 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-01-29 23:06:17,721 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-01-29 23:06:17,721 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-01-29 23:06:17,722 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-01-29 23:06:17,722 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-01-29 23:06:17,723 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-01-29 23:06:17,726 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-01-29 23:06:17,726 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-01-29 23:06:17,726 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-01-29 23:06:17,727 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-01-29 23:06:17,727 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-01-29 23:06:17,728 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-01-29 23:06:17,728 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-01-29 23:06:17,730 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-01-29 23:06:17,731 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-01-29 23:06:17,731 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-01-29 23:06:17,732 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-01-29 23:06:17,732 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-01-29 23:06:17,733 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-01-29 23:06:17,733 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-01-29 23:06:17,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:06:17 BoogieIcfgContainer [2018-01-29 23:06:17,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:06:17,756 INFO L168 Benchmark]: Toolchain (without parser) took 37202.26 ms. Allocated memory was 296.2 MB in the beginning and 1.1 GB in the end (delta: 784.9 MB). Free memory was 256.3 MB in the beginning and 707.4 MB in the end (delta: -451.1 MB). Peak memory consumption was 333.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:17,758 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 296.2 MB. Free memory is still 262.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:06:17,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.02 ms. Allocated memory is still 296.2 MB. Free memory was 255.3 MB in the beginning and 244.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:17,759 INFO L168 Benchmark]: Boogie Preprocessor took 34.64 ms. Allocated memory is still 296.2 MB. Free memory was 244.0 MB in the beginning and 242.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:17,759 INFO L168 Benchmark]: RCFGBuilder took 444.75 ms. Allocated memory is still 296.2 MB. Free memory was 242.0 MB in the beginning and 211.4 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:17,759 INFO L168 Benchmark]: TraceAbstraction took 36499.27 ms. Allocated memory was 296.2 MB in the beginning and 1.1 GB in the end (delta: 784.9 MB). Free memory was 211.4 MB in the beginning and 707.4 MB in the end (delta: -496.0 MB). Peak memory consumption was 288.9 MB. Max. memory is 5.3 GB. [2018-01-29 23:06:17,761 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 296.2 MB. Free memory is still 262.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.02 ms. Allocated memory is still 296.2 MB. Free memory was 255.3 MB in the beginning and 244.0 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.64 ms. Allocated memory is still 296.2 MB. Free memory was 244.0 MB in the beginning and 242.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 444.75 ms. Allocated memory is still 296.2 MB. Free memory was 242.0 MB in the beginning and 211.4 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 36499.27 ms. Allocated memory was 296.2 MB in the beginning and 1.1 GB in the end (delta: 784.9 MB). Free memory was 211.4 MB in the beginning and 707.4 MB in the end (delta: -496.0 MB). Peak memory consumption was 288.9 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~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~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 * 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: IVAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=21, \old(S)=11, \old(t1)=20, \old(t1)=24, \old(t4)=31, \old(t4)=13, \old(x1)=28, \old(x1)=9, \old(x4)=18, \old(x4)=25, garbage={30:32}, pc1=19, pc4=23, res4=16, S={21:11}, t1={24:20}, t4={31:13}, x1={9:28}, x4={18:25}] [L625] int pc1 = 1; VAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=21, \old(S)=11, \old(t1)=20, \old(t1)=24, \old(t4)=31, \old(t4)=13, \old(x1)=28, \old(x1)=9, \old(x4)=25, \old(x4)=18, garbage={30:32}, pc1=1, pc4=23, res4=16, S={21:11}, t1={24:20}, t4={31:13}, x1={9:28}, x4={18:25}] [L626] int pc4 = 1; VAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=11, \old(S)=21, \old(t1)=20, \old(t1)=24, \old(t4)=13, \old(t4)=31, \old(x1)=9, \old(x1)=28, \old(x4)=25, \old(x4)=18, garbage={30:32}, pc1=1, pc4=1, res4=16, S={21:11}, t1={24:20}, t4={31:13}, x1={9:28}, x4={18:25}] [L624] struct cell *S; VAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=11, \old(S)=21, \old(t1)=20, \old(t1)=24, \old(t4)=31, \old(t4)=13, \old(x1)=28, \old(x1)=9, \old(x4)=18, \old(x4)=25, garbage={30:32}, pc1=1, pc4=1, res4=16, S={0:0}, t1={24:20}, t4={31:13}, x1={9:28}, x4={18:25}] [L627] static struct cell *t1 = ((void *)0); VAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=21, \old(S)=11, \old(t1)=24, \old(t1)=20, \old(t4)=31, \old(t4)=13, \old(x1)=28, \old(x1)=9, \old(x4)=18, \old(x4)=25, garbage={30:32}, pc1=1, pc4=1, res4=16, S={0:0}, t1={0:0}, t4={31:13}, x1={9:28}, x4={18:25}] [L628] static struct cell *x1 = ((void *)0); VAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=21, \old(S)=11, \old(t1)=24, \old(t1)=20, \old(t4)=13, \old(t4)=31, \old(x1)=28, \old(x1)=9, \old(x4)=25, \old(x4)=18, garbage={30:32}, pc1=1, pc4=1, res4=16, S={0:0}, t1={0:0}, t4={31:13}, x1={0:0}, x4={18:25}] [L657] struct cell* garbage; VAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=11, \old(S)=21, \old(t1)=24, \old(t1)=20, \old(t4)=13, \old(t4)=31, \old(x1)=9, \old(x1)=28, \old(x4)=25, \old(x4)=18, garbage={0:0}, pc1=1, pc4=1, res4=16, S={0:0}, t1={0:0}, t4={31:13}, x1={0:0}, x4={18:25}] [L658] static struct cell *t4 = ((void *)0); VAL [\old(garbage)=32, \old(garbage)=30, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=21, \old(S)=11, \old(t1)=20, \old(t1)=24, \old(t4)=31, \old(t4)=13, \old(x1)=9, \old(x1)=28, \old(x4)=25, \old(x4)=18, garbage={0:0}, pc1=1, pc4=1, res4=16, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={18:25}] [L659] static struct cell *x4 = ((void *)0); VAL [\old(garbage)=30, \old(garbage)=32, \old(pc1)=19, \old(pc4)=23, \old(res4)=16, \old(S)=21, \old(S)=11, \old(t1)=24, \old(t1)=20, \old(t4)=31, \old(t4)=13, \old(x1)=28, \old(x1)=9, \old(x4)=25, \old(x4)=18, garbage={0:0}, pc1=1, pc4=1, res4=16, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0: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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L691] COND TRUE __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}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [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++ 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}] [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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}] [L691] COND TRUE __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=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [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++ 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}] [L632] case 1: 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}] [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)=0, \old(x1)=12, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}] [L691] COND TRUE __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=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [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)=0, \old(x1)=12, \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++ 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}] [L632] case 1: 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}] [L637] case 2: 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)=0, \old(x1)=12, \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}] [L640] case 3: 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)=0, \old(x1)=12, \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}] [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)=0, \old(x1)=12, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}] [L691] COND TRUE __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=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [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++ 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}] [L632] case 1: 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}] [L637] case 2: 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=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L640] case 3: 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}] [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)=12, \old(x1)=0, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}] [L691] COND TRUE __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=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [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++ 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}] [L632] case 1: 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={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L637] case 2: 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={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L640] case 3: 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={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L643] case 4: 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}] [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 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}] [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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \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}] [L691] COND TRUE __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=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [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)=0, \old(x1)=12, \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++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \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)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L637] case 2: 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=7, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L643] case 4: 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=7, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L646] case 5: 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)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L652] case 6: 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=7, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \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)=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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \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] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \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=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \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=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [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=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L701] S = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L702] t1 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L703] x1 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L704] t4 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L705] x4 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0: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=1, 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, 127 locations, 19 error locations. UNSAFE Result, 36.4s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 22.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4125 SDtfs, 11083 SDslu, 12219 SDs, 0 SdLazy, 11722 SolverSat, 1635 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2438 GetRequests, 1872 SyntacticMatches, 21 SemanticMatches, 545 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4622 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7381occurred in iteration=26, 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: 4.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 14008 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 4089 NumberOfCodeBlocks, 4089 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3876 ConstructedInterpolants, 0 QuantifiedInterpolants, 960343 SizeOfPredicates, 92 NumberOfNonLiveVariables, 7817 ConjunctsInSsa, 187 ConjunctsInUnsatCore, 43 InterpolantComputations, 11 PerfectInterpolantSequences, 3141/3640 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 /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-06-17-771.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-06-17-771.csv Received shutdown request...