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.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:11:16,580 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:11:16,582 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:11:16,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:11:16,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:11:16,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:11:16,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:11:16,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:11:16,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:11:16,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:11:16,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:11:16,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:11:16,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:11:16,606 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:11:16,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:11:16,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:11:16,612 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:11:16,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:11:16,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:11:16,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:11:16,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:11:16,619 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:11:16,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:11:16,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:11:16,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:11:16,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:11:16,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:11:16,623 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:11:16,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:11:16,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:11:16,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:11:16,625 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:11:16,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:11:16,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:11:16,636 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:11:16,636 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:11:16,636 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:11:16,637 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:11:16,637 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:11:16,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:11:16,638 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:11:16,638 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:11:16,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:11:16,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:11:16,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:11:16,638 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:11:16,639 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:11:16,639 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:11:16,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:11:16,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:11:16,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:11:16,640 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:11:16,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:11:16,640 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:11:16,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:11:16,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:11:16,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:11:16,641 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:11:16,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:11:16,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:11:16,641 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:11:16,642 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:11:16,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:11:16,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:11:16,643 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:11:16,643 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:11:16,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:11:16,688 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:11:16,690 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:11:16,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:11:16,692 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:11:16,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-01-29 23:11:16,859 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:11:16,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:11:16,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:11:16,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:11:16,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:11:16,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:11:16" (1/1) ... [2018-01-29 23:11:16,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be68e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:16, skipping insertion in model container [2018-01-29 23:11:16,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:11:16" (1/1) ... [2018-01-29 23:11:16,902 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:11:16,945 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:11:17,087 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:11:17,113 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:11:17,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17 WrapperNode [2018-01-29 23:11:17,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:11:17,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:11:17,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:11:17,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:11:17,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... [2018-01-29 23:11:17,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... [2018-01-29 23:11:17,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... [2018-01-29 23:11:17,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... [2018-01-29 23:11:17,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... [2018-01-29 23:11:17,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... [2018-01-29 23:11:17,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... [2018-01-29 23:11:17,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:11:17,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:11:17,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:11:17,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:11:17,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:11:17,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:11:17,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:11:17,218 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-29 23:11:17,218 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-29 23:11:17,218 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:11:17,218 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:11:17,218 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:11:17,218 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-29 23:11:17,219 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:11:17,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:11:17,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:11:17,825 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:11:17,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:11:17 BoogieIcfgContainer [2018-01-29 23:11:17,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:11:17,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:11:17,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:11:17,831 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:11:17,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:11:16" (1/3) ... [2018-01-29 23:11:17,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12356e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:11:17, skipping insertion in model container [2018-01-29 23:11:17,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:11:17" (2/3) ... [2018-01-29 23:11:17,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12356e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:11:17, skipping insertion in model container [2018-01-29 23:11:17,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:11:17" (3/3) ... [2018-01-29 23:11:17,837 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-01-29 23:11:17,847 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:11:17,859 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-29 23:11:17,920 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:11:17,920 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:11:17,921 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:11:17,921 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:11:17,921 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:11:17,921 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:11:17,921 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:11:17,921 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:11:17,922 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:11:17,952 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2018-01-29 23:11:17,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 23:11:17,964 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:17,967 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:17,968 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:17,974 INFO L82 PathProgramCache]: Analyzing trace with hash -535779211, now seen corresponding path program 1 times [2018-01-29 23:11:17,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:17,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:18,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:18,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:18,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:18,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:18,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:11:18,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-29 23:11:18,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-29 23:11:18,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:11:18,255 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 2 states. [2018-01-29 23:11:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:18,367 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-01-29 23:11:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-29 23:11:18,368 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-29 23:11:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:18,380 INFO L225 Difference]: With dead ends: 139 [2018-01-29 23:11:18,380 INFO L226 Difference]: Without dead ends: 119 [2018-01-29 23:11:18,383 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-29 23:11:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-29 23:11:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-29 23:11:18,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-29 23:11:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2018-01-29 23:11:18,421 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 19 [2018-01-29 23:11:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:18,422 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-01-29 23:11:18,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-29 23:11:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2018-01-29 23:11:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:11:18,423 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:18,423 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:18,423 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:18,423 INFO L82 PathProgramCache]: Analyzing trace with hash -234455602, now seen corresponding path program 1 times [2018-01-29 23:11:18,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:18,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:18,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:18,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:18,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:18,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:18,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:18,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:11:18,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:11:18,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:11:18,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:11:18,508 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 3 states. [2018-01-29 23:11:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:18,538 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2018-01-29 23:11:18,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:11:18,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-29 23:11:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:18,541 INFO L225 Difference]: With dead ends: 136 [2018-01-29 23:11:18,541 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 23:11:18,542 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:11:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 23:11:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-29 23:11:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-29 23:11:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2018-01-29 23:11:18,551 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 24 [2018-01-29 23:11:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:18,551 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2018-01-29 23:11:18,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:11:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2018-01-29 23:11:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-29 23:11:18,552 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:18,552 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:18,552 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:18,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1638530351, now seen corresponding path program 1 times [2018-01-29 23:11:18,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:18,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:18,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:18,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:18,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:18,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:18,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:11:18,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:11:18,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:11:18,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:11:18,654 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 3 states. [2018-01-29 23:11:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:18,689 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2018-01-29 23:11:18,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:11:18,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-29 23:11:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:18,692 INFO L225 Difference]: With dead ends: 226 [2018-01-29 23:11:18,693 INFO L226 Difference]: Without dead ends: 212 [2018-01-29 23:11:18,693 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:11:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-29 23:11:18,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 193. [2018-01-29 23:11:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-29 23:11:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2018-01-29 23:11:18,714 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 26 [2018-01-29 23:11:18,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:18,714 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2018-01-29 23:11:18,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:11:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2018-01-29 23:11:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-29 23:11:18,715 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:18,715 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:18,716 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:18,716 INFO L82 PathProgramCache]: Analyzing trace with hash 745165149, now seen corresponding path program 1 times [2018-01-29 23:11:18,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:18,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:18,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:18,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:18,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:18,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:18,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:11:18,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:11:18,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:11:18,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:11:18,780 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand 3 states. [2018-01-29 23:11:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:18,880 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2018-01-29 23:11:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:11:18,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-29 23:11:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:18,884 INFO L225 Difference]: With dead ends: 246 [2018-01-29 23:11:18,884 INFO L226 Difference]: Without dead ends: 239 [2018-01-29 23:11:18,886 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:11:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-29 23:11:18,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2018-01-29 23:11:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-29 23:11:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 287 transitions. [2018-01-29 23:11:18,925 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 287 transitions. Word has length 27 [2018-01-29 23:11:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:18,925 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 287 transitions. [2018-01-29 23:11:18,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:11:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 287 transitions. [2018-01-29 23:11:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:11:18,927 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:18,927 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:18,927 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1650110100, now seen corresponding path program 1 times [2018-01-29 23:11:18,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:18,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:18,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:18,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:18,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:18,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:18,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:18,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:11:18,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:11:18,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:11:18,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:11:18,992 INFO L87 Difference]: Start difference. First operand 230 states and 287 transitions. Second operand 4 states. [2018-01-29 23:11:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:19,152 INFO L93 Difference]: Finished difference Result 396 states and 497 transitions. [2018-01-29 23:11:19,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:11:19,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-29 23:11:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:19,156 INFO L225 Difference]: With dead ends: 396 [2018-01-29 23:11:19,157 INFO L226 Difference]: Without dead ends: 392 [2018-01-29 23:11:19,157 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:11:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-01-29 23:11:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 363. [2018-01-29 23:11:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-29 23:11:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 468 transitions. [2018-01-29 23:11:19,183 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 468 transitions. Word has length 32 [2018-01-29 23:11:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:19,184 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 468 transitions. [2018-01-29 23:11:19,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:11:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 468 transitions. [2018-01-29 23:11:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:11:19,185 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:19,186 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:19,186 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1650110101, now seen corresponding path program 1 times [2018-01-29 23:11:19,187 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:19,187 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:19,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:19,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:19,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:19,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:19,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:19,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:11:19,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:11:19,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:11:19,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:11:19,313 INFO L87 Difference]: Start difference. First operand 363 states and 468 transitions. Second operand 4 states. [2018-01-29 23:11:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:19,479 INFO L93 Difference]: Finished difference Result 495 states and 628 transitions. [2018-01-29 23:11:19,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:11:19,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-29 23:11:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:19,485 INFO L225 Difference]: With dead ends: 495 [2018-01-29 23:11:19,486 INFO L226 Difference]: Without dead ends: 491 [2018-01-29 23:11:19,486 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:11:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-01-29 23:11:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 467. [2018-01-29 23:11:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-01-29 23:11:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 602 transitions. [2018-01-29 23:11:19,509 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 602 transitions. Word has length 32 [2018-01-29 23:11:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:19,509 INFO L432 AbstractCegarLoop]: Abstraction has 467 states and 602 transitions. [2018-01-29 23:11:19,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:11:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 602 transitions. [2018-01-29 23:11:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-29 23:11:19,511 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:19,511 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:19,511 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:19,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1650387220, now seen corresponding path program 1 times [2018-01-29 23:11:19,511 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:19,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:19,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:19,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:19,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:19,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:19,634 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:19,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:11:19,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:11:19,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:11:19,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:11:19,635 INFO L87 Difference]: Start difference. First operand 467 states and 602 transitions. Second operand 6 states. [2018-01-29 23:11:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:19,826 INFO L93 Difference]: Finished difference Result 1319 states and 1722 transitions. [2018-01-29 23:11:19,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:11:19,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-29 23:11:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:19,833 INFO L225 Difference]: With dead ends: 1319 [2018-01-29 23:11:19,833 INFO L226 Difference]: Without dead ends: 867 [2018-01-29 23:11:19,837 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:11:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-01-29 23:11:19,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 831. [2018-01-29 23:11:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-01-29 23:11:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1067 transitions. [2018-01-29 23:11:19,873 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1067 transitions. Word has length 32 [2018-01-29 23:11:19,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:19,873 INFO L432 AbstractCegarLoop]: Abstraction has 831 states and 1067 transitions. [2018-01-29 23:11:19,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:11:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1067 transitions. [2018-01-29 23:11:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 23:11:19,875 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:19,875 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:19,875 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2104755951, now seen corresponding path program 1 times [2018-01-29 23:11:19,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:19,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:19,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:19,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:19,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:19,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:19,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:19,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:11:19,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:11:19,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:11:19,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:11:19,962 INFO L87 Difference]: Start difference. First operand 831 states and 1067 transitions. Second operand 6 states. [2018-01-29 23:11:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:20,293 INFO L93 Difference]: Finished difference Result 2337 states and 3003 transitions. [2018-01-29 23:11:20,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:11:20,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-29 23:11:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:20,414 INFO L225 Difference]: With dead ends: 2337 [2018-01-29 23:11:20,414 INFO L226 Difference]: Without dead ends: 1521 [2018-01-29 23:11:20,418 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:11:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2018-01-29 23:11:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1481. [2018-01-29 23:11:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2018-01-29 23:11:20,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1849 transitions. [2018-01-29 23:11:20,487 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1849 transitions. Word has length 34 [2018-01-29 23:11:20,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:20,488 INFO L432 AbstractCegarLoop]: Abstraction has 1481 states and 1849 transitions. [2018-01-29 23:11:20,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:11:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1849 transitions. [2018-01-29 23:11:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:11:20,491 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:20,492 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:20,492 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:20,492 INFO L82 PathProgramCache]: Analyzing trace with hash -571407759, now seen corresponding path program 1 times [2018-01-29 23:11:20,492 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:20,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:20,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:20,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:20,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:20,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:20,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:11:20,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:11:20,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:11:20,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:11:20,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:11:20,575 INFO L87 Difference]: Start difference. First operand 1481 states and 1849 transitions. Second operand 6 states. [2018-01-29 23:11:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:20,790 INFO L93 Difference]: Finished difference Result 3447 states and 4346 transitions. [2018-01-29 23:11:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:11:20,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-29 23:11:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:20,804 INFO L225 Difference]: With dead ends: 3447 [2018-01-29 23:11:20,804 INFO L226 Difference]: Without dead ends: 1981 [2018-01-29 23:11:20,808 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:11:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2018-01-29 23:11:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1903. [2018-01-29 23:11:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2018-01-29 23:11:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2364 transitions. [2018-01-29 23:11:20,922 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2364 transitions. Word has length 47 [2018-01-29 23:11:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:20,922 INFO L432 AbstractCegarLoop]: Abstraction has 1903 states and 2364 transitions. [2018-01-29 23:11:20,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:11:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2364 transitions. [2018-01-29 23:11:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 23:11:20,924 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:20,924 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:20,925 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1689985345, now seen corresponding path program 1 times [2018-01-29 23:11:20,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:20,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:20,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:20,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:20,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:20,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:21,096 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:21,096 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:21,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:21,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:21,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:21,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-01-29 23:11:21,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:11:21,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:11:21,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:11:21,299 INFO L87 Difference]: Start difference. First operand 1903 states and 2364 transitions. Second operand 8 states. [2018-01-29 23:11:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:22,239 INFO L93 Difference]: Finished difference Result 4809 states and 6012 transitions. [2018-01-29 23:11:22,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:11:22,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-01-29 23:11:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:22,249 INFO L225 Difference]: With dead ends: 4809 [2018-01-29 23:11:22,250 INFO L226 Difference]: Without dead ends: 2921 [2018-01-29 23:11:22,254 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:11:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-01-29 23:11:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2767. [2018-01-29 23:11:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2767 states. [2018-01-29 23:11:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2767 states to 2767 states and 3414 transitions. [2018-01-29 23:11:22,351 INFO L78 Accepts]: Start accepts. Automaton has 2767 states and 3414 transitions. Word has length 51 [2018-01-29 23:11:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:22,351 INFO L432 AbstractCegarLoop]: Abstraction has 2767 states and 3414 transitions. [2018-01-29 23:11:22,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:11:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2767 states and 3414 transitions. [2018-01-29 23:11:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:11:22,354 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:22,354 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:22,354 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:22,354 INFO L82 PathProgramCache]: Analyzing trace with hash 388728054, now seen corresponding path program 1 times [2018-01-29 23:11:22,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:22,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:22,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:22,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:22,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:22,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:22,709 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 21 DAG size of output 16 [2018-01-29 23:11:22,820 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 19 DAG size of output 14 [2018-01-29 23:11:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:22,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:22,892 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:22,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:22,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:23,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:11:23,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2018-01-29 23:11:23,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:11:23,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:11:23,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:11:23,156 INFO L87 Difference]: Start difference. First operand 2767 states and 3414 transitions. Second operand 14 states. [2018-01-29 23:11:23,807 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 15 DAG size of output 12 [2018-01-29 23:11:25,433 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 14 DAG size of output 11 [2018-01-29 23:11:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:26,376 INFO L93 Difference]: Finished difference Result 4494 states and 5487 transitions. [2018-01-29 23:11:26,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:11:26,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2018-01-29 23:11:26,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:26,382 INFO L225 Difference]: With dead ends: 4494 [2018-01-29 23:11:26,382 INFO L226 Difference]: Without dead ends: 1598 [2018-01-29 23:11:26,387 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:11:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2018-01-29 23:11:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1486. [2018-01-29 23:11:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-01-29 23:11:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1808 transitions. [2018-01-29 23:11:26,438 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1808 transitions. Word has length 60 [2018-01-29 23:11:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:26,438 INFO L432 AbstractCegarLoop]: Abstraction has 1486 states and 1808 transitions. [2018-01-29 23:11:26,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:11:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1808 transitions. [2018-01-29 23:11:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:11:26,440 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:26,440 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:26,440 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:26,441 INFO L82 PathProgramCache]: Analyzing trace with hash 2073582792, now seen corresponding path program 1 times [2018-01-29 23:11:26,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:26,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:26,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:26,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:26,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:26,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:26,741 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 21 DAG size of output 17 [2018-01-29 23:11:26,812 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:26,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:26,813 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:26,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:26,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:27,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:27,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-01-29 23:11:27,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:11:27,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:11:27,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:11:27,080 INFO L87 Difference]: Start difference. First operand 1486 states and 1808 transitions. Second operand 16 states. [2018-01-29 23:11:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:28,355 INFO L93 Difference]: Finished difference Result 4820 states and 5973 transitions. [2018-01-29 23:11:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-29 23:11:28,356 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2018-01-29 23:11:28,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:28,368 INFO L225 Difference]: With dead ends: 4820 [2018-01-29 23:11:28,368 INFO L226 Difference]: Without dead ends: 3349 [2018-01-29 23:11:28,372 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=385, Invalid=1595, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:11:28,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2018-01-29 23:11:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 2580. [2018-01-29 23:11:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2580 states. [2018-01-29 23:11:28,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3129 transitions. [2018-01-29 23:11:28,483 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3129 transitions. Word has length 60 [2018-01-29 23:11:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:28,483 INFO L432 AbstractCegarLoop]: Abstraction has 2580 states and 3129 transitions. [2018-01-29 23:11:28,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:11:28,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3129 transitions. [2018-01-29 23:11:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-29 23:11:28,485 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:28,486 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:28,486 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:28,486 INFO L82 PathProgramCache]: Analyzing trace with hash -282283255, now seen corresponding path program 1 times [2018-01-29 23:11:28,486 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:28,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:28,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:28,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:28,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:28,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:28,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:28,721 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:28,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:28,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-01-29 23:11:28,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:11:28,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-01-29 23:11:28,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:11:28,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:11:28,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:11:28,942 INFO L87 Difference]: Start difference. First operand 2580 states and 3129 transitions. Second operand 12 states. [2018-01-29 23:11:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:30,405 INFO L93 Difference]: Finished difference Result 9491 states and 11650 transitions. [2018-01-29 23:11:30,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-29 23:11:30,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-01-29 23:11:30,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:30,441 INFO L225 Difference]: With dead ends: 9491 [2018-01-29 23:11:30,441 INFO L226 Difference]: Without dead ends: 6926 [2018-01-29 23:11:30,450 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=440, Invalid=1816, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 23:11:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2018-01-29 23:11:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 6132. [2018-01-29 23:11:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states. [2018-01-29 23:11:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 7432 transitions. [2018-01-29 23:11:30,770 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 7432 transitions. Word has length 70 [2018-01-29 23:11:30,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:30,771 INFO L432 AbstractCegarLoop]: Abstraction has 6132 states and 7432 transitions. [2018-01-29 23:11:30,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:11:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 7432 transitions. [2018-01-29 23:11:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 23:11:30,774 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:30,774 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:30,774 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash -178621021, now seen corresponding path program 1 times [2018-01-29 23:11:30,774 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:30,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:30,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:30,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:30,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:30,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:30,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:30,992 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:31,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:31,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:31,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:31,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-01-29 23:11:31,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:11:31,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:11:31,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:11:31,138 INFO L87 Difference]: Start difference. First operand 6132 states and 7432 transitions. Second operand 13 states. [2018-01-29 23:11:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:31,665 INFO L93 Difference]: Finished difference Result 11638 states and 14076 transitions. [2018-01-29 23:11:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:11:31,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2018-01-29 23:11:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:31,731 INFO L225 Difference]: With dead ends: 11638 [2018-01-29 23:11:31,732 INFO L226 Difference]: Without dead ends: 6246 [2018-01-29 23:11:31,748 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:11:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2018-01-29 23:11:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6054. [2018-01-29 23:11:31,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6054 states. [2018-01-29 23:11:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6054 states to 6054 states and 7328 transitions. [2018-01-29 23:11:31,992 INFO L78 Accepts]: Start accepts. Automaton has 6054 states and 7328 transitions. Word has length 76 [2018-01-29 23:11:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:31,992 INFO L432 AbstractCegarLoop]: Abstraction has 6054 states and 7328 transitions. [2018-01-29 23:11:31,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:11:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 6054 states and 7328 transitions. [2018-01-29 23:11:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-29 23:11:31,995 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:31,996 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:31,996 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash 860849516, now seen corresponding path program 1 times [2018-01-29 23:11:31,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:31,996 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:31,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:31,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:31,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:32,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:32,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:32,183 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:32,199 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:32,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:11:32,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:32,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2018-01-29 23:11:32,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:11:32,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:11:32,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:11:32,323 INFO L87 Difference]: Start difference. First operand 6054 states and 7328 transitions. Second operand 13 states. [2018-01-29 23:11:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:33,057 INFO L93 Difference]: Finished difference Result 13463 states and 16947 transitions. [2018-01-29 23:11:33,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:11:33,059 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-01-29 23:11:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:33,091 INFO L225 Difference]: With dead ends: 13463 [2018-01-29 23:11:33,091 INFO L226 Difference]: Without dead ends: 8227 [2018-01-29 23:11:33,101 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:11:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8227 states. [2018-01-29 23:11:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8227 to 5190. [2018-01-29 23:11:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states. [2018-01-29 23:11:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6254 transitions. [2018-01-29 23:11:33,281 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6254 transitions. Word has length 77 [2018-01-29 23:11:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:33,281 INFO L432 AbstractCegarLoop]: Abstraction has 5190 states and 6254 transitions. [2018-01-29 23:11:33,282 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:11:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6254 transitions. [2018-01-29 23:11:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-29 23:11:33,284 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:33,284 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:33,285 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1860818894, now seen corresponding path program 1 times [2018-01-29 23:11:33,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:33,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:33,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:33,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:33,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:33,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:11:33,730 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:33,730 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:33,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:33,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:33,966 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:11:34,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:34,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:11:34,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:11:34,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:11:34,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:11:34,005 INFO L87 Difference]: Start difference. First operand 5190 states and 6254 transitions. Second operand 14 states. [2018-01-29 23:11:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:34,608 INFO L93 Difference]: Finished difference Result 10676 states and 12938 transitions. [2018-01-29 23:11:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:11:34,613 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-01-29 23:11:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:34,638 INFO L225 Difference]: With dead ends: 10676 [2018-01-29 23:11:34,638 INFO L226 Difference]: Without dead ends: 6304 [2018-01-29 23:11:34,650 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 97 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-29 23:11:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2018-01-29 23:11:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6132. [2018-01-29 23:11:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states. [2018-01-29 23:11:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 7466 transitions. [2018-01-29 23:11:34,928 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 7466 transitions. Word has length 95 [2018-01-29 23:11:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:34,929 INFO L432 AbstractCegarLoop]: Abstraction has 6132 states and 7466 transitions. [2018-01-29 23:11:34,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:11:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 7466 transitions. [2018-01-29 23:11:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-29 23:11:34,934 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:34,934 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:34,934 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 541278865, now seen corresponding path program 1 times [2018-01-29 23:11:34,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:34,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:34,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:34,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:34,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:34,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 42 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-29 23:11:35,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:35,097 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:35,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:35,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:11:35,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:35,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-01-29 23:11:35,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:11:35,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:11:35,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:11:35,391 INFO L87 Difference]: Start difference. First operand 6132 states and 7466 transitions. Second operand 13 states. [2018-01-29 23:11:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:36,292 INFO L93 Difference]: Finished difference Result 11566 states and 14072 transitions. [2018-01-29 23:11:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:11:36,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2018-01-29 23:11:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:36,309 INFO L225 Difference]: With dead ends: 11566 [2018-01-29 23:11:36,310 INFO L226 Difference]: Without dead ends: 6002 [2018-01-29 23:11:36,319 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-01-29 23:11:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2018-01-29 23:11:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 5934. [2018-01-29 23:11:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states. [2018-01-29 23:11:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 7164 transitions. [2018-01-29 23:11:36,481 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 7164 transitions. Word has length 97 [2018-01-29 23:11:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:36,482 INFO L432 AbstractCegarLoop]: Abstraction has 5934 states and 7164 transitions. [2018-01-29 23:11:36,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:11:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 7164 transitions. [2018-01-29 23:11:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-29 23:11:36,484 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:36,484 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:36,484 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2070725107, now seen corresponding path program 1 times [2018-01-29 23:11:36,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:36,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:36,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:36,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:36,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:36,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:36,657 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:11:36,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:36,657 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:36,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:36,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-29 23:11:36,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:36,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-29 23:11:36,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:11:36,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:11:36,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:11:36,821 INFO L87 Difference]: Start difference. First operand 5934 states and 7164 transitions. Second operand 11 states. [2018-01-29 23:11:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:37,831 INFO L93 Difference]: Finished difference Result 15340 states and 19444 transitions. [2018-01-29 23:11:37,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:11:37,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-01-29 23:11:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:37,860 INFO L225 Difference]: With dead ends: 15340 [2018-01-29 23:11:37,860 INFO L226 Difference]: Without dead ends: 9271 [2018-01-29 23:11:37,876 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:11:37,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9271 states. [2018-01-29 23:11:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9271 to 6970. [2018-01-29 23:11:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6970 states. [2018-01-29 23:11:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6970 states to 6970 states and 8340 transitions. [2018-01-29 23:11:38,247 INFO L78 Accepts]: Start accepts. Automaton has 6970 states and 8340 transitions. Word has length 100 [2018-01-29 23:11:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:38,248 INFO L432 AbstractCegarLoop]: Abstraction has 6970 states and 8340 transitions. [2018-01-29 23:11:38,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:11:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6970 states and 8340 transitions. [2018-01-29 23:11:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-29 23:11:38,251 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:38,251 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:38,251 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1941483643, now seen corresponding path program 1 times [2018-01-29 23:11:38,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:38,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:38,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:38,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:38,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:38,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:11:38,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:38,552 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:38,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:38,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 23:11:38,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:38,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-29 23:11:38,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:11:38,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:11:38,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:11:38,840 INFO L87 Difference]: Start difference. First operand 6970 states and 8340 transitions. Second operand 21 states. [2018-01-29 23:11:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:40,380 INFO L93 Difference]: Finished difference Result 16310 states and 19818 transitions. [2018-01-29 23:11:40,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:11:40,380 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2018-01-29 23:11:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:40,403 INFO L225 Difference]: With dead ends: 16310 [2018-01-29 23:11:40,403 INFO L226 Difference]: Without dead ends: 10242 [2018-01-29 23:11:40,417 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=479, Invalid=1873, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:11:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states. [2018-01-29 23:11:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 8714. [2018-01-29 23:11:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8714 states. [2018-01-29 23:11:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8714 states to 8714 states and 10346 transitions. [2018-01-29 23:11:40,807 INFO L78 Accepts]: Start accepts. Automaton has 8714 states and 10346 transitions. Word has length 104 [2018-01-29 23:11:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:40,808 INFO L432 AbstractCegarLoop]: Abstraction has 8714 states and 10346 transitions. [2018-01-29 23:11:40,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:11:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8714 states and 10346 transitions. [2018-01-29 23:11:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-29 23:11:40,811 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:40,811 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:40,811 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1714577854, now seen corresponding path program 2 times [2018-01-29 23:11:40,812 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:40,812 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:40,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:40,813 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:40,813 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:40,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 78 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-29 23:11:41,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:41,015 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:41,021 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:11:41,068 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:11:41,088 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:11:41,092 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:11:41,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-01-29 23:11:41,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:41,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-01-29 23:11:41,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:11:41,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:11:41,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:11:41,147 INFO L87 Difference]: Start difference. First operand 8714 states and 10346 transitions. Second operand 12 states. [2018-01-29 23:11:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:41,757 INFO L93 Difference]: Finished difference Result 14736 states and 18066 transitions. [2018-01-29 23:11:41,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:11:41,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-01-29 23:11:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:41,810 INFO L225 Difference]: With dead ends: 14736 [2018-01-29 23:11:41,810 INFO L226 Difference]: Without dead ends: 5989 [2018-01-29 23:11:41,824 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2018-01-29 23:11:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2018-01-29 23:11:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 4466. [2018-01-29 23:11:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2018-01-29 23:11:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 5250 transitions. [2018-01-29 23:11:42,225 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 5250 transitions. Word has length 109 [2018-01-29 23:11:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:42,225 INFO L432 AbstractCegarLoop]: Abstraction has 4466 states and 5250 transitions. [2018-01-29 23:11:42,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:11:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 5250 transitions. [2018-01-29 23:11:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-01-29 23:11:42,229 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:42,229 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:42,230 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1206879794, now seen corresponding path program 1 times [2018-01-29 23:11:42,230 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:42,230 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:42,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:42,231 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:11:42,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:42,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:42,599 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 8 [2018-01-29 23:11:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 114 proven. 27 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:11:43,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:43,017 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:43,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:43,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 148 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:11:43,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:43,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:11:43,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:11:43,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:11:43,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:11:43,285 INFO L87 Difference]: Start difference. First operand 4466 states and 5250 transitions. Second operand 14 states. [2018-01-29 23:11:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:44,194 INFO L93 Difference]: Finished difference Result 10039 states and 11912 transitions. [2018-01-29 23:11:44,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 23:11:44,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 137 [2018-01-29 23:11:44,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:44,202 INFO L225 Difference]: With dead ends: 10039 [2018-01-29 23:11:44,202 INFO L226 Difference]: Without dead ends: 5561 [2018-01-29 23:11:44,208 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=761, Unknown=0, NotChecked=0, Total=992 [2018-01-29 23:11:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2018-01-29 23:11:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 5369. [2018-01-29 23:11:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5369 states. [2018-01-29 23:11:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 6333 transitions. [2018-01-29 23:11:44,406 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 6333 transitions. Word has length 137 [2018-01-29 23:11:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:44,406 INFO L432 AbstractCegarLoop]: Abstraction has 5369 states and 6333 transitions. [2018-01-29 23:11:44,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:11:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 6333 transitions. [2018-01-29 23:11:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-01-29 23:11:44,409 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:44,409 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:44,409 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1460314129, now seen corresponding path program 1 times [2018-01-29 23:11:44,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:44,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:44,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:44,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:44,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:44,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-01-29 23:11:44,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:44,749 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-29 23:11:44,756 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-29 23:11:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:44,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 106 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-01-29 23:11:45,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:45,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:11:45,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:11:45,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:11:45,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:11:45,066 INFO L87 Difference]: Start difference. First operand 5369 states and 6333 transitions. Second operand 14 states. [2018-01-29 23:11:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:46,118 INFO L93 Difference]: Finished difference Result 12247 states and 14629 transitions. [2018-01-29 23:11:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-29 23:11:46,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 139 [2018-01-29 23:11:46,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:46,136 INFO L225 Difference]: With dead ends: 12247 [2018-01-29 23:11:46,136 INFO L226 Difference]: Without dead ends: 6965 [2018-01-29 23:11:46,144 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:11:46,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2018-01-29 23:11:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 5222. [2018-01-29 23:11:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2018-01-29 23:11:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 6176 transitions. [2018-01-29 23:11:46,456 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 6176 transitions. Word has length 139 [2018-01-29 23:11:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:46,456 INFO L432 AbstractCegarLoop]: Abstraction has 5222 states and 6176 transitions. [2018-01-29 23:11:46,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:11:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 6176 transitions. [2018-01-29 23:11:46,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-29 23:11:46,460 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:46,460 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:46,460 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:46,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1639651694, now seen corresponding path program 1 times [2018-01-29 23:11:46,461 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:46,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:46,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:46,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:46,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:46,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 66 proven. 84 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-29 23:11:46,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:46,739 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:46,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:46,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 152 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-01-29 23:11:46,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:46,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-01-29 23:11:46,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:11:46,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:11:46,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:11:46,976 INFO L87 Difference]: Start difference. First operand 5222 states and 6176 transitions. Second operand 18 states. [2018-01-29 23:11:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:48,869 INFO L93 Difference]: Finished difference Result 16641 states and 19954 transitions. [2018-01-29 23:11:48,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-29 23:11:48,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-01-29 23:11:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:48,885 INFO L225 Difference]: With dead ends: 16641 [2018-01-29 23:11:48,885 INFO L226 Difference]: Without dead ends: 11551 [2018-01-29 23:11:48,893 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=807, Invalid=4305, Unknown=0, NotChecked=0, Total=5112 [2018-01-29 23:11:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11551 states. [2018-01-29 23:11:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11551 to 10320. [2018-01-29 23:11:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10320 states. [2018-01-29 23:11:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10320 states to 10320 states and 12333 transitions. [2018-01-29 23:11:49,378 INFO L78 Accepts]: Start accepts. Automaton has 10320 states and 12333 transitions. Word has length 142 [2018-01-29 23:11:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:49,379 INFO L432 AbstractCegarLoop]: Abstraction has 10320 states and 12333 transitions. [2018-01-29 23:11:49,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:11:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 10320 states and 12333 transitions. [2018-01-29 23:11:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-29 23:11:49,381 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:49,381 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-01-29 23:11:49,382 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash -699019322, now seen corresponding path program 1 times [2018-01-29 23:11:49,382 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:49,382 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:49,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:49,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:49,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:49,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 118 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-01-29 23:11:49,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:49,650 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:49,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:49,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-01-29 23:11:49,902 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:49,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-01-29 23:11:49,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:11:49,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:11:49,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:11:49,903 INFO L87 Difference]: Start difference. First operand 10320 states and 12333 transitions. Second operand 20 states. [2018-01-29 23:11:55,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:55,542 INFO L93 Difference]: Finished difference Result 31774 states and 38391 transitions. [2018-01-29 23:11:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-01-29 23:11:55,543 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 160 [2018-01-29 23:11:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:55,576 INFO L225 Difference]: With dead ends: 31774 [2018-01-29 23:11:55,577 INFO L226 Difference]: Without dead ends: 21586 [2018-01-29 23:11:55,594 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6484 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2281, Invalid=15809, Unknown=0, NotChecked=0, Total=18090 [2018-01-29 23:11:55,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21586 states. [2018-01-29 23:11:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21586 to 20969. [2018-01-29 23:11:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20969 states. [2018-01-29 23:11:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 25238 transitions. [2018-01-29 23:11:56,511 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 25238 transitions. Word has length 160 [2018-01-29 23:11:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:11:56,512 INFO L432 AbstractCegarLoop]: Abstraction has 20969 states and 25238 transitions. [2018-01-29 23:11:56,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:11:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 25238 transitions. [2018-01-29 23:11:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-01-29 23:11:56,516 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:11:56,517 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:11:56,517 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:11:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash 122404954, now seen corresponding path program 1 times [2018-01-29 23:11:56,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:11:56,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:11:56,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:56,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:56,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:11:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:56,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:11:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 162 proven. 12 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-01-29 23:11:56,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:11:56,937 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:11:56,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:11:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:11:57,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:11:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 156 proven. 34 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-01-29 23:11:57,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:11:57,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-01-29 23:11:57,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:11:57,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:11:57,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:11:57,346 INFO L87 Difference]: Start difference. First operand 20969 states and 25238 transitions. Second operand 22 states. [2018-01-29 23:11:59,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:11:59,517 INFO L93 Difference]: Finished difference Result 49022 states and 59150 transitions. [2018-01-29 23:11:59,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:11:59,518 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 165 [2018-01-29 23:11:59,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:11:59,669 INFO L225 Difference]: With dead ends: 49022 [2018-01-29 23:11:59,669 INFO L226 Difference]: Without dead ends: 28262 [2018-01-29 23:11:59,688 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=479, Invalid=1971, Unknown=0, NotChecked=0, Total=2450 [2018-01-29 23:11:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28262 states. [2018-01-29 23:12:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28262 to 22589. [2018-01-29 23:12:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22589 states. [2018-01-29 23:12:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22589 states to 22589 states and 26568 transitions. [2018-01-29 23:12:00,750 INFO L78 Accepts]: Start accepts. Automaton has 22589 states and 26568 transitions. Word has length 165 [2018-01-29 23:12:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:00,751 INFO L432 AbstractCegarLoop]: Abstraction has 22589 states and 26568 transitions. [2018-01-29 23:12:00,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:12:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22589 states and 26568 transitions. [2018-01-29 23:12:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-01-29 23:12:00,754 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:00,754 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 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] [2018-01-29 23:12:00,754 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash -194336044, now seen corresponding path program 1 times [2018-01-29 23:12:00,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:00,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:00,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:00,755 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:00,755 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:00,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 144 proven. 34 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-01-29 23:12:01,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:12:01,026 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:12:01,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:01,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:12:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 158 proven. 28 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-29 23:12:01,301 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:12:01,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-29 23:12:01,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:12:01,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:12:01,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:12:01,302 INFO L87 Difference]: Start difference. First operand 22589 states and 26568 transitions. Second operand 21 states. [2018-01-29 23:12:03,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:03,715 INFO L93 Difference]: Finished difference Result 47310 states and 55639 transitions. [2018-01-29 23:12:03,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 23:12:03,716 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 169 [2018-01-29 23:12:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:03,768 INFO L225 Difference]: With dead ends: 47310 [2018-01-29 23:12:03,768 INFO L226 Difference]: Without dead ends: 24586 [2018-01-29 23:12:03,789 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=463, Invalid=1889, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 23:12:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24586 states. [2018-01-29 23:12:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24586 to 24391. [2018-01-29 23:12:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24391 states. [2018-01-29 23:12:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24391 states to 24391 states and 28419 transitions. [2018-01-29 23:12:04,917 INFO L78 Accepts]: Start accepts. Automaton has 24391 states and 28419 transitions. Word has length 169 [2018-01-29 23:12:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:04,918 INFO L432 AbstractCegarLoop]: Abstraction has 24391 states and 28419 transitions. [2018-01-29 23:12:04,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:12:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24391 states and 28419 transitions. [2018-01-29 23:12:04,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-01-29 23:12:04,920 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:04,921 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2018-01-29 23:12:04,921 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:04,921 INFO L82 PathProgramCache]: Analyzing trace with hash -315863401, now seen corresponding path program 1 times [2018-01-29 23:12:04,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:04,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:04,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:04,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:04,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:04,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 80 proven. 146 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-29 23:12:05,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:12:05,497 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:12:05,504 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:05,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:12:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 86 proven. 140 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-29 23:12:06,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:12:06,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-29 23:12:06,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:12:06,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:12:06,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:12:06,380 INFO L87 Difference]: Start difference. First operand 24391 states and 28419 transitions. Second operand 20 states. [2018-01-29 23:12:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:12,019 INFO L93 Difference]: Finished difference Result 35017 states and 40933 transitions. [2018-01-29 23:12:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 23:12:12,020 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 181 [2018-01-29 23:12:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:12,071 INFO L225 Difference]: With dead ends: 35017 [2018-01-29 23:12:12,071 INFO L226 Difference]: Without dead ends: 35014 [2018-01-29 23:12:12,083 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 185 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=530, Invalid=2226, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 23:12:12,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35014 states. [2018-01-29 23:12:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35014 to 34483. [2018-01-29 23:12:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34483 states. [2018-01-29 23:12:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34483 states to 34483 states and 40107 transitions. [2018-01-29 23:12:13,789 INFO L78 Accepts]: Start accepts. Automaton has 34483 states and 40107 transitions. Word has length 181 [2018-01-29 23:12:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:13,789 INFO L432 AbstractCegarLoop]: Abstraction has 34483 states and 40107 transitions. [2018-01-29 23:12:13,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:12:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34483 states and 40107 transitions. [2018-01-29 23:12:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-01-29 23:12:13,794 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:13,795 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:12:13,795 INFO L371 AbstractCegarLoop]: === Iteration 28 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash 236158871, now seen corresponding path program 1 times [2018-01-29 23:12:13,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:13,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:13,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:13,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:13,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:13,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2018-01-29 23:12:13,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:12:13,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:12:13,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:12:13,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:12:13,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:12:13,975 INFO L87 Difference]: Start difference. First operand 34483 states and 40107 transitions. Second operand 7 states. [2018-01-29 23:12:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:15,570 INFO L93 Difference]: Finished difference Result 70151 states and 82160 transitions. [2018-01-29 23:12:15,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:12:15,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 225 [2018-01-29 23:12:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:15,632 INFO L225 Difference]: With dead ends: 70151 [2018-01-29 23:12:15,632 INFO L226 Difference]: Without dead ends: 37696 [2018-01-29 23:12:15,671 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:12:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37696 states. [2018-01-29 23:12:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37696 to 37261. [2018-01-29 23:12:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37261 states. [2018-01-29 23:12:17,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37261 states to 37261 states and 43239 transitions. [2018-01-29 23:12:17,582 INFO L78 Accepts]: Start accepts. Automaton has 37261 states and 43239 transitions. Word has length 225 [2018-01-29 23:12:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:17,582 INFO L432 AbstractCegarLoop]: Abstraction has 37261 states and 43239 transitions. [2018-01-29 23:12:17,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:12:17,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37261 states and 43239 transitions. [2018-01-29 23:12:17,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-01-29 23:12:17,591 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:17,592 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2018-01-29 23:12:17,592 INFO L371 AbstractCegarLoop]: === Iteration 29 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:17,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1551282745, now seen corresponding path program 2 times [2018-01-29 23:12:17,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:17,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:17,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:17,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:17,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:17,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-01-29 23:12:17,821 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:12:17,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:12:17,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:12:17,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:12:17,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:12:17,823 INFO L87 Difference]: Start difference. First operand 37261 states and 43239 transitions. Second operand 7 states. [2018-01-29 23:12:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:19,644 INFO L93 Difference]: Finished difference Result 74763 states and 87354 transitions. [2018-01-29 23:12:19,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:12:19,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 244 [2018-01-29 23:12:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:19,708 INFO L225 Difference]: With dead ends: 74763 [2018-01-29 23:12:19,708 INFO L226 Difference]: Without dead ends: 39530 [2018-01-29 23:12:19,740 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:12:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39530 states. [2018-01-29 23:12:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39530 to 37243. [2018-01-29 23:12:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37243 states. [2018-01-29 23:12:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37243 states to 37243 states and 43209 transitions. [2018-01-29 23:12:21,402 INFO L78 Accepts]: Start accepts. Automaton has 37243 states and 43209 transitions. Word has length 244 [2018-01-29 23:12:21,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:21,403 INFO L432 AbstractCegarLoop]: Abstraction has 37243 states and 43209 transitions. [2018-01-29 23:12:21,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:12:21,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37243 states and 43209 transitions. [2018-01-29 23:12:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-01-29 23:12:21,410 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:21,410 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:12:21,410 INFO L371 AbstractCegarLoop]: === Iteration 30 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:21,410 INFO L82 PathProgramCache]: Analyzing trace with hash -966030029, now seen corresponding path program 1 times [2018-01-29 23:12:21,410 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:21,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:21,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:21,411 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:12:21,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:21,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 144 proven. 304 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-01-29 23:12:22,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:12:22,039 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:12:22,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:22,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:12:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 219 proven. 6 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-01-29 23:12:22,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:12:22,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-01-29 23:12:22,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:12:22,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:12:22,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:12:22,335 INFO L87 Difference]: Start difference. First operand 37243 states and 43209 transitions. Second operand 21 states. [2018-01-29 23:12:34,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:34,400 INFO L93 Difference]: Finished difference Result 88602 states and 106407 transitions. [2018-01-29 23:12:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2018-01-29 23:12:34,401 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 245 [2018-01-29 23:12:34,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:34,532 INFO L225 Difference]: With dead ends: 88602 [2018-01-29 23:12:34,532 INFO L226 Difference]: Without dead ends: 52649 [2018-01-29 23:12:34,582 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31289 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6022, Invalid=67690, Unknown=0, NotChecked=0, Total=73712 [2018-01-29 23:12:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52649 states. [2018-01-29 23:12:38,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52649 to 48307. [2018-01-29 23:12:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48307 states. [2018-01-29 23:12:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48307 states to 48307 states and 58135 transitions. [2018-01-29 23:12:38,697 INFO L78 Accepts]: Start accepts. Automaton has 48307 states and 58135 transitions. Word has length 245 [2018-01-29 23:12:38,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:38,698 INFO L432 AbstractCegarLoop]: Abstraction has 48307 states and 58135 transitions. [2018-01-29 23:12:38,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:12:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 48307 states and 58135 transitions. [2018-01-29 23:12:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-01-29 23:12:38,712 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:38,712 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:12:38,712 INFO L371 AbstractCegarLoop]: === Iteration 31 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:38,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2081673946, now seen corresponding path program 1 times [2018-01-29 23:12:38,713 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:38,713 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:38,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:38,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:38,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:38,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 178 proven. 11 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-01-29 23:12:39,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:12:39,073 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:12:39,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:39,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:12:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 178 proven. 11 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-01-29 23:12:39,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:12:39,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-01-29 23:12:39,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:12:39,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:12:39,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:12:39,369 INFO L87 Difference]: Start difference. First operand 48307 states and 58135 transitions. Second operand 14 states. [2018-01-29 23:12:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:42,276 INFO L93 Difference]: Finished difference Result 81735 states and 99033 transitions. [2018-01-29 23:12:42,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:12:42,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 272 [2018-01-29 23:12:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:42,401 INFO L225 Difference]: With dead ends: 81735 [2018-01-29 23:12:42,401 INFO L226 Difference]: Without dead ends: 37535 [2018-01-29 23:12:42,474 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:12:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37535 states. [2018-01-29 23:12:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37535 to 36588. [2018-01-29 23:12:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36588 states. [2018-01-29 23:12:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36588 states to 36588 states and 43772 transitions. [2018-01-29 23:12:45,137 INFO L78 Accepts]: Start accepts. Automaton has 36588 states and 43772 transitions. Word has length 272 [2018-01-29 23:12:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:45,137 INFO L432 AbstractCegarLoop]: Abstraction has 36588 states and 43772 transitions. [2018-01-29 23:12:45,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:12:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36588 states and 43772 transitions. [2018-01-29 23:12:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-01-29 23:12:45,149 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:45,150 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:12:45,150 INFO L371 AbstractCegarLoop]: === Iteration 32 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1963442467, now seen corresponding path program 1 times [2018-01-29 23:12:45,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:45,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:45,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:45,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:45,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:45,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 183 proven. 5 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-01-29 23:12:45,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:12:45,375 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:12:45,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:45,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:12:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 177 proven. 11 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2018-01-29 23:12:45,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:12:45,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2018-01-29 23:12:45,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 23:12:45,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 23:12:45,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:12:45,583 INFO L87 Difference]: Start difference. First operand 36588 states and 43772 transitions. Second operand 14 states. [2018-01-29 23:12:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:48,335 INFO L93 Difference]: Finished difference Result 65926 states and 79647 transitions. [2018-01-29 23:12:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-29 23:12:48,336 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 274 [2018-01-29 23:12:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:48,412 INFO L225 Difference]: With dead ends: 65926 [2018-01-29 23:12:48,412 INFO L226 Difference]: Without dead ends: 38187 [2018-01-29 23:12:48,454 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=836, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:12:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38187 states. [2018-01-29 23:12:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38187 to 32985. [2018-01-29 23:12:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32985 states. [2018-01-29 23:12:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32985 states to 32985 states and 39423 transitions. [2018-01-29 23:12:50,577 INFO L78 Accepts]: Start accepts. Automaton has 32985 states and 39423 transitions. Word has length 274 [2018-01-29 23:12:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:50,577 INFO L432 AbstractCegarLoop]: Abstraction has 32985 states and 39423 transitions. [2018-01-29 23:12:50,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 23:12:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32985 states and 39423 transitions. [2018-01-29 23:12:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-01-29 23:12:50,588 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:50,588 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:12:50,588 INFO L371 AbstractCegarLoop]: === Iteration 33 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash 27492152, now seen corresponding path program 1 times [2018-01-29 23:12:50,588 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:50,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:50,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:50,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:50,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:50,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 220 proven. 336 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-29 23:12:50,868 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:12:50,868 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:12:50,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:50,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:12:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 230 proven. 326 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-29 23:12:51,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:12:51,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-01-29 23:12:51,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:12:51,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:12:51,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:12:51,350 INFO L87 Difference]: Start difference. First operand 32985 states and 39423 transitions. Second operand 18 states. [2018-01-29 23:12:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:12:56,286 INFO L93 Difference]: Finished difference Result 34405 states and 41127 transitions. [2018-01-29 23:12:56,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-01-29 23:12:56,287 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 277 [2018-01-29 23:12:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:12:56,354 INFO L225 Difference]: With dead ends: 34405 [2018-01-29 23:12:56,354 INFO L226 Difference]: Without dead ends: 34403 [2018-01-29 23:12:56,371 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 299 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=974, Invalid=4576, Unknown=0, NotChecked=0, Total=5550 [2018-01-29 23:12:56,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34403 states. [2018-01-29 23:12:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34403 to 32987. [2018-01-29 23:12:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32987 states. [2018-01-29 23:12:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32987 states to 32987 states and 39427 transitions. [2018-01-29 23:12:58,387 INFO L78 Accepts]: Start accepts. Automaton has 32987 states and 39427 transitions. Word has length 277 [2018-01-29 23:12:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:12:58,387 INFO L432 AbstractCegarLoop]: Abstraction has 32987 states and 39427 transitions. [2018-01-29 23:12:58,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:12:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32987 states and 39427 transitions. [2018-01-29 23:12:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-01-29 23:12:58,396 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:12:58,397 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 10, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:12:58,397 INFO L371 AbstractCegarLoop]: === Iteration 34 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-01-29 23:12:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash 27492153, now seen corresponding path program 1 times [2018-01-29 23:12:58,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:12:58,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:12:58,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:58,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:58,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:12:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:58,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:12:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 116 proven. 402 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-01-29 23:12:59,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:12:59,062 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:12:59,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:12:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:12:59,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:12:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 128 proven. 390 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2018-01-29 23:12:59,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:12:59,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2018-01-29 23:12:59,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 23:12:59,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 23:12:59,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:12:59,658 INFO L87 Difference]: Start difference. First operand 32987 states and 39427 transitions. Second operand 26 states. Received shutdown request... [2018-01-29 23:13:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-29 23:13:02,360 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:13:02,365 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:13:02,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:13:02 BoogieIcfgContainer [2018-01-29 23:13:02,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:13:02,367 INFO L168 Benchmark]: Toolchain (without parser) took 105507.26 ms. Allocated memory was 305.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 265.2 MB in the beginning and 308.1 MB in the end (delta: -43.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-01-29 23:13:02,367 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:13:02,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.87 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 253.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:13:02,368 INFO L168 Benchmark]: Boogie Preprocessor took 42.75 ms. Allocated memory is still 305.1 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:13:02,368 INFO L168 Benchmark]: RCFGBuilder took 663.14 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 221.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. [2018-01-29 23:13:02,369 INFO L168 Benchmark]: TraceAbstraction took 104538.81 ms. Allocated memory was 305.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 221.5 MB in the beginning and 308.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-01-29 23:13:02,370 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.12 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.87 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 253.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.75 ms. Allocated memory is still 305.1 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 663.14 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 221.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 104538.81 ms. Allocated memory was 305.1 MB in the beginning and 2.4 GB in the end (delta: 2.1 GB). Free memory was 221.5 MB in the beginning and 308.1 MB in the end (delta: -86.7 MB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (32987states) and interpolant automaton (currently 30 states, 26 states before enhancement), while ReachableStatesComputation was computing reachable states (3973 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 19 error locations. TIMEOUT Result, 104.4s OverallTime, 34 OverallIterations, 12 TraceHistogramMax, 64.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6657 SDtfs, 19729 SDslu, 22271 SDs, 0 SdLazy, 40382 SolverSat, 4171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4878 GetRequests, 3600 SyntacticMatches, 56 SemanticMatches, 1222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46814 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48307occurred in iteration=30, 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: 23.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 35696 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 7416 NumberOfCodeBlocks, 7416 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 7359 ConstructedInterpolants, 142 QuantifiedInterpolants, 4536516 SizeOfPredicates, 133 NumberOfNonLiveVariables, 13675 ConjunctsInSsa, 471 ConjunctsInUnsatCore, 57 InterpolantComputations, 13 PerfectInterpolantSequences, 10218/12881 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-13-02-379.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-13-02-379.csv Completed graceful shutdown