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-5f7ec6e [2018-01-31 09:10:55,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:10:55,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:10:55,840 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:10:55,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:10:55,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:10:55,842 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:10:55,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:10:55,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:10:55,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:10:55,850 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:10:55,851 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:10:55,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:10:55,853 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:10:55,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:10:55,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:10:55,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:10:55,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:10:55,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:10:55,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:10:55,878 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:10:55,878 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:10:55,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:10:55,879 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:10:55,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:10:55,882 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:10:55,882 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:10:55,883 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:10:55,883 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:10:55,883 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:10:55,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:10:55,884 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-31 09:10:55,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:10:55,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:10:55,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:10:55,901 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:10:55,901 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:10:55,901 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:10:55,901 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:10:55,902 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:10:55,907 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:10:55,907 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:10:55,907 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:10:55,908 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:10:55,908 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:10:55,908 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:10:55,908 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:10:55,908 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:10:55,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:10:55,909 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:10:55,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:10:55,909 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:10:55,909 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:10:55,909 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:10:55,910 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:10:55,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:10:55,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:10:55,911 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:10:55,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:10:55,911 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:10:55,912 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:10:55,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:10:55,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:10:55,912 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:10:55,913 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:10:55,913 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:10:55,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:10:55,979 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:10:55,983 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:10:55,984 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:10:55,984 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:10:55,985 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-31 09:10:56,193 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:10:56,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:10:56,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:10:56,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:10:56,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:10:56,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4875cb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56, skipping insertion in model container [2018-01-31 09:10:56,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,234 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:10:56,295 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:10:56,443 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:10:56,468 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:10:56,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56 WrapperNode [2018-01-31 09:10:56,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:10:56,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:10:56,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:10:56,479 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:10:56,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (1/1) ... [2018-01-31 09:10:56,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:10:56,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:10:56,576 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:10:56,576 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:10:56,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (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-31 09:10:56,658 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:10:56,658 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:10:56,658 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-31 09:10:56,659 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-31 09:10:56,659 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:10:56,659 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:10:56,659 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:10:56,659 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:10:56,660 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:10:56,660 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:10:56,660 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:10:56,660 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:10:56,660 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:10:56,660 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:10:56,660 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:10:56,661 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-31 09:10:56,661 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-31 09:10:56,661 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:10:56,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:10:56,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:10:57,670 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:10:57,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:10:57 BoogieIcfgContainer [2018-01-31 09:10:57,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:10:57,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:10:57,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:10:57,679 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:10:57,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:10:56" (1/3) ... [2018-01-31 09:10:57,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7a6e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:10:57, skipping insertion in model container [2018-01-31 09:10:57,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:10:56" (2/3) ... [2018-01-31 09:10:57,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7a6e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:10:57, skipping insertion in model container [2018-01-31 09:10:57,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:10:57" (3/3) ... [2018-01-31 09:10:57,683 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-01-31 09:10:57,690 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:10:57,699 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-31 09:10:57,742 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:10:57,742 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:10:57,742 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:10:57,742 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:10:57,742 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:10:57,742 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:10:57,743 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:10:57,743 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:10:57,743 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:10:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2018-01-31 09:10:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 09:10:57,775 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:10:57,776 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:10:57,776 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-31 09:10:57,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1543413146, now seen corresponding path program 1 times [2018-01-31 09:10:57,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:10:57,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:10:57,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:57,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:10:57,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:10:57,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:10:58,010 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-31 09:10:58,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:10:58,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:10:58,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 09:10:58,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 09:10:58,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:10:58,037 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 2 states. [2018-01-31 09:10:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:10:58,170 INFO L93 Difference]: Finished difference Result 149 states and 169 transitions. [2018-01-31 09:10:58,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 09:10:58,171 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-31 09:10:58,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:10:58,192 INFO L225 Difference]: With dead ends: 149 [2018-01-31 09:10:58,192 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 09:10:58,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 09:10:58,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 09:10:58,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-01-31 09:10:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 09:10:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2018-01-31 09:10:58,247 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 141 transitions. Word has length 19 [2018-01-31 09:10:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:10:58,247 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 141 transitions. [2018-01-31 09:10:58,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 09:10:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2018-01-31 09:10:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 09:10:58,249 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:10:58,249 INFO L351 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-31 09:10:58,249 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-31 09:10:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash 883750857, now seen corresponding path program 1 times [2018-01-31 09:10:58,250 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:10:58,250 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:10:58,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:58,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:10:58,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:10:58,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:10:58,369 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-31 09:10:58,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:10:58,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:10:58,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:10:58,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:10:58,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:10:58,373 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. Second operand 3 states. [2018-01-31 09:10:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:10:58,422 INFO L93 Difference]: Finished difference Result 146 states and 164 transitions. [2018-01-31 09:10:58,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:10:58,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-31 09:10:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:10:58,425 INFO L225 Difference]: With dead ends: 146 [2018-01-31 09:10:58,425 INFO L226 Difference]: Without dead ends: 125 [2018-01-31 09:10:58,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:10:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-31 09:10:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-01-31 09:10:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-31 09:10:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2018-01-31 09:10:58,440 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 24 [2018-01-31 09:10:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:10:58,441 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2018-01-31 09:10:58,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:10:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2018-01-31 09:10:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 09:10:58,442 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:10:58,442 INFO L351 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-31 09:10:58,442 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-31 09:10:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash -783947252, now seen corresponding path program 1 times [2018-01-31 09:10:58,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:10:58,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:10:58,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:58,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:10:58,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:10:58,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:10:58,604 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-31 09:10:58,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:10:58,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:10:58,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:10:58,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:10:58,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:10:58,606 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 3 states. [2018-01-31 09:10:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:10:58,706 INFO L93 Difference]: Finished difference Result 236 states and 272 transitions. [2018-01-31 09:10:58,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:10:58,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-31 09:10:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:10:58,710 INFO L225 Difference]: With dead ends: 236 [2018-01-31 09:10:58,710 INFO L226 Difference]: Without dead ends: 217 [2018-01-31 09:10:58,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:10:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-31 09:10:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 198. [2018-01-31 09:10:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-01-31 09:10:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 243 transitions. [2018-01-31 09:10:58,737 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 243 transitions. Word has length 26 [2018-01-31 09:10:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:10:58,737 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 243 transitions. [2018-01-31 09:10:58,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:10:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 243 transitions. [2018-01-31 09:10:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:10:58,739 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:10:58,739 INFO L351 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-31 09:10:58,739 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-31 09:10:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1866928143, now seen corresponding path program 1 times [2018-01-31 09:10:58,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:10:58,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:10:58,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:58,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:10:58,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:10:58,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:10:58,872 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-31 09:10:58,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:10:58,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:10:58,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:10:58,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:10:58,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:10:58,874 INFO L87 Difference]: Start difference. First operand 198 states and 243 transitions. Second operand 4 states. [2018-01-31 09:10:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:10:59,234 INFO L93 Difference]: Finished difference Result 371 states and 462 transitions. [2018-01-31 09:10:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:10:59,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-31 09:10:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:10:59,239 INFO L225 Difference]: With dead ends: 371 [2018-01-31 09:10:59,239 INFO L226 Difference]: Without dead ends: 367 [2018-01-31 09:10:59,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:10:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-01-31 09:10:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 332. [2018-01-31 09:10:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-31 09:10:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 424 transitions. [2018-01-31 09:10:59,288 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 424 transitions. Word has length 32 [2018-01-31 09:10:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:10:59,288 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 424 transitions. [2018-01-31 09:10:59,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:10:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 424 transitions. [2018-01-31 09:10:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:10:59,290 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:10:59,290 INFO L351 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-31 09:10:59,290 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-31 09:10:59,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1866928144, now seen corresponding path program 1 times [2018-01-31 09:10:59,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:10:59,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:10:59,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:59,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:10:59,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:10:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:10:59,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:10:59,441 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-31 09:10:59,441 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:10:59,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 09:10:59,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 09:10:59,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 09:10:59,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 09:10:59,442 INFO L87 Difference]: Start difference. First operand 332 states and 424 transitions. Second operand 4 states. [2018-01-31 09:11:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:00,108 INFO L93 Difference]: Finished difference Result 504 states and 640 transitions. [2018-01-31 09:11:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:11:00,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-31 09:11:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:00,113 INFO L225 Difference]: With dead ends: 504 [2018-01-31 09:11:00,113 INFO L226 Difference]: Without dead ends: 500 [2018-01-31 09:11:00,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:11:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-01-31 09:11:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 470. [2018-01-31 09:11:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-01-31 09:11:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 607 transitions. [2018-01-31 09:11:00,143 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 607 transitions. Word has length 32 [2018-01-31 09:11:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:00,143 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 607 transitions. [2018-01-31 09:11:00,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 09:11:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 607 transitions. [2018-01-31 09:11:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:11:00,144 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:00,145 INFO L351 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-31 09:11:00,145 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-31 09:11:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1867205263, now seen corresponding path program 1 times [2018-01-31 09:11:00,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:00,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:00,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:00,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:00,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:00,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:00,241 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-31 09:11:00,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:00,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:11:00,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:11:00,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:11:00,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:11:00,242 INFO L87 Difference]: Start difference. First operand 470 states and 607 transitions. Second operand 6 states. [2018-01-31 09:11:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:00,594 INFO L93 Difference]: Finished difference Result 1328 states and 1737 transitions. [2018-01-31 09:11:00,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:11:00,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-31 09:11:00,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:00,602 INFO L225 Difference]: With dead ends: 1328 [2018-01-31 09:11:00,602 INFO L226 Difference]: Without dead ends: 873 [2018-01-31 09:11:00,606 INFO L554 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-31 09:11:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2018-01-31 09:11:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 836. [2018-01-31 09:11:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-01-31 09:11:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1076 transitions. [2018-01-31 09:11:00,651 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1076 transitions. Word has length 32 [2018-01-31 09:11:00,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:00,651 INFO L432 AbstractCegarLoop]: Abstraction has 836 states and 1076 transitions. [2018-01-31 09:11:00,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:11:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1076 transitions. [2018-01-31 09:11:00,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:11:00,652 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:00,653 INFO L351 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-31 09:11:00,653 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-31 09:11:00,653 INFO L82 PathProgramCache]: Analyzing trace with hash -756017955, now seen corresponding path program 1 times [2018-01-31 09:11:00,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:00,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:00,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:00,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:00,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:00,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:00,732 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-31 09:11:00,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:00,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:11:00,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:11:00,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:11:00,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:11:00,734 INFO L87 Difference]: Start difference. First operand 836 states and 1076 transitions. Second operand 3 states. [2018-01-31 09:11:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:00,809 INFO L93 Difference]: Finished difference Result 860 states and 1100 transitions. [2018-01-31 09:11:00,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:11:00,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-31 09:11:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:00,815 INFO L225 Difference]: With dead ends: 860 [2018-01-31 09:11:00,816 INFO L226 Difference]: Without dead ends: 848 [2018-01-31 09:11:00,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:11:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-01-31 09:11:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 836. [2018-01-31 09:11:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2018-01-31 09:11:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1072 transitions. [2018-01-31 09:11:00,862 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1072 transitions. Word has length 32 [2018-01-31 09:11:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:00,862 INFO L432 AbstractCegarLoop]: Abstraction has 836 states and 1072 transitions. [2018-01-31 09:11:00,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:11:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1072 transitions. [2018-01-31 09:11:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:11:00,864 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:00,864 INFO L351 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-31 09:11:00,864 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-31 09:11:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 13497930, now seen corresponding path program 1 times [2018-01-31 09:11:00,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:00,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:00,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:00,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:00,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:00,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:01,053 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-31 09:11:01,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:01,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:11:01,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:11:01,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:11:01,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:11:01,054 INFO L87 Difference]: Start difference. First operand 836 states and 1072 transitions. Second operand 6 states. [2018-01-31 09:11:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:01,505 INFO L93 Difference]: Finished difference Result 2352 states and 3018 transitions. [2018-01-31 09:11:01,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:11:01,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-31 09:11:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:01,514 INFO L225 Difference]: With dead ends: 2352 [2018-01-31 09:11:01,514 INFO L226 Difference]: Without dead ends: 1531 [2018-01-31 09:11:01,549 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:11:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2018-01-31 09:11:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1486. [2018-01-31 09:11:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-01-31 09:11:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1854 transitions. [2018-01-31 09:11:01,635 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1854 transitions. Word has length 34 [2018-01-31 09:11:01,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:01,635 INFO L432 AbstractCegarLoop]: Abstraction has 1486 states and 1854 transitions. [2018-01-31 09:11:01,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:11:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1854 transitions. [2018-01-31 09:11:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 09:11:01,637 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:01,638 INFO L351 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-31 09:11:01,638 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-31 09:11:01,643 INFO L82 PathProgramCache]: Analyzing trace with hash 256921732, now seen corresponding path program 1 times [2018-01-31 09:11:01,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:01,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:01,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:01,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:01,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:01,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:02,432 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-31 09:11:02,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:02,433 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-31 09:11:02,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:02,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:02,693 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-31 09:11:02,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:02,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-31 09:11:02,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:11:02,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:11:02,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:11:02,728 INFO L87 Difference]: Start difference. First operand 1486 states and 1854 transitions. Second operand 8 states. [2018-01-31 09:11:03,665 WARN L143 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 09:11:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:04,108 INFO L93 Difference]: Finished difference Result 3748 states and 4702 transitions. [2018-01-31 09:11:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 09:11:04,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-01-31 09:11:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:04,124 INFO L225 Difference]: With dead ends: 3748 [2018-01-31 09:11:04,125 INFO L226 Difference]: Without dead ends: 2277 [2018-01-31 09:11:04,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:11:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2018-01-31 09:11:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2160. [2018-01-31 09:11:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2160 states. [2018-01-31 09:11:04,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 2684 transitions. [2018-01-31 09:11:04,242 INFO L78 Accepts]: Start accepts. Automaton has 2160 states and 2684 transitions. Word has length 51 [2018-01-31 09:11:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:04,243 INFO L432 AbstractCegarLoop]: Abstraction has 2160 states and 2684 transitions. [2018-01-31 09:11:04,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:11:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2160 states and 2684 transitions. [2018-01-31 09:11:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 09:11:04,245 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:04,245 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 09:11:04,245 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-31 09:11:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash 530643588, now seen corresponding path program 1 times [2018-01-31 09:11:04,245 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:04,245 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:04,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:04,246 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:04,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:04,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:04,682 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-31 09:11:04,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:04,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:11:04,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:11:04,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:11:04,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:11:04,684 INFO L87 Difference]: Start difference. First operand 2160 states and 2684 transitions. Second operand 6 states. [2018-01-31 09:11:05,087 WARN L143 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 09:11:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:06,520 INFO L93 Difference]: Finished difference Result 5031 states and 6310 transitions. [2018-01-31 09:11:06,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 09:11:06,547 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-01-31 09:11:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:06,562 INFO L225 Difference]: With dead ends: 5031 [2018-01-31 09:11:06,562 INFO L226 Difference]: Without dead ends: 2886 [2018-01-31 09:11:06,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:11:06,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2018-01-31 09:11:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2772. [2018-01-31 09:11:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-01-31 09:11:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3419 transitions. [2018-01-31 09:11:06,715 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3419 transitions. Word has length 52 [2018-01-31 09:11:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:06,715 INFO L432 AbstractCegarLoop]: Abstraction has 2772 states and 3419 transitions. [2018-01-31 09:11:06,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:11:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3419 transitions. [2018-01-31 09:11:06,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 09:11:06,717 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:06,717 INFO L351 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-31 09:11:06,717 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-31 09:11:06,717 INFO L82 PathProgramCache]: Analyzing trace with hash 311400492, now seen corresponding path program 1 times [2018-01-31 09:11:06,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:06,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:06,725 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:06,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:06,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:06,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:07,256 WARN L146 SmtUtils]: Spent 355ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-31 09:11:07,916 WARN L146 SmtUtils]: Spent 606ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-01-31 09:11:08,507 WARN L146 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 19 DAG size of output 14 [2018-01-31 09:11:08,794 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-31 09:11:08,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:08,794 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) [2018-01-31 09:11:08,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:11:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:08,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:09,123 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-31 09:11:09,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:11:09,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2018-01-31 09:11:09,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:11:09,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:11:09,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:11:09,145 INFO L87 Difference]: Start difference. First operand 2772 states and 3419 transitions. Second operand 14 states. [2018-01-31 09:11:09,725 WARN L146 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 19 DAG size of output 8 [2018-01-31 09:11:12,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:12,418 INFO L93 Difference]: Finished difference Result 4514 states and 5507 transitions. [2018-01-31 09:11:12,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:11:12,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-01-31 09:11:12,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:12,427 INFO L225 Difference]: With dead ends: 4514 [2018-01-31 09:11:12,427 INFO L226 Difference]: Without dead ends: 1613 [2018-01-31 09:11:12,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 09:11:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2018-01-31 09:11:12,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1491. [2018-01-31 09:11:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2018-01-31 09:11:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1813 transitions. [2018-01-31 09:11:12,504 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1813 transitions. Word has length 60 [2018-01-31 09:11:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:12,504 INFO L432 AbstractCegarLoop]: Abstraction has 1491 states and 1813 transitions. [2018-01-31 09:11:12,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:11:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1813 transitions. [2018-01-31 09:11:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 09:11:12,505 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:12,505 INFO L351 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-31 09:11:12,505 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-31 09:11:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1184136510, now seen corresponding path program 1 times [2018-01-31 09:11:12,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:12,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:12,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:12,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:12,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:12,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:12,845 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 13 DAG size of output 12 [2018-01-31 09:11:12,922 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-31 09:11:12,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:12,922 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-31 09:11:12,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:12,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:13,135 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-31 09:11:13,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:13,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-01-31 09:11:13,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 09:11:13,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 09:11:13,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:11:13,156 INFO L87 Difference]: Start difference. First operand 1491 states and 1813 transitions. Second operand 16 states. [2018-01-31 09:11:14,208 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 9 [2018-01-31 09:11:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:14,784 INFO L93 Difference]: Finished difference Result 4855 states and 6008 transitions. [2018-01-31 09:11:14,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-31 09:11:14,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-01-31 09:11:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:14,800 INFO L225 Difference]: With dead ends: 4855 [2018-01-31 09:11:14,800 INFO L226 Difference]: Without dead ends: 3379 [2018-01-31 09:11:14,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=385, Invalid=1595, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:11:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3379 states. [2018-01-31 09:11:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3379 to 2585. [2018-01-31 09:11:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2585 states. [2018-01-31 09:11:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 3134 transitions. [2018-01-31 09:11:14,941 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 3134 transitions. Word has length 60 [2018-01-31 09:11:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:14,942 INFO L432 AbstractCegarLoop]: Abstraction has 2585 states and 3134 transitions. [2018-01-31 09:11:14,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 09:11:14,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 3134 transitions. [2018-01-31 09:11:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-31 09:11:14,943 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:14,944 INFO L351 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-31 09:11:14,944 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-31 09:11:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1545139132, now seen corresponding path program 1 times [2018-01-31 09:11:14,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:14,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:14,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:14,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:14,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:14,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:15,293 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-31 09:11:15,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:15,293 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-31 09:11:15,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:15,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:15,494 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-31 09:11:15,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 09:11:15,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-01-31 09:11:15,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:11:15,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:11:15,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:11:15,520 INFO L87 Difference]: Start difference. First operand 2585 states and 3134 transitions. Second operand 11 states. [2018-01-31 09:11:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:17,144 INFO L93 Difference]: Finished difference Result 9514 states and 11679 transitions. [2018-01-31 09:11:17,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-31 09:11:17,144 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-01-31 09:11:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:17,174 INFO L225 Difference]: With dead ends: 9514 [2018-01-31 09:11:17,174 INFO L226 Difference]: Without dead ends: 6944 [2018-01-31 09:11:17,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=475, Invalid=2075, Unknown=0, NotChecked=0, Total=2550 [2018-01-31 09:11:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6944 states. [2018-01-31 09:11:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6944 to 6147. [2018-01-31 09:11:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6147 states. [2018-01-31 09:11:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7443 transitions. [2018-01-31 09:11:17,515 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7443 transitions. Word has length 70 [2018-01-31 09:11:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:17,517 INFO L432 AbstractCegarLoop]: Abstraction has 6147 states and 7443 transitions. [2018-01-31 09:11:17,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:11:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7443 transitions. [2018-01-31 09:11:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 09:11:17,519 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:17,520 INFO L351 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-31 09:11:17,520 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-31 09:11:17,520 INFO L82 PathProgramCache]: Analyzing trace with hash -124703866, now seen corresponding path program 1 times [2018-01-31 09:11:17,520 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:17,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:17,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:17,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:17,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:17,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:17,996 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-31 09:11:17,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:17,997 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-31 09:11:18,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:18,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:18,114 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-31 09:11:18,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:18,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-01-31 09:11:18,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:11:18,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:11:18,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:11:18,134 INFO L87 Difference]: Start difference. First operand 6147 states and 7443 transitions. Second operand 13 states. [2018-01-31 09:11:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:18,784 INFO L93 Difference]: Finished difference Result 11680 states and 14114 transitions. [2018-01-31 09:11:18,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:11:18,787 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-01-31 09:11:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:18,819 INFO L225 Difference]: With dead ends: 11680 [2018-01-31 09:11:18,819 INFO L226 Difference]: Without dead ends: 6271 [2018-01-31 09:11:18,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-01-31 09:11:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6271 states. [2018-01-31 09:11:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6271 to 6069. [2018-01-31 09:11:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6069 states. [2018-01-31 09:11:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6069 states to 6069 states and 7339 transitions. [2018-01-31 09:11:19,070 INFO L78 Accepts]: Start accepts. Automaton has 6069 states and 7339 transitions. Word has length 81 [2018-01-31 09:11:19,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:19,071 INFO L432 AbstractCegarLoop]: Abstraction has 6069 states and 7339 transitions. [2018-01-31 09:11:19,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:11:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 6069 states and 7339 transitions. [2018-01-31 09:11:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-31 09:11:19,074 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:19,074 INFO L351 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-31 09:11:19,074 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-31 09:11:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 4400356, now seen corresponding path program 1 times [2018-01-31 09:11:19,075 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:19,075 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:19,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:19,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:19,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:19,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:19,292 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-31 09:11:19,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:19,292 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-31 09:11:19,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:19,343 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:19,391 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-31 09:11:19,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:19,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-01-31 09:11:19,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:11:19,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:11:19,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:11:19,412 INFO L87 Difference]: Start difference. First operand 6069 states and 7339 transitions. Second operand 13 states. [2018-01-31 09:11:20,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:20,898 INFO L93 Difference]: Finished difference Result 13498 states and 16978 transitions. [2018-01-31 09:11:20,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:11:20,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-01-31 09:11:20,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:20,938 INFO L225 Difference]: With dead ends: 13498 [2018-01-31 09:11:20,938 INFO L226 Difference]: Without dead ends: 8245 [2018-01-31 09:11:20,952 INFO L554 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-31 09:11:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2018-01-31 09:11:21,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 5205. [2018-01-31 09:11:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5205 states. [2018-01-31 09:11:21,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 6265 transitions. [2018-01-31 09:11:21,265 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 6265 transitions. Word has length 82 [2018-01-31 09:11:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:21,265 INFO L432 AbstractCegarLoop]: Abstraction has 5205 states and 6265 transitions. [2018-01-31 09:11:21,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:11:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 6265 transitions. [2018-01-31 09:11:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-31 09:11:21,268 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:21,268 INFO L351 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-31 09:11:21,268 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-31 09:11:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2112447677, now seen corresponding path program 1 times [2018-01-31 09:11:21,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:21,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:21,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:21,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:21,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:21,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:21,793 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-31 09:11:21,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:21,793 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-31 09:11:21,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:21,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:21,889 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-31 09:11:21,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:21,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-31 09:11:21,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:11:21,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:11:21,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:11:21,910 INFO L87 Difference]: Start difference. First operand 5205 states and 6265 transitions. Second operand 11 states. [2018-01-31 09:11:22,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:22,774 INFO L93 Difference]: Finished difference Result 13339 states and 16723 transitions. [2018-01-31 09:11:22,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 09:11:22,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-01-31 09:11:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:22,814 INFO L225 Difference]: With dead ends: 13339 [2018-01-31 09:11:22,814 INFO L226 Difference]: Without dead ends: 8029 [2018-01-31 09:11:22,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-01-31 09:11:22,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8029 states. [2018-01-31 09:11:23,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8029 to 6125. [2018-01-31 09:11:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6125 states. [2018-01-31 09:11:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6125 states to 6125 states and 7315 transitions. [2018-01-31 09:11:23,117 INFO L78 Accepts]: Start accepts. Automaton has 6125 states and 7315 transitions. Word has length 100 [2018-01-31 09:11:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:23,118 INFO L432 AbstractCegarLoop]: Abstraction has 6125 states and 7315 transitions. [2018-01-31 09:11:23,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:11:23,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6125 states and 7315 transitions. [2018-01-31 09:11:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-31 09:11:23,121 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:23,121 INFO L351 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-31 09:11:23,121 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-31 09:11:23,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1901413795, now seen corresponding path program 1 times [2018-01-31 09:11:23,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:23,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:23,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:23,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:23,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:23,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:23,358 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-31 09:11:23,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:23,358 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-31 09:11:23,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:23,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:23,462 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-31 09:11:23,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:23,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-31 09:11:23,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:11:23,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:11:23,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:11:23,483 INFO L87 Difference]: Start difference. First operand 6125 states and 7315 transitions. Second operand 14 states. [2018-01-31 09:11:23,970 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 11 DAG size of output 8 [2018-01-31 09:11:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:24,985 INFO L93 Difference]: Finished difference Result 12663 states and 15215 transitions. [2018-01-31 09:11:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:11:24,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 100 [2018-01-31 09:11:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:25,004 INFO L225 Difference]: With dead ends: 12663 [2018-01-31 09:11:25,004 INFO L226 Difference]: Without dead ends: 7438 [2018-01-31 09:11:25,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:11:25,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7438 states. [2018-01-31 09:11:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7438 to 7229. [2018-01-31 09:11:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7229 states. [2018-01-31 09:11:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7229 states to 7229 states and 8723 transitions. [2018-01-31 09:11:25,352 INFO L78 Accepts]: Start accepts. Automaton has 7229 states and 8723 transitions. Word has length 100 [2018-01-31 09:11:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:25,352 INFO L432 AbstractCegarLoop]: Abstraction has 7229 states and 8723 transitions. [2018-01-31 09:11:25,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:11:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7229 states and 8723 transitions. [2018-01-31 09:11:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-01-31 09:11:25,356 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:25,356 INFO L351 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-31 09:11:25,356 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-31 09:11:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1650986556, now seen corresponding path program 1 times [2018-01-31 09:11:25,357 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:25,357 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:25,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:25,358 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:25,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:25,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:25,704 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-31 09:11:25,704 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:25,705 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-31 09:11:25,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:25,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:26,011 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-31 09:11:26,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:26,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-01-31 09:11:26,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 09:11:26,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 09:11:26,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-31 09:11:26,031 INFO L87 Difference]: Start difference. First operand 7229 states and 8723 transitions. Second operand 13 states. [2018-01-31 09:11:26,266 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 13 [2018-01-31 09:11:26,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:26,729 INFO L93 Difference]: Finished difference Result 13703 states and 16527 transitions. [2018-01-31 09:11:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:11:26,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-01-31 09:11:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:26,752 INFO L225 Difference]: With dead ends: 13703 [2018-01-31 09:11:26,753 INFO L226 Difference]: Without dead ends: 7066 [2018-01-31 09:11:26,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:11:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2018-01-31 09:11:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 6985. [2018-01-31 09:11:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6985 states. [2018-01-31 09:11:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6985 states to 6985 states and 8351 transitions. [2018-01-31 09:11:27,085 INFO L78 Accepts]: Start accepts. Automaton has 6985 states and 8351 transitions. Word has length 102 [2018-01-31 09:11:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:27,085 INFO L432 AbstractCegarLoop]: Abstraction has 6985 states and 8351 transitions. [2018-01-31 09:11:27,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 09:11:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 6985 states and 8351 transitions. [2018-01-31 09:11:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-31 09:11:27,088 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:27,089 INFO L351 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-31 09:11:27,089 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-31 09:11:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1027238307, now seen corresponding path program 2 times [2018-01-31 09:11:27,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:27,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:27,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:27,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:27,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:27,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:27,584 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-31 09:11:27,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:27,585 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-31 09:11:27,590 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 09:11:27,620 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:11:27,640 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 09:11:27,643 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 09:11:27,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:27,679 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-31 09:11:27,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:27,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-01-31 09:11:27,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:11:27,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:11:27,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:11:27,700 INFO L87 Difference]: Start difference. First operand 6985 states and 8351 transitions. Second operand 12 states. [2018-01-31 09:11:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:28,332 INFO L93 Difference]: Finished difference Result 11813 states and 14590 transitions. [2018-01-31 09:11:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 09:11:28,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-01-31 09:11:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:28,344 INFO L225 Difference]: With dead ends: 11813 [2018-01-31 09:11:28,345 INFO L226 Difference]: Without dead ends: 4804 [2018-01-31 09:11:28,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-01-31 09:11:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2018-01-31 09:11:28,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 3508. [2018-01-31 09:11:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3508 states. [2018-01-31 09:11:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 4151 transitions. [2018-01-31 09:11:28,559 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 4151 transitions. Word has length 109 [2018-01-31 09:11:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:28,560 INFO L432 AbstractCegarLoop]: Abstraction has 3508 states and 4151 transitions. [2018-01-31 09:11:28,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:11:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 4151 transitions. [2018-01-31 09:11:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-31 09:11:28,564 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:28,564 INFO L351 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-31 09:11:28,564 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-31 09:11:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1739520311, now seen corresponding path program 1 times [2018-01-31 09:11:28,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:28,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:28,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:28,566 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 09:11:28,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:28,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:28,870 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-31 09:11:28,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:28,870 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-31 09:11:28,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:28,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:29,223 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-31 09:11:29,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:29,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-31 09:11:29,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 09:11:29,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 09:11:29,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-31 09:11:29,244 INFO L87 Difference]: Start difference. First operand 3508 states and 4151 transitions. Second operand 21 states. [2018-01-31 09:11:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:30,588 INFO L93 Difference]: Finished difference Result 8570 states and 10257 transitions. [2018-01-31 09:11:30,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 09:11:30,589 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2018-01-31 09:11:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:30,605 INFO L225 Difference]: With dead ends: 8570 [2018-01-31 09:11:30,605 INFO L226 Difference]: Without dead ends: 5158 [2018-01-31 09:11:30,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 09:11:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2018-01-31 09:11:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 4483. [2018-01-31 09:11:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4483 states. [2018-01-31 09:11:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 5267 transitions. [2018-01-31 09:11:30,883 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 5267 transitions. Word has length 109 [2018-01-31 09:11:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:30,884 INFO L432 AbstractCegarLoop]: Abstraction has 4483 states and 5267 transitions. [2018-01-31 09:11:30,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 09:11:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 5267 transitions. [2018-01-31 09:11:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-31 09:11:30,889 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:30,889 INFO L351 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-31 09:11:30,889 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-31 09:11:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1551451171, now seen corresponding path program 1 times [2018-01-31 09:11:30,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:30,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:30,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:30,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:30,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:30,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:31,137 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-31 09:11:31,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:31,138 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-31 09:11:31,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:31,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:31,292 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-31 09:11:31,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:31,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-31 09:11:31,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:11:31,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:11:31,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:11:31,313 INFO L87 Difference]: Start difference. First operand 4483 states and 5267 transitions. Second operand 14 states. [2018-01-31 09:11:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:32,051 INFO L93 Difference]: Finished difference Result 10073 states and 11946 transitions. [2018-01-31 09:11:32,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 09:11:32,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 142 [2018-01-31 09:11:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:32,062 INFO L225 Difference]: With dead ends: 10073 [2018-01-31 09:11:32,062 INFO L226 Difference]: Without dead ends: 5578 [2018-01-31 09:11:32,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2018-01-31 09:11:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2018-01-31 09:11:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 5386. [2018-01-31 09:11:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5386 states. [2018-01-31 09:11:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 6350 transitions. [2018-01-31 09:11:32,383 INFO L78 Accepts]: Start accepts. Automaton has 5386 states and 6350 transitions. Word has length 142 [2018-01-31 09:11:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:32,384 INFO L432 AbstractCegarLoop]: Abstraction has 5386 states and 6350 transitions. [2018-01-31 09:11:32,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:11:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5386 states and 6350 transitions. [2018-01-31 09:11:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-01-31 09:11:32,388 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:32,388 INFO L351 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-31 09:11:32,388 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-31 09:11:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1997766460, now seen corresponding path program 1 times [2018-01-31 09:11:32,389 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:32,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:32,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:32,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:32,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:32,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:33,730 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-31 09:11:33,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:33,744 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) [2018-01-31 09:11:33,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 09:11:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:33,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:33,891 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-31 09:11:33,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:33,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-31 09:11:33,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:11:33,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:11:33,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:11:33,912 INFO L87 Difference]: Start difference. First operand 5386 states and 6350 transitions. Second operand 14 states. [2018-01-31 09:11:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:34,547 INFO L93 Difference]: Finished difference Result 12281 states and 14663 transitions. [2018-01-31 09:11:34,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 09:11:34,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 144 [2018-01-31 09:11:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:34,560 INFO L225 Difference]: With dead ends: 12281 [2018-01-31 09:11:34,561 INFO L226 Difference]: Without dead ends: 6982 [2018-01-31 09:11:34,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-31 09:11:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6982 states. [2018-01-31 09:11:34,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6982 to 5239. [2018-01-31 09:11:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5239 states. [2018-01-31 09:11:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 6193 transitions. [2018-01-31 09:11:34,878 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 6193 transitions. Word has length 144 [2018-01-31 09:11:34,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:34,879 INFO L432 AbstractCegarLoop]: Abstraction has 5239 states and 6193 transitions. [2018-01-31 09:11:34,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:11:34,879 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 6193 transitions. [2018-01-31 09:11:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-31 09:11:34,886 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:34,887 INFO L351 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-31 09:11:34,887 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-31 09:11:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1705580956, now seen corresponding path program 1 times [2018-01-31 09:11:34,887 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:34,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:34,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:34,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:34,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:34,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:35,298 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-31 09:11:35,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:35,298 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-31 09:11:35,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:35,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:35,427 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-31 09:11:35,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:35,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-31 09:11:35,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:11:35,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:11:35,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:11:35,461 INFO L87 Difference]: Start difference. First operand 5239 states and 6193 transitions. Second operand 14 states. [2018-01-31 09:11:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:36,083 INFO L93 Difference]: Finished difference Result 11582 states and 13792 transitions. [2018-01-31 09:11:36,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:11:36,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 147 [2018-01-31 09:11:36,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:36,096 INFO L225 Difference]: With dead ends: 11582 [2018-01-31 09:11:36,096 INFO L226 Difference]: Without dead ends: 6475 [2018-01-31 09:11:36,102 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:11:36,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6475 states. [2018-01-31 09:11:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6475 to 5818. [2018-01-31 09:11:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5818 states. [2018-01-31 09:11:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 6895 transitions. [2018-01-31 09:11:36,456 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 6895 transitions. Word has length 147 [2018-01-31 09:11:36,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:36,456 INFO L432 AbstractCegarLoop]: Abstraction has 5818 states and 6895 transitions. [2018-01-31 09:11:36,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:11:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 6895 transitions. [2018-01-31 09:11:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-01-31 09:11:36,461 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:36,461 INFO L351 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-31 09:11:36,461 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-31 09:11:36,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1798126083, now seen corresponding path program 1 times [2018-01-31 09:11:36,461 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:36,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:36,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:36,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:36,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:36,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:36,966 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-31 09:11:36,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:36,967 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-31 09:11:36,972 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:37,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:37,080 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-31 09:11:37,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:37,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-31 09:11:37,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 09:11:37,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 09:11:37,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:11:37,101 INFO L87 Difference]: Start difference. First operand 5818 states and 6895 transitions. Second operand 14 states. [2018-01-31 09:11:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:37,657 INFO L93 Difference]: Finished difference Result 12125 states and 14422 transitions. [2018-01-31 09:11:37,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 09:11:37,657 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2018-01-31 09:11:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:37,666 INFO L225 Difference]: With dead ends: 12125 [2018-01-31 09:11:37,666 INFO L226 Difference]: Without dead ends: 6439 [2018-01-31 09:11:37,672 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:11:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6439 states. [2018-01-31 09:11:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6439 to 6397. [2018-01-31 09:11:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6397 states. [2018-01-31 09:11:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6397 states to 6397 states and 7615 transitions. [2018-01-31 09:11:37,923 INFO L78 Accepts]: Start accepts. Automaton has 6397 states and 7615 transitions. Word has length 149 [2018-01-31 09:11:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:37,923 INFO L432 AbstractCegarLoop]: Abstraction has 6397 states and 7615 transitions. [2018-01-31 09:11:37,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 09:11:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 6397 states and 7615 transitions. [2018-01-31 09:11:37,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-31 09:11:37,927 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:37,927 INFO L351 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-31 09:11:37,927 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-31 09:11:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash 636520571, now seen corresponding path program 1 times [2018-01-31 09:11:37,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:37,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:37,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:37,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:37,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:37,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:38,529 WARN L146 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 14 DAG size of output 13 [2018-01-31 09:11:38,712 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-31 09:11:38,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:38,712 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-31 09:11:38,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:38,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:38,929 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-31 09:11:38,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:38,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-01-31 09:11:38,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:11:38,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:11:38,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:11:38,950 INFO L87 Difference]: Start difference. First operand 6397 states and 7615 transitions. Second operand 22 states. [2018-01-31 09:11:40,450 WARN L143 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 9 [2018-01-31 09:11:41,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:41,123 INFO L93 Difference]: Finished difference Result 14903 states and 17785 transitions. [2018-01-31 09:11:41,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 09:11:41,124 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 154 [2018-01-31 09:11:41,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:41,136 INFO L225 Difference]: With dead ends: 14903 [2018-01-31 09:11:41,136 INFO L226 Difference]: Without dead ends: 8638 [2018-01-31 09:11:41,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450 [2018-01-31 09:11:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8638 states. [2018-01-31 09:11:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8638 to 6883. [2018-01-31 09:11:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6883 states. [2018-01-31 09:11:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6883 states to 6883 states and 8017 transitions. [2018-01-31 09:11:41,540 INFO L78 Accepts]: Start accepts. Automaton has 6883 states and 8017 transitions. Word has length 154 [2018-01-31 09:11:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:41,540 INFO L432 AbstractCegarLoop]: Abstraction has 6883 states and 8017 transitions. [2018-01-31 09:11:41,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:11:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 8017 transitions. [2018-01-31 09:11:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-01-31 09:11:41,545 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:41,545 INFO L351 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-31 09:11:41,545 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-31 09:11:41,546 INFO L82 PathProgramCache]: Analyzing trace with hash -727462505, now seen corresponding path program 1 times [2018-01-31 09:11:41,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:41,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:41,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:41,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:41,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:41,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:42,093 WARN L146 SmtUtils]: Spent 321ms on a formula simplification. DAG size of input: 14 DAG size of output 13 [2018-01-31 09:11:42,185 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-31 09:11:42,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 09:11:42,185 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-31 09:11:42,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:42,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 09:11:42,415 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-31 09:11:42,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 09:11:42,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-31 09:11:42,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 09:11:42,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 09:11:42,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-31 09:11:42,436 INFO L87 Difference]: Start difference. First operand 6883 states and 8017 transitions. Second operand 21 states. [2018-01-31 09:11:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:43,769 INFO L93 Difference]: Finished difference Result 14375 states and 16738 transitions. [2018-01-31 09:11:43,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 09:11:43,770 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 158 [2018-01-31 09:11:43,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:43,780 INFO L225 Difference]: With dead ends: 14375 [2018-01-31 09:11:43,780 INFO L226 Difference]: Without dead ends: 7471 [2018-01-31 09:11:43,790 INFO L554 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-31 09:11:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2018-01-31 09:11:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7381. [2018-01-31 09:11:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7381 states. [2018-01-31 09:11:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7381 states to 7381 states and 8516 transitions. [2018-01-31 09:11:44,142 INFO L78 Accepts]: Start accepts. Automaton has 7381 states and 8516 transitions. Word has length 158 [2018-01-31 09:11:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:44,142 INFO L432 AbstractCegarLoop]: Abstraction has 7381 states and 8516 transitions. [2018-01-31 09:11:44,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 09:11:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 7381 states and 8516 transitions. [2018-01-31 09:11:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-01-31 09:11:44,148 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:44,148 INFO L351 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-31 09:11:44,148 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-31 09:11:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1053299623, now seen corresponding path program 1 times [2018-01-31 09:11:44,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:44,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:44,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:44,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:44,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:11:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:11:44,304 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:11:44,485 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 09:11:44,517 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-31 09:11:44,518 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-31 09:11:44,519 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-31 09:11:44,520 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-31 09:11:44,521 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-31 09:11:44,531 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-31 09:11:44,532 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-31 09:11:44,533 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-31 09:11:44,536 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-31 09:11:44,537 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-31 09:11:44,537 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-31 09:11:44,538 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-31 09:11:44,548 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-31 09:11:44,549 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-31 09:11:44,549 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-31 09:11:44,550 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-31 09:11:44,550 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-31 09:11:44,552 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-31 09:11:44,553 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-31 09:11:44,553 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-31 09:11:44,553 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-31 09:11:44,554 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-31 09:11:44,554 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-31 09:11:44,555 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-31 09:11:44,562 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-31 09:11:44,562 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-31 09:11:44,563 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-31 09:11:44,563 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-31 09:11:44,564 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-31 09:11:44,564 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-31 09:11:44,564 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-01-31 09:11:44,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:11:44 BoogieIcfgContainer [2018-01-31 09:11:44,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:11:44,605 INFO L168 Benchmark]: Toolchain (without parser) took 48411.48 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 269.1 MB in the beginning and 1.2 GB in the end (delta: -938.2 MB). Peak memory consumption was 888.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:44,607 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:11:44,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.11 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 256.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:44,607 INFO L168 Benchmark]: Boogie Preprocessor took 96.12 ms. Allocated memory is still 309.3 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:44,607 INFO L168 Benchmark]: RCFGBuilder took 1096.43 ms. Allocated memory is still 309.3 MB. Free memory was 254.8 MB in the beginning and 223.7 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:44,608 INFO L168 Benchmark]: TraceAbstraction took 46931.00 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 223.7 MB in the beginning and 1.2 GB in the end (delta: -983.5 MB). Peak memory consumption was 842.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:44,610 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.14 ms. Allocated memory is still 309.3 MB. Free memory is still 275.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 276.11 ms. Allocated memory is still 309.3 MB. Free memory was 268.1 MB in the beginning and 256.8 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 96.12 ms. Allocated memory is still 309.3 MB. Free memory was 256.8 MB in the beginning and 254.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1096.43 ms. Allocated memory is still 309.3 MB. Free memory was 254.8 MB in the beginning and 223.7 MB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46931.00 ms. Allocated memory was 309.3 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 223.7 MB in the beginning and 1.2 GB in the end (delta: -983.5 MB). Peak memory consumption was 842.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)=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={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)=24, \old(t1)=20, \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)=24, \old(t1)=20, \old(t4)=31, \old(t4)=13, \old(x1)=28, \old(x1)=9, \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)=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)=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={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)=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={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)=11, \old(S)=21, \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={0:0}, x4={18:25}] [L657] struct cell* garbage; VAL [\old(garbage)=32, \old(garbage)=30, \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)=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)=13, \old(t4)=31, \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={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)=11, \old(S)=21, \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={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)=0, \old(x1)=12, \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)=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}] [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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ 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)=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}] [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)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 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)=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}] [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)=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}] [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)=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}] [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)=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}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 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)=0, \old(x1)=12, \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)=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=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)=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}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=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)=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}] [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)=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}] [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)=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}] [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, 46.8s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 25.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4125 SDtfs, 11083 SDslu, 12219 SDs, 0 SdLazy, 11722 SolverSat, 1635 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2438 GetRequests, 1872 SyntacticMatches, 21 SemanticMatches, 545 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4622 ImplicationChecksByTransitivity, 17.1s 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: 5.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 14008 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.9s 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-31_09-11-44-619.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-31_09-11-44-619.csv Received shutdown request...