java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:07:37,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:07:37,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:07:37,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:07:37,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:07:37,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:07:37,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:07:37,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:07:37,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:07:37,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:07:37,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:07:37,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:07:37,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:07:37,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:07:37,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:07:37,701 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:07:37,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:07:37,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:07:37,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:07:37,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:07:37,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:07:37,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:07:37,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:07:37,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:07:37,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:07:37,710 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:07:37,710 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:07:37,710 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:07:37,711 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:07:37,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:07:37,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:07:37,711 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:07:37,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:07:37,721 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:07:37,721 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:07:37,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:07:37,722 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:07:37,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:07:37,722 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:07:37,722 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:07:37,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:07:37,722 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:07:37,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:07:37,723 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:07:37,723 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:07:37,723 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:07:37,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:07:37,723 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:07:37,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:07:37,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:07:37,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:07:37,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:07:37,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:07:37,724 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:07:37,724 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:07:37,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:07:37,725 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:07:37,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:07:37,764 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:07:37,768 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:07:37,769 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:07:37,769 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:07:37,770 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-02-04 04:07:37,902 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:07:37,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:07:37,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:07:37,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:07:37,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:07:37,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:07:37" (1/1) ... [2018-02-04 04:07:37,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a9abb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:37, skipping insertion in model container [2018-02-04 04:07:37,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:07:37" (1/1) ... [2018-02-04 04:07:37,922 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:07:37,951 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:07:38,034 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:07:38,047 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:07:38,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38 WrapperNode [2018-02-04 04:07:38,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:07:38,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:07:38,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:07:38,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:07:38,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... [2018-02-04 04:07:38,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... [2018-02-04 04:07:38,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... [2018-02-04 04:07:38,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... [2018-02-04 04:07:38,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... [2018-02-04 04:07:38,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... [2018-02-04 04:07:38,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... [2018-02-04 04:07:38,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:07:38,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:07:38,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:07:38,082 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:07:38,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:07:38,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:07:38,117 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:07:38,117 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 04:07:38,117 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 04:07:38,117 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:07:38,117 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:07:38,118 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:07:38,118 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:07:38,118 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 04:07:38,118 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 04:07:38,118 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:07:38,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:07:38,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:07:38,350 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:07:38,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:07:38 BoogieIcfgContainer [2018-02-04 04:07:38,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:07:38,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:07:38,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:07:38,353 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:07:38,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:07:37" (1/3) ... [2018-02-04 04:07:38,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e281a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:07:38, skipping insertion in model container [2018-02-04 04:07:38,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:38" (2/3) ... [2018-02-04 04:07:38,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e281a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:07:38, skipping insertion in model container [2018-02-04 04:07:38,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:07:38" (3/3) ... [2018-02-04 04:07:38,355 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-02-04 04:07:38,361 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:07:38,366 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 04:07:38,399 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:07:38,399 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:07:38,399 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:07:38,400 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:07:38,400 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:07:38,400 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:07:38,400 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:07:38,400 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:07:38,401 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:07:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 04:07:38,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 04:07:38,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:38,425 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:38,425 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:38,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 04:07:38,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:38,432 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:38,477 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,477 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:38,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:38,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:38,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:38,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:38,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:07:38,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 04:07:38,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 04:07:38,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:07:38,591 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 04:07:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:38,684 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 04:07:38,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 04:07:38,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 04:07:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:38,695 INFO L225 Difference]: With dead ends: 76 [2018-02-04 04:07:38,696 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 04:07:38,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:07:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 04:07:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 04:07:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 04:07:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 04:07:38,720 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 04:07:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:38,720 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 04:07:38,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 04:07:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 04:07:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:07:38,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:38,721 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:38,721 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 04:07:38,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:38,722 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:38,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,723 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:38,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:38,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:38,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:38,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:38,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:07:38,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:07:38,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:38,765 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 04:07:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:38,808 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 04:07:38,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:07:38,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 04:07:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:38,812 INFO L225 Difference]: With dead ends: 74 [2018-02-04 04:07:38,812 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 04:07:38,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 04:07:38,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 04:07:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 04:07:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 04:07:38,819 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 04:07:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:38,820 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 04:07:38,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:07:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 04:07:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:07:38,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:38,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:38,821 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:38,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 04:07:38,821 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:38,821 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:38,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,822 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:38,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:38,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:38,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:38,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:38,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:38,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:07:38,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:07:38,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:38,893 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 04:07:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:38,928 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 04:07:38,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:07:38,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 04:07:38,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:38,929 INFO L225 Difference]: With dead ends: 132 [2018-02-04 04:07:38,929 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 04:07:38,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 04:07:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 04:07:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 04:07:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 04:07:38,937 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 04:07:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:38,937 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 04:07:38,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:07:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 04:07:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 04:07:38,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:38,938 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:38,938 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:38,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 04:07:38,938 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:38,938 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:38,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,939 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:38,939 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:38,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:38,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:38,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:07:38,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:07:38,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:07:38,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:38,963 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 04:07:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:39,029 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 04:07:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:07:39,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 04:07:39,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:39,030 INFO L225 Difference]: With dead ends: 147 [2018-02-04 04:07:39,030 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 04:07:39,031 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 04:07:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 04:07:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 04:07:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 04:07:39,041 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 04:07:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:39,041 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 04:07:39,041 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:07:39,041 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 04:07:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 04:07:39,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:39,042 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:39,042 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:39,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 04:07:39,042 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:39,042 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:39,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,043 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:39,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:39,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:07:39,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:07:39,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:07:39,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:39,093 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 04:07:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:39,160 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 04:07:39,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:07:39,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 04:07:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:39,163 INFO L225 Difference]: With dead ends: 255 [2018-02-04 04:07:39,163 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 04:07:39,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:07:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 04:07:39,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 04:07:39,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 04:07:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 04:07:39,179 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 04:07:39,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:39,179 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 04:07:39,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:07:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 04:07:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:07:39,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:39,180 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:39,180 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 04:07:39,180 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:39,180 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:39,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:39,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:39,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:39,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:07:39,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:07:39,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:07:39,215 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 04:07:39,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:39,292 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 04:07:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:07:39,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 04:07:39,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:39,295 INFO L225 Difference]: With dead ends: 386 [2018-02-04 04:07:39,295 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 04:07:39,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:39,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 04:07:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 04:07:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 04:07:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 04:07:39,313 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 04:07:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:39,313 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 04:07:39,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:07:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 04:07:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:07:39,314 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:39,314 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:39,314 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 04:07:39,314 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:39,314 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:39,315 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,315 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,316 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:39,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:39,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:39,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:07:39,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:07:39,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:07:39,354 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 04:07:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:39,438 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 04:07:39,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:07:39,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 04:07:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:39,441 INFO L225 Difference]: With dead ends: 485 [2018-02-04 04:07:39,442 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 04:07:39,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 04:07:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 04:07:39,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 04:07:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 04:07:39,460 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 04:07:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:39,461 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 04:07:39,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:07:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 04:07:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:07:39,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:39,461 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:39,462 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:39,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 04:07:39,462 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:39,462 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:39,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,463 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:39,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:39,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:07:39,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:07:39,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:07:39,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:39,510 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 04:07:39,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:39,559 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 04:07:39,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:07:39,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 04:07:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:39,564 INFO L225 Difference]: With dead ends: 861 [2018-02-04 04:07:39,565 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 04:07:39,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:07:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 04:07:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 04:07:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 04:07:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 04:07:39,590 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 04:07:39,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:39,590 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 04:07:39,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:07:39,591 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 04:07:39,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:07:39,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:39,592 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:39,592 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:39,592 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 04:07:39,592 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:39,592 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:39,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:39,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:39,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:39,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:39,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:39,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:07:39,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:07:39,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:07:39,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:07:39,742 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 04:07:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:39,827 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 04:07:39,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:07:39,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 04:07:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:39,833 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 04:07:39,833 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 04:07:39,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:07:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 04:07:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 04:07:39,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 04:07:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 04:07:39,869 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 04:07:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:39,870 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 04:07:39,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:07:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 04:07:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:07:39,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:39,871 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:39,871 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:39,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 04:07:39,871 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:39,872 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:39,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,872 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,872 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:39,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:39,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:39,944 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:39,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:40,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:40,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:07:40,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-02-04 04:07:40,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:07:40,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:07:40,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:07:40,003 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 11 states. [2018-02-04 04:07:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:40,497 INFO L93 Difference]: Finished difference Result 2826 states and 4553 transitions. [2018-02-04 04:07:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:07:40,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-02-04 04:07:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:40,508 INFO L225 Difference]: With dead ends: 2826 [2018-02-04 04:07:40,508 INFO L226 Difference]: Without dead ends: 2826 [2018-02-04 04:07:40,508 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=265, Invalid=925, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 04:07:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-02-04 04:07:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2276. [2018-02-04 04:07:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2276 states. [2018-02-04 04:07:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3403 transitions. [2018-02-04 04:07:40,595 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3403 transitions. Word has length 27 [2018-02-04 04:07:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:40,595 INFO L432 AbstractCegarLoop]: Abstraction has 2276 states and 3403 transitions. [2018-02-04 04:07:40,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:07:40,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3403 transitions. [2018-02-04 04:07:40,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:07:40,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:40,597 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:40,597 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:40,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 04:07:40,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:40,597 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:40,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:40,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:40,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:40,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:40,666 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:40,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:07:40,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:07:40,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:07:40,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:07:40,667 INFO L87 Difference]: Start difference. First operand 2276 states and 3403 transitions. Second operand 7 states. [2018-02-04 04:07:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:40,829 INFO L93 Difference]: Finished difference Result 1061 states and 1323 transitions. [2018-02-04 04:07:40,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:07:40,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 04:07:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:40,833 INFO L225 Difference]: With dead ends: 1061 [2018-02-04 04:07:40,833 INFO L226 Difference]: Without dead ends: 845 [2018-02-04 04:07:40,833 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:07:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2018-02-04 04:07:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 748. [2018-02-04 04:07:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-02-04 04:07:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 988 transitions. [2018-02-04 04:07:40,853 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 988 transitions. Word has length 31 [2018-02-04 04:07:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:40,854 INFO L432 AbstractCegarLoop]: Abstraction has 748 states and 988 transitions. [2018-02-04 04:07:40,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:07:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 988 transitions. [2018-02-04 04:07:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:07:40,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:40,855 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:40,855 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 04:07:40,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:40,855 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:40,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:40,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:40,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:40,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:40,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:40,990 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:40,991 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:41,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:41,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:07:41,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 04:07:41,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:07:41,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:07:41,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:07:41,068 INFO L87 Difference]: Start difference. First operand 748 states and 988 transitions. Second operand 12 states. [2018-02-04 04:07:41,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:41,758 INFO L93 Difference]: Finished difference Result 1376 states and 1800 transitions. [2018-02-04 04:07:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:07:41,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 04:07:41,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:41,764 INFO L225 Difference]: With dead ends: 1376 [2018-02-04 04:07:41,764 INFO L226 Difference]: Without dead ends: 1370 [2018-02-04 04:07:41,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:07:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-02-04 04:07:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1040. [2018-02-04 04:07:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2018-02-04 04:07:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1372 transitions. [2018-02-04 04:07:41,792 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1372 transitions. Word has length 31 [2018-02-04 04:07:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:41,793 INFO L432 AbstractCegarLoop]: Abstraction has 1040 states and 1372 transitions. [2018-02-04 04:07:41,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:07:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1372 transitions. [2018-02-04 04:07:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 04:07:41,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:41,794 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:41,794 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 04:07:41,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:41,794 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:41,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:41,795 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:41,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:41,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:41,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:41,878 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:41,879 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:41,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 04:07:41,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:07:41,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-04 04:07:41,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:07:41,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:07:41,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:07:41,930 INFO L87 Difference]: Start difference. First operand 1040 states and 1372 transitions. Second operand 10 states. [2018-02-04 04:07:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:42,435 INFO L93 Difference]: Finished difference Result 2596 states and 3391 transitions. [2018-02-04 04:07:42,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:07:42,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 04:07:42,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:42,444 INFO L225 Difference]: With dead ends: 2596 [2018-02-04 04:07:42,444 INFO L226 Difference]: Without dead ends: 2596 [2018-02-04 04:07:42,445 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:07:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2596 states. [2018-02-04 04:07:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2596 to 2209. [2018-02-04 04:07:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2209 states. [2018-02-04 04:07:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2909 transitions. [2018-02-04 04:07:42,518 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 2909 transitions. Word has length 38 [2018-02-04 04:07:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:42,518 INFO L432 AbstractCegarLoop]: Abstraction has 2209 states and 2909 transitions. [2018-02-04 04:07:42,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:07:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2909 transitions. [2018-02-04 04:07:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:07:42,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:42,519 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:42,519 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:42,519 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 04:07:42,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:42,520 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:42,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:42,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:42,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:42,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 04:07:42,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:42,615 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:42,616 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:42,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:42,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:42,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2018-02-04 04:07:42,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 04:07:42,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 04:07:42,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:07:42,689 INFO L87 Difference]: Start difference. First operand 2209 states and 2909 transitions. Second operand 14 states. [2018-02-04 04:07:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:43,385 INFO L93 Difference]: Finished difference Result 4674 states and 6633 transitions. [2018-02-04 04:07:43,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 04:07:43,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-02-04 04:07:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:43,407 INFO L225 Difference]: With dead ends: 4674 [2018-02-04 04:07:43,407 INFO L226 Difference]: Without dead ends: 4674 [2018-02-04 04:07:43,408 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=1377, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 04:07:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2018-02-04 04:07:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 3089. [2018-02-04 04:07:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-02-04 04:07:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 4113 transitions. [2018-02-04 04:07:43,507 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 4113 transitions. Word has length 42 [2018-02-04 04:07:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:43,507 INFO L432 AbstractCegarLoop]: Abstraction has 3089 states and 4113 transitions. [2018-02-04 04:07:43,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 04:07:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 4113 transitions. [2018-02-04 04:07:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:07:43,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:43,508 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:43,508 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1922656245, now seen corresponding path program 1 times [2018-02-04 04:07:43,509 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:43,509 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:43,509 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:43,509 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:43,510 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:43,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:07:43,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:43,646 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:43,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:43,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:43,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:43,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-02-04 04:07:43,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:07:43,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:07:43,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:07:43,722 INFO L87 Difference]: Start difference. First operand 3089 states and 4113 transitions. Second operand 13 states. [2018-02-04 04:07:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:44,495 INFO L93 Difference]: Finished difference Result 2517 states and 3288 transitions. [2018-02-04 04:07:44,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:07:44,495 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 04:07:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:44,502 INFO L225 Difference]: With dead ends: 2517 [2018-02-04 04:07:44,502 INFO L226 Difference]: Without dead ends: 2457 [2018-02-04 04:07:44,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:07:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2018-02-04 04:07:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2285. [2018-02-04 04:07:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2285 states. [2018-02-04 04:07:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3005 transitions. [2018-02-04 04:07:44,575 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3005 transitions. Word has length 43 [2018-02-04 04:07:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:44,575 INFO L432 AbstractCegarLoop]: Abstraction has 2285 states and 3005 transitions. [2018-02-04 04:07:44,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:07:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3005 transitions. [2018-02-04 04:07:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 04:07:44,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:44,577 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:44,577 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 04:07:44,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:44,578 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:44,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:44,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:44,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:44,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:07:44,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:44,651 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:44,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:44,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:07:44,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:44,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 04:07:44,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:07:44,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:07:44,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:07:44,711 INFO L87 Difference]: Start difference. First operand 2285 states and 3005 transitions. Second operand 11 states. [2018-02-04 04:07:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:44,933 INFO L93 Difference]: Finished difference Result 3038 states and 4173 transitions. [2018-02-04 04:07:44,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:07:44,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-04 04:07:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:44,940 INFO L225 Difference]: With dead ends: 3038 [2018-02-04 04:07:44,940 INFO L226 Difference]: Without dead ends: 3038 [2018-02-04 04:07:44,940 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:07:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2018-02-04 04:07:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2375. [2018-02-04 04:07:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2375 states. [2018-02-04 04:07:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 3139 transitions. [2018-02-04 04:07:44,978 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 3139 transitions. Word has length 54 [2018-02-04 04:07:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:44,979 INFO L432 AbstractCegarLoop]: Abstraction has 2375 states and 3139 transitions. [2018-02-04 04:07:44,979 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:07:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 3139 transitions. [2018-02-04 04:07:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 04:07:44,979 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:44,979 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:44,980 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 04:07:44,980 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:44,980 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:44,980 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:44,980 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:44,980 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:44,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:07:45,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:45,033 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:45,033 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:45,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:07:45,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:45,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-04 04:07:45,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:07:45,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:07:45,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:07:45,111 INFO L87 Difference]: Start difference. First operand 2375 states and 3139 transitions. Second operand 15 states. [2018-02-04 04:07:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:45,507 INFO L93 Difference]: Finished difference Result 4079 states and 5699 transitions. [2018-02-04 04:07:45,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:07:45,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-04 04:07:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:45,528 INFO L225 Difference]: With dead ends: 4079 [2018-02-04 04:07:45,528 INFO L226 Difference]: Without dead ends: 3987 [2018-02-04 04:07:45,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:07:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2018-02-04 04:07:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3310. [2018-02-04 04:07:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2018-02-04 04:07:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4399 transitions. [2018-02-04 04:07:45,636 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4399 transitions. Word has length 54 [2018-02-04 04:07:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:45,637 INFO L432 AbstractCegarLoop]: Abstraction has 3310 states and 4399 transitions. [2018-02-04 04:07:45,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:07:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4399 transitions. [2018-02-04 04:07:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 04:07:45,638 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:45,638 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:45,638 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:45,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-04 04:07:45,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:45,639 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:45,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:45,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:45,640 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:45,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 04:07:45,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:45,723 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:45,723 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:45,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 04:07:45,789 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:45,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 04:07:45,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:07:45,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:07:45,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:07:45,790 INFO L87 Difference]: Start difference. First operand 3310 states and 4399 transitions. Second operand 11 states. [2018-02-04 04:07:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:45,953 INFO L93 Difference]: Finished difference Result 3981 states and 5400 transitions. [2018-02-04 04:07:45,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:07:45,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 04:07:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:45,961 INFO L225 Difference]: With dead ends: 3981 [2018-02-04 04:07:45,961 INFO L226 Difference]: Without dead ends: 3981 [2018-02-04 04:07:45,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:07:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2018-02-04 04:07:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3929. [2018-02-04 04:07:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2018-02-04 04:07:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 5350 transitions. [2018-02-04 04:07:46,011 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 5350 transitions. Word has length 68 [2018-02-04 04:07:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:46,011 INFO L432 AbstractCegarLoop]: Abstraction has 3929 states and 5350 transitions. [2018-02-04 04:07:46,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:07:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 5350 transitions. [2018-02-04 04:07:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 04:07:46,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:46,013 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:46,013 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:46,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-04 04:07:46,013 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:46,013 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:46,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:46,014 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:46,014 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:46,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 04:07:46,144 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:46,144 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:46,145 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:46,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 04:07:46,291 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:46,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-04 04:07:46,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:07:46,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:07:46,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:07:46,292 INFO L87 Difference]: Start difference. First operand 3929 states and 5350 transitions. Second operand 18 states. [2018-02-04 04:07:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:47,165 INFO L93 Difference]: Finished difference Result 6913 states and 9588 transitions. [2018-02-04 04:07:47,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:07:47,166 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-04 04:07:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:47,180 INFO L225 Difference]: With dead ends: 6913 [2018-02-04 04:07:47,181 INFO L226 Difference]: Without dead ends: 6787 [2018-02-04 04:07:47,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:07:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2018-02-04 04:07:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 5218. [2018-02-04 04:07:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2018-02-04 04:07:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6929 transitions. [2018-02-04 04:07:47,309 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6929 transitions. Word has length 70 [2018-02-04 04:07:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:47,310 INFO L432 AbstractCegarLoop]: Abstraction has 5218 states and 6929 transitions. [2018-02-04 04:07:47,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:07:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6929 transitions. [2018-02-04 04:07:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 04:07:47,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:47,312 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:47,312 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-04 04:07:47,313 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:47,313 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:47,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:47,313 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:47,314 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:47,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 04:07:47,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:47,474 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:47,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:47,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-04 04:07:47,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:47,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 04:07:47,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:07:47,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:07:47,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:07:47,585 INFO L87 Difference]: Start difference. First operand 5218 states and 6929 transitions. Second operand 17 states. [2018-02-04 04:07:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:48,101 INFO L93 Difference]: Finished difference Result 6770 states and 9242 transitions. [2018-02-04 04:07:48,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:07:48,101 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-04 04:07:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:48,116 INFO L225 Difference]: With dead ends: 6770 [2018-02-04 04:07:48,116 INFO L226 Difference]: Without dead ends: 6592 [2018-02-04 04:07:48,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:07:48,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2018-02-04 04:07:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 5105. [2018-02-04 04:07:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2018-02-04 04:07:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 6680 transitions. [2018-02-04 04:07:48,202 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 6680 transitions. Word has length 84 [2018-02-04 04:07:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:48,203 INFO L432 AbstractCegarLoop]: Abstraction has 5105 states and 6680 transitions. [2018-02-04 04:07:48,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:07:48,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 6680 transitions. [2018-02-04 04:07:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:07:48,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:48,204 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:48,204 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-04 04:07:48,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:48,204 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:48,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:48,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:48,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:48,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-02-04 04:07:48,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:48,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:48,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:48,377 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 04:07:48,488 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:48,488 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-02-04 04:07:48,489 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:07:48,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:07:48,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:07:48,489 INFO L87 Difference]: Start difference. First operand 5105 states and 6680 transitions. Second operand 18 states. [2018-02-04 04:07:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:49,227 INFO L93 Difference]: Finished difference Result 7254 states and 9512 transitions. [2018-02-04 04:07:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 04:07:49,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-04 04:07:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:49,239 INFO L225 Difference]: With dead ends: 7254 [2018-02-04 04:07:49,239 INFO L226 Difference]: Without dead ends: 7128 [2018-02-04 04:07:49,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 04:07:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7128 states. [2018-02-04 04:07:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7128 to 6942. [2018-02-04 04:07:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6942 states. [2018-02-04 04:07:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6942 states to 6942 states and 9218 transitions. [2018-02-04 04:07:49,319 INFO L78 Accepts]: Start accepts. Automaton has 6942 states and 9218 transitions. Word has length 87 [2018-02-04 04:07:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:49,320 INFO L432 AbstractCegarLoop]: Abstraction has 6942 states and 9218 transitions. [2018-02-04 04:07:49,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:07:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6942 states and 9218 transitions. [2018-02-04 04:07:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-04 04:07:49,322 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:49,322 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:49,322 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:49,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1756447406, now seen corresponding path program 1 times [2018-02-04 04:07:49,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:49,322 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:49,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:49,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:49,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 04:07:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 04:07:49,381 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 04:07:49,420 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 04:07:49,428 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,429 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,430 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,431 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,432 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,434 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,436 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,438 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,439 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,440 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,441 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,442 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:07:49,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:07:49 BoogieIcfgContainer [2018-02-04 04:07:49,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:07:49,453 INFO L168 Benchmark]: Toolchain (without parser) took 11550.43 ms. Allocated memory was 404.8 MB in the beginning and 925.9 MB in the end (delta: 521.1 MB). Free memory was 361.6 MB in the beginning and 662.4 MB in the end (delta: -300.8 MB). Peak memory consumption was 220.4 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:49,454 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:07:49,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.09 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 351.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:49,454 INFO L168 Benchmark]: Boogie Preprocessor took 28.66 ms. Allocated memory is still 404.8 MB. Free memory was 351.1 MB in the beginning and 348.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:49,455 INFO L168 Benchmark]: RCFGBuilder took 269.34 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 321.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:49,455 INFO L168 Benchmark]: TraceAbstraction took 11101.41 ms. Allocated memory was 404.8 MB in the beginning and 925.9 MB in the end (delta: 521.1 MB). Free memory was 321.1 MB in the beginning and 662.4 MB in the end (delta: -341.3 MB). Peak memory consumption was 179.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:07:49,456 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.13 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.09 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 351.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.66 ms. Allocated memory is still 404.8 MB. Free memory was 351.1 MB in the beginning and 348.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 269.34 ms. Allocated memory is still 404.8 MB. Free memory was 348.4 MB in the beginning and 321.1 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11101.41 ms. Allocated memory was 404.8 MB in the beginning and 925.9 MB in the end (delta: 521.1 MB). Free memory was 321.1 MB in the beginning and 662.4 MB in the end (delta: -341.3 MB). Peak memory consumption was 179.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. UNSAFE Result, 11.0s OverallTime, 22 OverallIterations, 7 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2127 SDtfs, 4839 SDslu, 4706 SDs, 0 SdLazy, 6576 SolverSat, 1164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 689 SyntacticMatches, 7 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6942occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 7965 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1355 ConstructedInterpolants, 0 QuantifiedInterpolants, 193324 SizeOfPredicates, 47 NumberOfNonLiveVariables, 5028 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 33 InterpolantComputations, 12 PerfectInterpolantSequences, 1072/1263 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-07-49-462.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-07-49-462.csv Received shutdown request...