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_Array.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:07:16,830 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:07:16,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:07:16,840 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:07:16,840 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:07:16,841 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:07:16,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:07:16,843 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:07:16,844 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:07:16,845 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:07:16,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:07:16,846 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:07:16,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:07:16,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:07:16,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:07:16,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:07:16,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:07:16,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:07:16,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:07:16,855 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:07:16,857 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:07:16,857 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:07:16,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:07:16,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:07:16,859 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:07:16,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:07:16,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:07:16,861 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:07:16,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:07:16,861 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:07:16,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:07:16,861 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_Array.epf [2018-02-04 02:07:16,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:07:16,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:07:16,872 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:07:16,872 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:07:16,872 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:07:16,872 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:07:16,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:07:16,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:07:16,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:07:16,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:07:16,873 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:07:16,873 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:07:16,874 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:07:16,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:07:16,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:07:16,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:07:16,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:07:16,910 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:07:16,912 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:07:16,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:07:16,913 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:07:16,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-02-04 02:07:17,045 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:07:17,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:07:17,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:07:17,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:07:17,051 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:07:17,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,053 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 02:07:17, skipping insertion in model container [2018-02-04 02:07:17,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,063 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:07:17,093 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:07:17,184 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:07:17,200 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:07:17,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17 WrapperNode [2018-02-04 02:07:17,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:07:17,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:07:17,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:07:17,208 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:07:17,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,232 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (1/1) ... [2018-02-04 02:07:17,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:07:17,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:07:17,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:07:17,240 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:07:17,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (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 02:07:17,276 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:07:17,277 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:07:17,277 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 02:07:17,277 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 02:07:17,277 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:07:17,277 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:07:17,277 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:07:17,278 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:07:17,278 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:07:17,278 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:07:17,278 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:07:17,278 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:07:17,278 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:07:17,278 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:07:17,279 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:07:17,279 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 02:07:17,279 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 02:07:17,279 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:07:17,279 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:07:17,279 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:07:17,517 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:07:17,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:07:17 BoogieIcfgContainer [2018-02-04 02:07:17,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:07:17,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:07:17,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:07:17,519 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:07:17,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:07:17" (1/3) ... [2018-02-04 02:07:17,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70687db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:07:17, skipping insertion in model container [2018-02-04 02:07:17,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:17" (2/3) ... [2018-02-04 02:07:17,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70687db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:07:17, skipping insertion in model container [2018-02-04 02:07:17,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:07:17" (3/3) ... [2018-02-04 02:07:17,521 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-02-04 02:07:17,526 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:07:17,531 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 02:07:17,552 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:07:17,552 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:07:17,552 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:07:17,552 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:07:17,552 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:07:17,552 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:07:17,552 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:07:17,553 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:07:17,553 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:07:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 02:07:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 02:07:17,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:17,573 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:17,573 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 02:07:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 02:07:17,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:17,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:17,696 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 02:07:17,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:17,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:07:17,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:17,699 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 02:07:17,700 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 79#true] [2018-02-04 02:07:17,700 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 02:07:17,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:07:17,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:07:17,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:07:17,713 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 02:07:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:17,799 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 02:07:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:07:17,800 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 02:07:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:17,810 INFO L225 Difference]: With dead ends: 76 [2018-02-04 02:07:17,810 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 02:07:17,811 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 02:07:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 02:07:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 02:07:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 02:07:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 02:07:17,840 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 02:07:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:17,840 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 02:07:17,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:07:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 02:07:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:07:17,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:17,841 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:17,841 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 02:07:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 02:07:17,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:17,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:17,895 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 02:07:17,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:17,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:07:17,896 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:17,896 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 02:07:17,896 INFO L182 omatonBuilderFactory]: Interpolants [230#true, 231#false, 232#|main_#t~short13|] [2018-02-04 02:07:17,896 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 02:07:17,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:07:17,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:07:17,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:07:17,898 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 02:07:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:17,911 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 02:07:17,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:07:17,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:07:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:17,913 INFO L225 Difference]: With dead ends: 74 [2018-02-04 02:07:17,913 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 02:07:17,914 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 02:07:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 02:07:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 02:07:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 02:07:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 02:07:17,920 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 02:07:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:17,920 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 02:07:17,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:07:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 02:07:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:07:17,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:17,921 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:17,921 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 02:07:17,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 02:07:17,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:17,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:17,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:17,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:17,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:07:17,991 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:17,991 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 02:07:17,991 INFO L182 omatonBuilderFactory]: Interpolants [381#true, 382#false, 383#(and (= 0 ~garbage.base) (= 0 ~garbage.offset))] [2018-02-04 02:07:17,991 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 02:07:17,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:07:17,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:07:17,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:07:17,992 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 02:07:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:18,013 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 02:07:18,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:07:18,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:07:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:18,014 INFO L225 Difference]: With dead ends: 132 [2018-02-04 02:07:18,014 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 02:07:18,015 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 02:07:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 02:07:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 02:07:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 02:07:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 02:07:18,024 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 02:07:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:18,024 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 02:07:18,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:07:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 02:07:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:07:18,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:18,025 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:18,025 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 02:07:18,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 02:07:18,026 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:18,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:18,056 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 02:07:18,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:18,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:07:18,056 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:18,056 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 02:07:18,056 INFO L182 omatonBuilderFactory]: Interpolants [630#true, 631#false, 632#(= |#valid| |old(#valid)|)] [2018-02-04 02:07:18,057 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 02:07:18,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:07:18,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:07:18,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:07:18,057 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 02:07:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:18,106 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 02:07:18,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:07:18,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 02:07:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:18,107 INFO L225 Difference]: With dead ends: 147 [2018-02-04 02:07:18,107 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 02:07:18,108 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 02:07:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 02:07:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 02:07:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 02:07:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 02:07:18,118 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 02:07:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:18,118 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 02:07:18,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:07:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 02:07:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 02:07:18,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:18,119 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:18,119 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 02:07:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 02:07:18,120 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:18,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:18,182 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 02:07:18,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:18,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:07:18,183 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:18,183 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 02:07:18,183 INFO L182 omatonBuilderFactory]: Interpolants [915#true, 916#false, 917#(<= ~pc1 1), 918#(<= |push_#t~post0| 1), 919#(not |push_#t~switch1|)] [2018-02-04 02:07:18,183 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 02:07:18,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:07:18,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:07:18,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:07:18,184 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 02:07:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:18,246 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 02:07:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:07:18,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 02:07:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:18,248 INFO L225 Difference]: With dead ends: 255 [2018-02-04 02:07:18,248 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 02:07:18,248 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 02:07:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 02:07:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 02:07:18,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 02:07:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 02:07:18,262 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 02:07:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:18,262 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 02:07:18,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:07:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 02:07:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:07:18,263 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:18,263 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:18,263 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 02:07:18,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 02:07:18,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:18,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:18,306 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 02:07:18,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:18,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:07:18,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:18,307 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 02:07:18,307 INFO L182 omatonBuilderFactory]: Interpolants [1403#true, 1404#false, 1405#(= 1 (select |#valid| |push_#t~malloc2.base|)), 1406#(= 1 (select |#valid| ~x1~0.base))] [2018-02-04 02:07:18,307 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 02:07:18,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:07:18,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:07:18,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:07:18,308 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 02:07:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:18,409 INFO L93 Difference]: Finished difference Result 388 states and 570 transitions. [2018-02-04 02:07:18,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:07:18,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:07:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:18,415 INFO L225 Difference]: With dead ends: 388 [2018-02-04 02:07:18,415 INFO L226 Difference]: Without dead ends: 388 [2018-02-04 02:07:18,416 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 02:07:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-04 02:07:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-02-04 02:07:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 02:07:18,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 02:07:18,435 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 02:07:18,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:18,435 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 02:07:18,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:07:18,436 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 02:07:18,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:07:18,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:18,436 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:18,436 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 02:07:18,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 02:07:18,437 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:18,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:18,490 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 02:07:18,490 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:18,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:07:18,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:18,491 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 02:07:18,491 INFO L182 omatonBuilderFactory]: Interpolants [2155#true, 2156#false, 2157#(and (= 8 (select |#length| |push_#t~malloc2.base|)) (= 0 |push_#t~malloc2.offset|)), 2158#(and (= (select |#length| ~x1~0.base) 8) (= ~x1~0.offset 0))] [2018-02-04 02:07:18,491 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 02:07:18,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:07:18,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:07:18,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:07:18,492 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 02:07:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:18,603 INFO L93 Difference]: Finished difference Result 487 states and 717 transitions. [2018-02-04 02:07:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:07:18,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:07:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:18,607 INFO L225 Difference]: With dead ends: 487 [2018-02-04 02:07:18,607 INFO L226 Difference]: Without dead ends: 487 [2018-02-04 02:07:18,607 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 02:07:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-04 02:07:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-02-04 02:07:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 02:07:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 02:07:18,622 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 02:07:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:18,622 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 02:07:18,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:07:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 02:07:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:07:18,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:18,623 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:18,623 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 02:07:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 02:07:18,624 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:18,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:18,662 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 02:07:18,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:18,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:07:18,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:18,662 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 02:07:18,662 INFO L182 omatonBuilderFactory]: Interpolants [3108#true, 3109#false, 3110#(<= ~pc4 1), 3111#(<= |pop_#t~post7| 1), 3112#(not |pop_#t~switch8|)] [2018-02-04 02:07:18,663 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 02:07:18,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:07:18,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:07:18,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:07:18,663 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 02:07:18,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:18,706 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 02:07:18,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:07:18,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 02:07:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:18,711 INFO L225 Difference]: With dead ends: 861 [2018-02-04 02:07:18,711 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 02:07:18,711 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 02:07:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 02:07:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 02:07:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 02:07:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 02:07:18,736 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 02:07:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:18,736 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 02:07:18,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:07:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 02:07:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 02:07:18,737 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:18,737 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 02:07:18,737 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 02:07:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 02:07:18,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:18,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:18,797 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 02:07:18,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:18,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:07:18,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:18,798 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 02:07:18,798 INFO L182 omatonBuilderFactory]: Interpolants [4804#true, 4805#false, 4806#(or (not |pop_#t~switch8|) (<= ~pc4 2)), 4807#(<= ~pc4 2), 4808#(<= |pop_#t~post7| 2), 4809#(not |pop_#t~switch8|)] [2018-02-04 02:07:18,798 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 02:07:18,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:07:18,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:07:18,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:07:18,799 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 02:07:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:18,883 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 02:07:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:07:18,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 02:07:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:18,889 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 02:07:18,889 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 02:07:18,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 02:07:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 02:07:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 02:07:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 02:07:18,923 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 02:07:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:18,924 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 02:07:18,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:07:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 02:07:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:07:18,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:18,925 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 02:07:18,925 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 02:07:18,926 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:18,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:19,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:19,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:07:19,021 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:19,022 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 02:07:19,022 INFO L182 omatonBuilderFactory]: Interpolants [7328#(or (not (= 1 ~pc4)) (not (= 1 ~pc1)) (not |main_#t~short13|)), 7329#(or (not (= 1 ~pc4)) (not (= 1 ~pc1))), 7330#(= |old(~pc1)| ~pc1), 7331#(or (= 1 |old(~pc1)|) (not |push_#t~switch1|)), 7332#(= 1 |old(~pc1)|), 7333#(not (= 1 ~pc4)), 7334#|main_#t~short13|, 7325#true, 7326#false, 7327#(and (= 0 ~S.base) (= 0 ~S.offset))] [2018-02-04 02:07:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:19,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:07:19,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:07:19,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:07:19,023 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 10 states. [2018-02-04 02:07:19,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:19,764 INFO L93 Difference]: Finished difference Result 4157 states and 6578 transitions. [2018-02-04 02:07:19,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:07:19,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 02:07:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:19,783 INFO L225 Difference]: With dead ends: 4157 [2018-02-04 02:07:19,784 INFO L226 Difference]: Without dead ends: 4157 [2018-02-04 02:07:19,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=1178, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:07:19,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2018-02-04 02:07:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 3278. [2018-02-04 02:07:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2018-02-04 02:07:19,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4768 transitions. [2018-02-04 02:07:19,898 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4768 transitions. Word has length 27 [2018-02-04 02:07:19,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:19,898 INFO L432 AbstractCegarLoop]: Abstraction has 3278 states and 4768 transitions. [2018-02-04 02:07:19,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:07:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4768 transitions. [2018-02-04 02:07:19,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:07:19,900 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:19,900 INFO L351 BasicCegarLoop]: trace histogram [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 02:07:19,900 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 02:07:19,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-02-04 02:07:19,901 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:19,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:19,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:19,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:19,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:19,982 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 02:07:19,982 INFO L182 omatonBuilderFactory]: Interpolants [14832#(and (<= 1 ~pc1) (= 1 ~pc4)), 14833#(= |old(~pc1)| ~pc1), 14834#(<= (+ |old(~pc1)| 1) ~pc1), 14835#(<= 2 ~pc1), 14836#|main_#t~short13|, 14828#true, 14829#false, 14830#(<= 1 ~pc4), 14831#(or (and (<= 1 ~pc1) (= 1 ~pc4)) |main_#t~short13|)] [2018-02-04 02:07:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:19,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:19,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:19,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:19,983 INFO L87 Difference]: Start difference. First operand 3278 states and 4768 transitions. Second operand 9 states. [2018-02-04 02:07:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:20,601 INFO L93 Difference]: Finished difference Result 8508 states and 13720 transitions. [2018-02-04 02:07:20,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 02:07:20,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-04 02:07:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:20,646 INFO L225 Difference]: With dead ends: 8508 [2018-02-04 02:07:20,646 INFO L226 Difference]: Without dead ends: 8508 [2018-02-04 02:07:20,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2018-02-04 02:07:20,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2018-02-04 02:07:20,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 6896. [2018-02-04 02:07:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2018-02-04 02:07:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 10048 transitions. [2018-02-04 02:07:20,878 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 10048 transitions. Word has length 27 [2018-02-04 02:07:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:20,878 INFO L432 AbstractCegarLoop]: Abstraction has 6896 states and 10048 transitions. [2018-02-04 02:07:20,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 10048 transitions. [2018-02-04 02:07:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:07:20,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:20,880 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 02:07:20,880 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 02:07:20,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 02:07:20,881 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:20,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:20,944 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 02:07:20,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:20,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:07:20,945 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:20,945 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 02:07:20,945 INFO L182 omatonBuilderFactory]: Interpolants [30288#(= 1 ~pc1), 30289#(= |old(~pc1)| ~pc1), 30290#(or (not (= |old(~pc1)| 1)) |push_#t~switch1|), 30291#(not (= |old(~pc1)| 1)), 30285#true, 30286#false, 30287#(and (= ~pc4 1) (= ~pc4 ~pc1))] [2018-02-04 02:07:20,945 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 02:07:20,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:07:20,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:07:20,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:07:20,946 INFO L87 Difference]: Start difference. First operand 6896 states and 10048 transitions. Second operand 7 states. [2018-02-04 02:07:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:21,110 INFO L93 Difference]: Finished difference Result 4168 states and 5475 transitions. [2018-02-04 02:07:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:07:21,111 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 02:07:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:21,126 INFO L225 Difference]: With dead ends: 4168 [2018-02-04 02:07:21,126 INFO L226 Difference]: Without dead ends: 3736 [2018-02-04 02:07:21,126 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 02:07:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2018-02-04 02:07:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3409. [2018-02-04 02:07:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2018-02-04 02:07:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4605 transitions. [2018-02-04 02:07:21,207 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4605 transitions. Word has length 31 [2018-02-04 02:07:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:21,208 INFO L432 AbstractCegarLoop]: Abstraction has 3409 states and 4605 transitions. [2018-02-04 02:07:21,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:07:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4605 transitions. [2018-02-04 02:07:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:07:21,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:21,209 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 02:07:21,209 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 02:07:21,209 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 02:07:21,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:21,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:21,332 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 02:07:21,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:21,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:07:21,332 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:21,332 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 02:07:21,332 INFO L182 omatonBuilderFactory]: Interpolants [37875#true, 37876#false, 37877#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 1 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 2))), 37878#(or (and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 1 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 2)) (not (= |pop_#t~post7| 2))) |pop_#t~switch8|), 37879#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 1 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 2)) (not (= |pop_#t~post7| 2))), 37880#(or (<= ~pc4 2) (<= 4 ~pc4)), 37881#(or (<= 4 |pop_#t~post7|) (<= |pop_#t~post7| 2)), 37882#(not |pop_#t~switch8|)] [2018-02-04 02:07:21,333 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 02:07:21,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:07:21,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:07:21,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:07:21,333 INFO L87 Difference]: Start difference. First operand 3409 states and 4605 transitions. Second operand 8 states. [2018-02-04 02:07:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:21,549 INFO L93 Difference]: Finished difference Result 4758 states and 6414 transitions. [2018-02-04 02:07:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:21,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 02:07:21,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:21,575 INFO L225 Difference]: With dead ends: 4758 [2018-02-04 02:07:21,576 INFO L226 Difference]: Without dead ends: 4758 [2018-02-04 02:07:21,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:07:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2018-02-04 02:07:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4673. [2018-02-04 02:07:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4673 states. [2018-02-04 02:07:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 6333 transitions. [2018-02-04 02:07:21,663 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 6333 transitions. Word has length 31 [2018-02-04 02:07:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:21,663 INFO L432 AbstractCegarLoop]: Abstraction has 4673 states and 6333 transitions. [2018-02-04 02:07:21,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:07:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 6333 transitions. [2018-02-04 02:07:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:07:21,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:21,664 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:21,664 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 02:07:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2106794323, now seen corresponding path program 1 times [2018-02-04 02:07:21,665 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:21,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:21,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:21,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:07:21,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:21,763 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 02:07:21,763 INFO L182 omatonBuilderFactory]: Interpolants [47328#true, 47329#false, 47330#(and (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 4)) (or (< 3 |pop_#t~post7|) (<= ~pc4 (+ |pop_#t~post7| 1)))), 47331#(or |pop_#t~switch8| (and (or (and (<= (+ |pop_#t~post7| 1) ~pc4) (not (= |pop_#t~post7| 4))) (<= |pop_#t~post7| 3)) (or (< 3 |pop_#t~post7|) (<= ~pc4 (+ |pop_#t~post7| 1))))), 47332#(or (<= ~pc4 4) (<= 6 ~pc4)), 47333#(or (<= 6 |pop_#t~post7|) (<= |pop_#t~post7| 4)), 47334#(not |pop_#t~switch8|)] [2018-02-04 02:07:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:21,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:07:21,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:07:21,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:07:21,764 INFO L87 Difference]: Start difference. First operand 4673 states and 6333 transitions. Second operand 7 states. [2018-02-04 02:07:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:22,039 INFO L93 Difference]: Finished difference Result 5922 states and 7990 transitions. [2018-02-04 02:07:22,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:07:22,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 02:07:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:22,055 INFO L225 Difference]: With dead ends: 5922 [2018-02-04 02:07:22,055 INFO L226 Difference]: Without dead ends: 5922 [2018-02-04 02:07:22,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:07:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2018-02-04 02:07:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 5825. [2018-02-04 02:07:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2018-02-04 02:07:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7893 transitions. [2018-02-04 02:07:22,141 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7893 transitions. Word has length 33 [2018-02-04 02:07:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:22,141 INFO L432 AbstractCegarLoop]: Abstraction has 5825 states and 7893 transitions. [2018-02-04 02:07:22,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:07:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7893 transitions. [2018-02-04 02:07:22,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:07:22,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:22,142 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 02:07:22,142 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 02:07:22,143 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 02:07:22,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:22,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:22,232 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 02:07:22,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:22,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:07:22,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:22,232 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 02:07:22,233 INFO L182 omatonBuilderFactory]: Interpolants [59096#true, 59097#false, 59098#(and (= 0 ~S.base) (= 0 ~S.offset)), 59099#(and (= ~S.offset |old(~S.offset)|) (= |old(~S.base)| ~S.base)), 59100#(and (= ~t4~0.offset |old(~S.offset)|) (= |old(~S.base)| ~t4~0.base)), 59101#(and (= 0 ~t4~0.base) (= 0 ~t4~0.offset)), 59102#(and (= ~t4~0.base |old(~t4~0.base)|) (= ~t4~0.offset |old(~t4~0.offset)|)), 59103#(or (not (= 0 |old(~t4~0.offset)|)) (not (= |old(~t4~0.base)| 0)))] [2018-02-04 02:07:22,233 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 02:07:22,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:07:22,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:07:22,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:07:22,233 INFO L87 Difference]: Start difference. First operand 5825 states and 7893 transitions. Second operand 8 states. [2018-02-04 02:07:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:22,569 INFO L93 Difference]: Finished difference Result 6688 states and 9145 transitions. [2018-02-04 02:07:22,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:07:22,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 02:07:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:22,610 INFO L225 Difference]: With dead ends: 6688 [2018-02-04 02:07:22,610 INFO L226 Difference]: Without dead ends: 6688 [2018-02-04 02:07:22,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2018-02-04 02:07:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 5773. [2018-02-04 02:07:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5773 states. [2018-02-04 02:07:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5773 states to 5773 states and 7730 transitions. [2018-02-04 02:07:22,703 INFO L78 Accepts]: Start accepts. Automaton has 5773 states and 7730 transitions. Word has length 38 [2018-02-04 02:07:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:22,703 INFO L432 AbstractCegarLoop]: Abstraction has 5773 states and 7730 transitions. [2018-02-04 02:07:22,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:07:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5773 states and 7730 transitions. [2018-02-04 02:07:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:07:22,704 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:22,705 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 02:07:22,705 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 02:07:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 02:07:22,705 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:22,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:22,797 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 02:07:22,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:22,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:07:22,797 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:22,797 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 02:07:22,798 INFO L182 omatonBuilderFactory]: Interpolants [71585#false, 71584#true, 71587#(or (and (<= ~pc1 1) (= 1 ~pc4)) |main_#t~short13|), 71586#(<= ~pc4 1), 71589#(= |old(~pc1)| ~pc1), 71588#(and (<= ~pc1 1) (= 1 ~pc4)), 71591#(<= ~pc1 2), 71590#(<= ~pc1 (+ |old(~pc1)| 1)), 71593#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 71592#(= |push_#t~post0| |old(~pc1)|), 71594#(<= 6 |old(~pc1)|)] [2018-02-04 02:07:22,798 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 02:07:22,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:07:22,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:07:22,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:07:22,798 INFO L87 Difference]: Start difference. First operand 5773 states and 7730 transitions. Second operand 11 states. [2018-02-04 02:07:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:23,461 INFO L93 Difference]: Finished difference Result 8708 states and 13062 transitions. [2018-02-04 02:07:23,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 02:07:23,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-04 02:07:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:23,487 INFO L225 Difference]: With dead ends: 8708 [2018-02-04 02:07:23,487 INFO L226 Difference]: Without dead ends: 8708 [2018-02-04 02:07:23,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 02:07:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8708 states. [2018-02-04 02:07:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8708 to 7176. [2018-02-04 02:07:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7176 states. [2018-02-04 02:07:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7176 states to 7176 states and 9757 transitions. [2018-02-04 02:07:23,655 INFO L78 Accepts]: Start accepts. Automaton has 7176 states and 9757 transitions. Word has length 42 [2018-02-04 02:07:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:23,655 INFO L432 AbstractCegarLoop]: Abstraction has 7176 states and 9757 transitions. [2018-02-04 02:07:23,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:07:23,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7176 states and 9757 transitions. [2018-02-04 02:07:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:07:23,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:23,657 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:23,657 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 02:07:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1272667095, now seen corresponding path program 1 times [2018-02-04 02:07:23,658 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:23,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:07:23,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:23,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:07:23,705 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:23,705 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 02:07:23,705 INFO L182 omatonBuilderFactory]: Interpolants [87537#|main_#t~short13|, 87536#(<= 2 ~pc4), 87533#true, 87535#(or (not |pop_#t~switch8|) (<= 2 ~pc4)), 87534#false] [2018-02-04 02:07:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-04 02:07:23,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:07:23,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:07:23,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:07:23,706 INFO L87 Difference]: Start difference. First operand 7176 states and 9757 transitions. Second operand 5 states. [2018-02-04 02:07:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:23,762 INFO L93 Difference]: Finished difference Result 8911 states and 12341 transitions. [2018-02-04 02:07:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:07:23,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-04 02:07:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:23,785 INFO L225 Difference]: With dead ends: 8911 [2018-02-04 02:07:23,785 INFO L226 Difference]: Without dead ends: 8911 [2018-02-04 02:07:23,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:07:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8911 states. [2018-02-04 02:07:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8911 to 8737. [2018-02-04 02:07:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8737 states. [2018-02-04 02:07:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8737 states to 8737 states and 12077 transitions. [2018-02-04 02:07:23,916 INFO L78 Accepts]: Start accepts. Automaton has 8737 states and 12077 transitions. Word has length 47 [2018-02-04 02:07:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:23,916 INFO L432 AbstractCegarLoop]: Abstraction has 8737 states and 12077 transitions. [2018-02-04 02:07:23,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:07:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8737 states and 12077 transitions. [2018-02-04 02:07:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:07:23,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:23,918 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:23,918 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 02:07:23,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1079771155, now seen corresponding path program 1 times [2018-02-04 02:07:23,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:23,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:24,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:24,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:07:24,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:24,051 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 02:07:24,052 INFO L182 omatonBuilderFactory]: Interpolants [105189#false, 105188#true, 105191#(or (and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 2 |pop_#t~post7|)) (or (and (<= (+ |pop_#t~post7| 1) ~pc4) (not (= |pop_#t~post7| 3))) (<= |pop_#t~post7| 2))) |pop_#t~switch8|), 105190#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 2 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 3))), 105193#(or (<= 5 ~pc4) (<= ~pc4 3)), 105192#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 2 |pop_#t~post7|)) (or (and (<= (+ |pop_#t~post7| 1) ~pc4) (not (= |pop_#t~post7| 3))) (<= |pop_#t~post7| 2))), 105195#(= |pop_#t~post7| |old(~pc4)|), 105194#(= |old(~pc4)| ~pc4), 105197#(and (<= |old(~pc4)| 4) (<= 4 |old(~pc4)|)), 105196#(or (not |pop_#t~switch8|) (and (<= |old(~pc4)| 4) (<= 4 |old(~pc4)|)))] [2018-02-04 02:07:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:24,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:07:24,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:07:24,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:07:24,052 INFO L87 Difference]: Start difference. First operand 8737 states and 12077 transitions. Second operand 10 states. [2018-02-04 02:07:24,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:24,361 INFO L93 Difference]: Finished difference Result 8392 states and 11461 transitions. [2018-02-04 02:07:24,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:24,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-04 02:07:24,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:24,381 INFO L225 Difference]: With dead ends: 8392 [2018-02-04 02:07:24,382 INFO L226 Difference]: Without dead ends: 8233 [2018-02-04 02:07:24,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:07:24,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2018-02-04 02:07:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 7953. [2018-02-04 02:07:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7953 states. [2018-02-04 02:07:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 10917 transitions. [2018-02-04 02:07:24,511 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 10917 transitions. Word has length 47 [2018-02-04 02:07:24,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:24,511 INFO L432 AbstractCegarLoop]: Abstraction has 7953 states and 10917 transitions. [2018-02-04 02:07:24,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:07:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 10917 transitions. [2018-02-04 02:07:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 02:07:24,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:24,513 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:24,513 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 02:07:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1244589299, now seen corresponding path program 1 times [2018-02-04 02:07:24,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:24,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 02:07:24,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:24,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:07:24,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:24,657 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 02:07:24,657 INFO L182 omatonBuilderFactory]: Interpolants [121561#false, 121560#true, 121563#(= |old(~pc1)| ~pc1), 121562#(<= 1 ~pc1), 121565#(<= 2 ~pc1), 121564#(<= (+ |old(~pc1)| 1) ~pc1), 121567#|main_#t~short13|, 121566#(not (= ~pc1 1))] [2018-02-04 02:07:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 02:07:24,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:07:24,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:07:24,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:07:24,658 INFO L87 Difference]: Start difference. First operand 7953 states and 10917 transitions. Second operand 8 states. [2018-02-04 02:07:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:24,860 INFO L93 Difference]: Finished difference Result 7731 states and 10907 transitions. [2018-02-04 02:07:24,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:24,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-04 02:07:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:24,880 INFO L225 Difference]: With dead ends: 7731 [2018-02-04 02:07:24,880 INFO L226 Difference]: Without dead ends: 7731 [2018-02-04 02:07:24,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:07:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7731 states. [2018-02-04 02:07:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7731 to 7133. [2018-02-04 02:07:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7133 states. [2018-02-04 02:07:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9644 transitions. [2018-02-04 02:07:25,005 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9644 transitions. Word has length 49 [2018-02-04 02:07:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:25,005 INFO L432 AbstractCegarLoop]: Abstraction has 7133 states and 9644 transitions. [2018-02-04 02:07:25,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:07:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9644 transitions. [2018-02-04 02:07:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:07:25,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:25,008 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 02:07:25,008 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 02:07:25,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 02:07:25,009 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:25,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:25,120 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 02:07:25,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:25,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:25,121 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:25,121 INFO L182 omatonBuilderFactory]: Interpolants [136450#(<= ~pc1 (+ |push_#t~post0| 1)), 136451#(or (<= ~pc1 3) (not |push_#t~switch1|)), 136448#true, 136449#false, 136454#(= |push_#t~post0| |old(~pc1)|), 136455#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 136452#(<= ~pc1 3), 136453#(= |old(~pc1)| ~pc1), 136456#(<= 6 |old(~pc1)|)] [2018-02-04 02:07:25,121 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 02:07:25,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:25,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:25,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:25,122 INFO L87 Difference]: Start difference. First operand 7133 states and 9644 transitions. Second operand 9 states. [2018-02-04 02:07:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:25,388 INFO L93 Difference]: Finished difference Result 9487 states and 13279 transitions. [2018-02-04 02:07:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:25,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 02:07:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:25,413 INFO L225 Difference]: With dead ends: 9487 [2018-02-04 02:07:25,414 INFO L226 Difference]: Without dead ends: 9487 [2018-02-04 02:07:25,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2018-02-04 02:07:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 7857. [2018-02-04 02:07:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-02-04 02:07:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 10833 transitions. [2018-02-04 02:07:25,548 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 10833 transitions. Word has length 54 [2018-02-04 02:07:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:25,548 INFO L432 AbstractCegarLoop]: Abstraction has 7857 states and 10833 transitions. [2018-02-04 02:07:25,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 10833 transitions. [2018-02-04 02:07:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:07:25,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:25,551 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 02:07:25,551 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 02:07:25,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 02:07:25,552 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:25,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:25,624 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 02:07:25,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:25,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:25,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:25,625 INFO L182 omatonBuilderFactory]: Interpolants [153826#(or (<= ~pc1 4) (not |push_#t~switch1|)), 153827#(<= ~pc1 4), 153824#false, 153825#(<= ~pc1 (+ |push_#t~post0| 1)), 153830#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 153831#(<= 6 |old(~pc1)|), 153828#(= |old(~pc1)| ~pc1), 153829#(= |push_#t~post0| |old(~pc1)|), 153823#true] [2018-02-04 02:07:25,625 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 02:07:25,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:25,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:25,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:25,626 INFO L87 Difference]: Start difference. First operand 7857 states and 10833 transitions. Second operand 9 states. [2018-02-04 02:07:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:25,916 INFO L93 Difference]: Finished difference Result 9947 states and 14391 transitions. [2018-02-04 02:07:25,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:25,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 02:07:25,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:25,944 INFO L225 Difference]: With dead ends: 9947 [2018-02-04 02:07:25,945 INFO L226 Difference]: Without dead ends: 9947 [2018-02-04 02:07:25,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9947 states. [2018-02-04 02:07:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9947 to 7857. [2018-02-04 02:07:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-02-04 02:07:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 10833 transitions. [2018-02-04 02:07:26,109 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 10833 transitions. Word has length 54 [2018-02-04 02:07:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:26,109 INFO L432 AbstractCegarLoop]: Abstraction has 7857 states and 10833 transitions. [2018-02-04 02:07:26,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 10833 transitions. [2018-02-04 02:07:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 02:07:26,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:26,111 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:26,111 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 02:07:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1006007847, now seen corresponding path program 1 times [2018-02-04 02:07:26,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:26,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:07:26,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:26,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:26,178 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:26,179 INFO L182 omatonBuilderFactory]: Interpolants [171666#(<= 6 |old(~pc1)|), 171664#(= |push_#t~post0| |old(~pc1)|), 171665#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 171658#true, 171659#false, 171662#(<= ~pc1 5), 171663#(= |old(~pc1)| ~pc1), 171660#(<= ~pc1 (+ |push_#t~post0| 1)), 171661#(or (<= ~pc1 5) (not |push_#t~switch1|))] [2018-02-04 02:07:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:07:26,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:26,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:26,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:26,180 INFO L87 Difference]: Start difference. First operand 7857 states and 10833 transitions. Second operand 9 states. [2018-02-04 02:07:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:26,466 INFO L93 Difference]: Finished difference Result 9915 states and 14327 transitions. [2018-02-04 02:07:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:26,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-02-04 02:07:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:26,495 INFO L225 Difference]: With dead ends: 9915 [2018-02-04 02:07:26,495 INFO L226 Difference]: Without dead ends: 9915 [2018-02-04 02:07:26,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2018-02-04 02:07:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 7857. [2018-02-04 02:07:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-02-04 02:07:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 10833 transitions. [2018-02-04 02:07:26,613 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 10833 transitions. Word has length 56 [2018-02-04 02:07:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:26,613 INFO L432 AbstractCegarLoop]: Abstraction has 7857 states and 10833 transitions. [2018-02-04 02:07:26,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 10833 transitions. [2018-02-04 02:07:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 02:07:26,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:26,614 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:26,614 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1207017357, now seen corresponding path program 1 times [2018-02-04 02:07:26,615 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:26,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:07:26,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:26,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:26,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:26,663 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 02:07:26,663 INFO L182 omatonBuilderFactory]: Interpolants [189462#false, 189463#(not (= |push_#t~malloc2.base| 0)), 189461#true, 189466#(= ~S.base |old(~x1~0.base)|), 189467#(not (= ~S.base 0)), 189464#(not (= ~x1~0.base 0)), 189465#(= ~x1~0.base |old(~x1~0.base)|), 189468#(= ~S.base |old(~S.base)|), 189469#|main_#t~short13|] [2018-02-04 02:07:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:07:26,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:26,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:26,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:26,663 INFO L87 Difference]: Start difference. First operand 7857 states and 10833 transitions. Second operand 9 states. [2018-02-04 02:07:27,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:27,045 INFO L93 Difference]: Finished difference Result 14394 states and 20271 transitions. [2018-02-04 02:07:27,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:07:27,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-02-04 02:07:27,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:27,072 INFO L225 Difference]: With dead ends: 14394 [2018-02-04 02:07:27,072 INFO L226 Difference]: Without dead ends: 14394 [2018-02-04 02:07:27,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:07:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14394 states. [2018-02-04 02:07:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14394 to 14013. [2018-02-04 02:07:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14013 states. [2018-02-04 02:07:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14013 states to 14013 states and 19721 transitions. [2018-02-04 02:07:27,230 INFO L78 Accepts]: Start accepts. Automaton has 14013 states and 19721 transitions. Word has length 57 [2018-02-04 02:07:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:27,230 INFO L432 AbstractCegarLoop]: Abstraction has 14013 states and 19721 transitions. [2018-02-04 02:07:27,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 14013 states and 19721 transitions. [2018-02-04 02:07:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 02:07:27,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:27,232 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:27,232 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1674128402, now seen corresponding path program 1 times [2018-02-04 02:07:27,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:27,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:07:27,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:27,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:27,344 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:27,344 INFO L182 omatonBuilderFactory]: Interpolants [217923#(and (<= 6 |old(~pc1)|) (<= |old(~pc1)| 6)), 217922#(or (and (<= 6 |old(~pc1)|) (<= |old(~pc1)| 6)) (not |push_#t~switch1|)), 217921#(= |push_#t~post0| |old(~pc1)|), 217920#(= |old(~pc1)| ~pc1), 217915#true, 217919#(or (<= 7 ~pc1) (<= ~pc1 5)), 217918#(or (and (not (= |push_#t~post0| 5)) (or (<= |push_#t~post0| 5) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 4 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))) |push_#t~switch1|), 217917#(and (or (<= |push_#t~post0| 5) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 4 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))), 217916#false] [2018-02-04 02:07:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:07:27,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:27,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:27,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:27,345 INFO L87 Difference]: Start difference. First operand 14013 states and 19721 transitions. Second operand 9 states. [2018-02-04 02:07:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:27,733 INFO L93 Difference]: Finished difference Result 16596 states and 24399 transitions. [2018-02-04 02:07:27,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:07:27,733 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-02-04 02:07:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:27,772 INFO L225 Difference]: With dead ends: 16596 [2018-02-04 02:07:27,773 INFO L226 Difference]: Without dead ends: 16500 [2018-02-04 02:07:27,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:07:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16500 states. [2018-02-04 02:07:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16500 to 11044. [2018-02-04 02:07:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11044 states. [2018-02-04 02:07:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 15542 transitions. [2018-02-04 02:07:28,065 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 15542 transitions. Word has length 58 [2018-02-04 02:07:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:28,066 INFO L432 AbstractCegarLoop]: Abstraction has 11044 states and 15542 transitions. [2018-02-04 02:07:28,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 15542 transitions. [2018-02-04 02:07:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:07:28,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:28,069 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:28,069 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash -698837692, now seen corresponding path program 1 times [2018-02-04 02:07:28,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:28,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 02:07:28,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:28,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:07:28,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:28,166 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 02:07:28,166 INFO L182 omatonBuilderFactory]: Interpolants [245587#(= 1 (select |#valid| ~S.base)), 245586#(and (= |#valid| |old(#valid)|) (= |old(~x1~0.base)| ~S.base)), 245585#(and (= |#valid| |old(#valid)|) (= |old(~x1~0.base)| ~x1~0.base)), 245584#(= 1 (select |#valid| ~x1~0.base)), 245591#(= |old(~t4~0.base)| ~t4~0.base), 245590#(= 1 (select |#valid| ~t4~0.base)), 245589#(= |old(~S.base)| ~t4~0.base), 245588#(= |old(~S.base)| ~S.base), 245583#(= 1 (select |#valid| |push_#t~malloc2.base|)), 245582#false, 245581#true] [2018-02-04 02:07:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 02:07:28,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:07:28,166 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:07:28,166 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:07:28,166 INFO L87 Difference]: Start difference. First operand 11044 states and 15542 transitions. Second operand 11 states. [2018-02-04 02:07:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:29,080 INFO L93 Difference]: Finished difference Result 20780 states and 29409 transitions. [2018-02-04 02:07:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:07:29,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-04 02:07:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:29,111 INFO L225 Difference]: With dead ends: 20780 [2018-02-04 02:07:29,112 INFO L226 Difference]: Without dead ends: 20644 [2018-02-04 02:07:29,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:07:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20644 states. [2018-02-04 02:07:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20644 to 19665. [2018-02-04 02:07:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19665 states. [2018-02-04 02:07:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 27717 transitions. [2018-02-04 02:07:29,452 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 27717 transitions. Word has length 67 [2018-02-04 02:07:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:29,452 INFO L432 AbstractCegarLoop]: Abstraction has 19665 states and 27717 transitions. [2018-02-04 02:07:29,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:07:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 27717 transitions. [2018-02-04 02:07:29,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:07:29,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:29,455 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:29,455 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:29,455 INFO L82 PathProgramCache]: Analyzing trace with hash -698837691, now seen corresponding path program 1 times [2018-02-04 02:07:29,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:29,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 02:07:29,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:29,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:29,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:29,507 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 02:07:29,507 INFO L182 omatonBuilderFactory]: Interpolants [286116#(= |push_#t~post0| |old(~pc1)|), 286117#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|)), 286118#(<= 5 |old(~pc1)|), 286112#(<= ~pc1 1), 286113#(= |old(~pc1)| ~pc1), 286114#(<= ~pc1 (+ |old(~pc1)| 1)), 286115#(<= ~pc1 2), 286110#true, 286111#false] [2018-02-04 02:07:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 02:07:29,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:29,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:29,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:29,507 INFO L87 Difference]: Start difference. First operand 19665 states and 27717 transitions. Second operand 9 states. [2018-02-04 02:07:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:29,775 INFO L93 Difference]: Finished difference Result 24179 states and 34471 transitions. [2018-02-04 02:07:29,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:07:29,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-02-04 02:07:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:29,818 INFO L225 Difference]: With dead ends: 24179 [2018-02-04 02:07:29,819 INFO L226 Difference]: Without dead ends: 24179 [2018-02-04 02:07:29,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24179 states. [2018-02-04 02:07:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24179 to 23154. [2018-02-04 02:07:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23154 states. [2018-02-04 02:07:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23154 states to 23154 states and 32877 transitions. [2018-02-04 02:07:30,051 INFO L78 Accepts]: Start accepts. Automaton has 23154 states and 32877 transitions. Word has length 67 [2018-02-04 02:07:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:30,051 INFO L432 AbstractCegarLoop]: Abstraction has 23154 states and 32877 transitions. [2018-02-04 02:07:30,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 23154 states and 32877 transitions. [2018-02-04 02:07:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 02:07:30,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:30,054 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:30,054 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2040879096, now seen corresponding path program 1 times [2018-02-04 02:07:30,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:30,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:07:30,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:30,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:30,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:30,130 INFO L182 omatonBuilderFactory]: Interpolants [333477#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|)), 333476#(= |push_#t~post0| |old(~pc1)|), 333478#(<= 5 |old(~pc1)|), 333473#(or (<= ~pc1 3) (not |push_#t~switch1|)), 333472#(<= ~pc1 (+ |push_#t~post0| 1)), 333475#(= |old(~pc1)| ~pc1), 333474#(<= ~pc1 3), 333471#false, 333470#true] [2018-02-04 02:07:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:07:30,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:30,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:30,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:30,130 INFO L87 Difference]: Start difference. First operand 23154 states and 32877 transitions. Second operand 9 states. [2018-02-04 02:07:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:30,615 INFO L93 Difference]: Finished difference Result 29149 states and 42555 transitions. [2018-02-04 02:07:30,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:30,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-02-04 02:07:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:30,670 INFO L225 Difference]: With dead ends: 29149 [2018-02-04 02:07:30,670 INFO L226 Difference]: Without dead ends: 29149 [2018-02-04 02:07:30,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29149 states. [2018-02-04 02:07:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29149 to 26079. [2018-02-04 02:07:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26079 states. [2018-02-04 02:07:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26079 states to 26079 states and 37263 transitions. [2018-02-04 02:07:30,974 INFO L78 Accepts]: Start accepts. Automaton has 26079 states and 37263 transitions. Word has length 79 [2018-02-04 02:07:30,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:30,974 INFO L432 AbstractCegarLoop]: Abstraction has 26079 states and 37263 transitions. [2018-02-04 02:07:30,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 26079 states and 37263 transitions. [2018-02-04 02:07:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 02:07:30,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:30,977 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:30,977 INFO L371 AbstractCegarLoop]: === Iteration 28 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:30,977 INFO L82 PathProgramCache]: Analyzing trace with hash -968199174, now seen corresponding path program 1 times [2018-02-04 02:07:30,978 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:30,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:07:31,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:31,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:31,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:31,041 INFO L182 omatonBuilderFactory]: Interpolants [388737#(<= 5 |old(~pc1)|), 388736#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|)), 388733#(<= ~pc1 4), 388732#(or (<= ~pc1 4) (not |push_#t~switch1|)), 388735#(= |push_#t~post0| |old(~pc1)|), 388734#(= |old(~pc1)| ~pc1), 388729#true, 388731#(<= ~pc1 (+ |push_#t~post0| 1)), 388730#false] [2018-02-04 02:07:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:07:31,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:31,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:31,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:31,042 INFO L87 Difference]: Start difference. First operand 26079 states and 37263 transitions. Second operand 9 states. [2018-02-04 02:07:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:31,354 INFO L93 Difference]: Finished difference Result 32004 states and 47553 transitions. [2018-02-04 02:07:31,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:31,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-02-04 02:07:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:31,409 INFO L225 Difference]: With dead ends: 32004 [2018-02-04 02:07:31,409 INFO L226 Difference]: Without dead ends: 32004 [2018-02-04 02:07:31,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32004 states. [2018-02-04 02:07:32,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32004 to 26079. [2018-02-04 02:07:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26079 states. [2018-02-04 02:07:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26079 states to 26079 states and 37263 transitions. [2018-02-04 02:07:32,169 INFO L78 Accepts]: Start accepts. Automaton has 26079 states and 37263 transitions. Word has length 79 [2018-02-04 02:07:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:32,169 INFO L432 AbstractCegarLoop]: Abstraction has 26079 states and 37263 transitions. [2018-02-04 02:07:32,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 26079 states and 37263 transitions. [2018-02-04 02:07:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 02:07:32,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:32,172 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:32,172 INFO L371 AbstractCegarLoop]: === Iteration 29 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash 596782844, now seen corresponding path program 1 times [2018-02-04 02:07:32,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:32,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 20 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 02:07:32,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:32,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:32,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:32,232 INFO L182 omatonBuilderFactory]: Interpolants [446850#(or (<= 4 |old(~pc1)|) (not |push_#t~switch1|)), 446851#(<= 4 |old(~pc1)|), 446848#(<= ~pc1 2), 446849#(= |push_#t~post0| |old(~pc1)|), 446846#(= |old(~pc1)| ~pc1), 446847#(<= ~pc1 (+ |old(~pc1)| 1)), 446844#false, 446845#(<= ~pc1 1), 446843#true] [2018-02-04 02:07:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 20 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 02:07:32,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:32,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:32,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:32,233 INFO L87 Difference]: Start difference. First operand 26079 states and 37263 transitions. Second operand 9 states. [2018-02-04 02:07:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:32,469 INFO L93 Difference]: Finished difference Result 29055 states and 42207 transitions. [2018-02-04 02:07:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:07:32,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-02-04 02:07:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:32,523 INFO L225 Difference]: With dead ends: 29055 [2018-02-04 02:07:32,523 INFO L226 Difference]: Without dead ends: 29055 [2018-02-04 02:07:32,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29055 states. [2018-02-04 02:07:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29055 to 28598. [2018-02-04 02:07:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28598 states. [2018-02-04 02:07:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28598 states to 28598 states and 41591 transitions. [2018-02-04 02:07:32,885 INFO L78 Accepts]: Start accepts. Automaton has 28598 states and 41591 transitions. Word has length 81 [2018-02-04 02:07:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:32,885 INFO L432 AbstractCegarLoop]: Abstraction has 28598 states and 41591 transitions. [2018-02-04 02:07:32,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28598 states and 41591 transitions. [2018-02-04 02:07:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 02:07:32,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:32,889 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:32,889 INFO L371 AbstractCegarLoop]: === Iteration 30 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:32,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1852600825, now seen corresponding path program 1 times [2018-02-04 02:07:32,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:32,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:07:33,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:33,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:07:33,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:07:33,034 INFO L182 omatonBuilderFactory]: Interpolants [504535#(= |push_#t~post0| |old(~pc1)|), 504534#(= |old(~pc1)| ~pc1), 504533#(or (<= 6 ~pc1) (<= ~pc1 4)), 504532#(and (or (<= |push_#t~post0| 4) (<= (+ |push_#t~post0| 1) ~pc1)) (not (= |push_#t~post0| 4)) (or (<= ~pc1 (+ |push_#t~post0| 1)) (< 3 |push_#t~post0|))), 504531#(or (and (or (<= |push_#t~post0| 4) (<= (+ |push_#t~post0| 1) ~pc1)) (not (= |push_#t~post0| 4)) (or (<= ~pc1 (+ |push_#t~post0| 1)) (< 3 |push_#t~post0|))) |push_#t~switch1|), 504530#(and (or (<= |push_#t~post0| 4) (<= (+ |push_#t~post0| 1) ~pc1)) (or (<= ~pc1 (+ |push_#t~post0| 1)) (< 3 |push_#t~post0|))), 504529#false, 504528#true, 504537#(and (<= |old(~pc1)| 5) (<= 5 |old(~pc1)|)), 504536#(or (and (<= |old(~pc1)| 5) (<= 5 |old(~pc1)|)) (not |push_#t~switch1|))] [2018-02-04 02:07:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:07:33,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:07:33,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:07:33,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:07:33,034 INFO L87 Difference]: Start difference. First operand 28598 states and 41591 transitions. Second operand 10 states. [2018-02-04 02:07:33,517 WARN L143 SmtUtils]: Spent 392ms on a formula simplification that was a NOOP. DAG size: 24 [2018-02-04 02:07:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:33,721 INFO L93 Difference]: Finished difference Result 35599 states and 52366 transitions. [2018-02-04 02:07:33,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:33,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-02-04 02:07:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:33,784 INFO L225 Difference]: With dead ends: 35599 [2018-02-04 02:07:33,784 INFO L226 Difference]: Without dead ends: 35599 [2018-02-04 02:07:33,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:07:33,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35599 states. [2018-02-04 02:07:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35599 to 28100. [2018-02-04 02:07:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28100 states. [2018-02-04 02:07:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28100 states to 28100 states and 39811 transitions. [2018-02-04 02:07:34,107 INFO L78 Accepts]: Start accepts. Automaton has 28100 states and 39811 transitions. Word has length 83 [2018-02-04 02:07:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:34,107 INFO L432 AbstractCegarLoop]: Abstraction has 28100 states and 39811 transitions. [2018-02-04 02:07:34,107 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:07:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28100 states and 39811 transitions. [2018-02-04 02:07:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 02:07:34,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:34,110 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:34,110 INFO L371 AbstractCegarLoop]: === Iteration 31 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash 751746159, now seen corresponding path program 1 times [2018-02-04 02:07:34,111 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:34,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:07:34,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:34,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:34,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:07:34,190 INFO L182 omatonBuilderFactory]: Interpolants [568264#(= |old(~pc1)| ~pc1), 568265#(= |push_#t~post0| |old(~pc1)|), 568266#(or (<= 4 |old(~pc1)|) (not |push_#t~switch1|)), 568267#(<= 4 |old(~pc1)|), 568259#true, 568260#false, 568261#(<= ~pc1 (+ |push_#t~post0| 1)), 568262#(or (<= ~pc1 3) (not |push_#t~switch1|)), 568263#(<= ~pc1 3)] [2018-02-04 02:07:34,190 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:07:34,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:34,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:34,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:34,190 INFO L87 Difference]: Start difference. First operand 28100 states and 39811 transitions. Second operand 9 states. [2018-02-04 02:07:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:34,433 INFO L93 Difference]: Finished difference Result 34025 states and 50183 transitions. [2018-02-04 02:07:34,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:34,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-02-04 02:07:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:34,493 INFO L225 Difference]: With dead ends: 34025 [2018-02-04 02:07:34,493 INFO L226 Difference]: Without dead ends: 34025 [2018-02-04 02:07:34,494 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34025 states. [2018-02-04 02:07:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34025 to 30955. [2018-02-04 02:07:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2018-02-04 02:07:36,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 44543 transitions. [2018-02-04 02:07:36,173 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 44543 transitions. Word has length 93 [2018-02-04 02:07:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:36,174 INFO L432 AbstractCegarLoop]: Abstraction has 30955 states and 44543 transitions. [2018-02-04 02:07:36,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 44543 transitions. [2018-02-04 02:07:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 02:07:36,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:36,177 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:36,177 INFO L371 AbstractCegarLoop]: === Iteration 32 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1475760911, now seen corresponding path program 1 times [2018-02-04 02:07:36,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:36,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 59 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-04 02:07:36,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:36,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:36,251 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:07:36,251 INFO L182 omatonBuilderFactory]: Interpolants [633273#(= |old(~pc1)| ~pc1), 633272#(<= ~pc1 1), 633275#(<= ~pc1 2), 633274#(<= ~pc1 (+ |old(~pc1)| 1)), 633277#(or (<= 3 |old(~pc1)|) (not |push_#t~switch1|)), 633276#(= |push_#t~post0| |old(~pc1)|), 633278#(<= 3 |old(~pc1)|), 633271#false, 633270#true] [2018-02-04 02:07:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 59 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-04 02:07:36,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:36,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:36,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:36,252 INFO L87 Difference]: Start difference. First operand 30955 states and 44543 transitions. Second operand 9 states. [2018-02-04 02:07:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:36,558 INFO L93 Difference]: Finished difference Result 33931 states and 49835 transitions. [2018-02-04 02:07:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:07:36,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-02-04 02:07:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:36,617 INFO L225 Difference]: With dead ends: 33931 [2018-02-04 02:07:36,617 INFO L226 Difference]: Without dead ends: 33931 [2018-02-04 02:07:36,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:36,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33931 states. [2018-02-04 02:07:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33931 to 33474. [2018-02-04 02:07:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33474 states. [2018-02-04 02:07:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33474 states to 33474 states and 49120 transitions. [2018-02-04 02:07:37,012 INFO L78 Accepts]: Start accepts. Automaton has 33474 states and 49120 transitions. Word has length 93 [2018-02-04 02:07:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:37,012 INFO L432 AbstractCegarLoop]: Abstraction has 33474 states and 49120 transitions. [2018-02-04 02:07:37,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 33474 states and 49120 transitions. [2018-02-04 02:07:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 02:07:37,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:37,016 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 4, 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, 1, 1, 1] [2018-02-04 02:07:37,016 INFO L371 AbstractCegarLoop]: === Iteration 33 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:37,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1484893246, now seen corresponding path program 1 times [2018-02-04 02:07:37,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:37,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:07:37,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:37,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:07:37,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:07:37,147 INFO L182 omatonBuilderFactory]: Interpolants [700714#(= |push_#t~post0| |old(~pc1)|), 700715#(or (and (<= 4 |old(~pc1)|) (<= |old(~pc1)| 4)) (not |push_#t~switch1|)), 700712#(or (<= 5 ~pc1) (<= ~pc1 3)), 700713#(= |old(~pc1)| ~pc1), 700716#(and (<= 4 |old(~pc1)|) (<= |old(~pc1)| 4)), 700707#true, 700710#(or |push_#t~switch1| (and (or (and (<= (+ |push_#t~post0| 1) ~pc1) (not (= |push_#t~post0| 3))) (<= |push_#t~post0| 2)) (or (< 2 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1))))), 700711#(and (or (and (<= (+ |push_#t~post0| 1) ~pc1) (not (= |push_#t~post0| 3))) (<= |push_#t~post0| 2)) (or (< 2 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))), 700708#false, 700709#(and (or (<= |push_#t~post0| 3) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 2 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1))))] [2018-02-04 02:07:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:07:37,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:07:37,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:07:37,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:07:37,148 INFO L87 Difference]: Start difference. First operand 33474 states and 49120 transitions. Second operand 10 states. [2018-02-04 02:07:37,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:37,452 INFO L93 Difference]: Finished difference Result 40475 states and 59908 transitions. [2018-02-04 02:07:37,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:07:37,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-02-04 02:07:37,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:37,540 INFO L225 Difference]: With dead ends: 40475 [2018-02-04 02:07:37,540 INFO L226 Difference]: Without dead ends: 40475 [2018-02-04 02:07:37,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:07:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40475 states. [2018-02-04 02:07:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40475 to 32976. [2018-02-04 02:07:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32976 states. [2018-02-04 02:07:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32976 states to 32976 states and 47005 transitions. [2018-02-04 02:07:38,118 INFO L78 Accepts]: Start accepts. Automaton has 32976 states and 47005 transitions. Word has length 97 [2018-02-04 02:07:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:38,118 INFO L432 AbstractCegarLoop]: Abstraction has 32976 states and 47005 transitions. [2018-02-04 02:07:38,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:07:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32976 states and 47005 transitions. [2018-02-04 02:07:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 02:07:38,123 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:38,123 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:38,123 INFO L371 AbstractCegarLoop]: === Iteration 34 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash 112633316, now seen corresponding path program 1 times [2018-02-04 02:07:38,124 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:38,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 02:07:38,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:38,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:07:38,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:07:38,324 INFO L182 omatonBuilderFactory]: Interpolants [774201#(and (= |old(~t4~0.offset)| ~t4~0.offset) (= |old(~t4~0.base)| ~t4~0.base)), 774200#(and (= 0 ~t4~0.offset) (= 8 (select |#length| ~t4~0.base))), 774191#true, 774195#(and (= |old(~x1~0.offset)| ~x1~0.offset) (= |old(~x1~0.base)| ~x1~0.base) (= |old(#length)| |#length|)), 774194#(and (= 0 ~x1~0.offset) (= 8 (select |#length| ~x1~0.base))), 774193#(and (= 8 (select |#length| |push_#t~malloc2.base|)) (= 0 |push_#t~malloc2.offset|)), 774192#false, 774199#(and (= |old(~S.base)| ~t4~0.base) (= |old(~S.offset)| ~t4~0.offset)), 774198#(and (= |old(~S.offset)| ~S.offset) (= |old(~S.base)| ~S.base)), 774197#(and (= 0 ~S.offset) (= 8 (select |#length| ~S.base))), 774196#(and (= |old(~x1~0.base)| ~S.base) (= |old(~x1~0.offset)| ~S.offset) (= |old(#length)| |#length|))] [2018-02-04 02:07:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 02:07:38,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:07:38,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:07:38,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:07:38,325 INFO L87 Difference]: Start difference. First operand 32976 states and 47005 transitions. Second operand 11 states. [2018-02-04 02:07:39,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:39,570 INFO L93 Difference]: Finished difference Result 50060 states and 72823 transitions. [2018-02-04 02:07:39,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:07:39,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2018-02-04 02:07:39,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:39,692 INFO L225 Difference]: With dead ends: 50060 [2018-02-04 02:07:39,692 INFO L226 Difference]: Without dead ends: 50060 [2018-02-04 02:07:39,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:07:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50060 states. [2018-02-04 02:07:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50060 to 48452. [2018-02-04 02:07:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48452 states. [2018-02-04 02:07:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48452 states to 48452 states and 69183 transitions. [2018-02-04 02:07:40,635 INFO L78 Accepts]: Start accepts. Automaton has 48452 states and 69183 transitions. Word has length 105 [2018-02-04 02:07:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:40,636 INFO L432 AbstractCegarLoop]: Abstraction has 48452 states and 69183 transitions. [2018-02-04 02:07:40,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:07:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 48452 states and 69183 transitions. [2018-02-04 02:07:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-04 02:07:40,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:40,647 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:40,647 INFO L371 AbstractCegarLoop]: === Iteration 35 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:40,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1707311773, now seen corresponding path program 1 times [2018-02-04 02:07:40,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:40,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 69 proven. 127 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-02-04 02:07:40,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:40,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:07:40,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:07:40,813 INFO L182 omatonBuilderFactory]: Interpolants [872797#(or (not (= 0 |old(~t4~0.offset)|)) (not (= |old(~t4~0.base)| 0))), 872796#(and (= ~t4~0.base |old(~t4~0.base)|) (= ~t4~0.offset |old(~t4~0.offset)|)), 872793#(and (= ~S.offset |old(~S.offset)|) (= |old(~S.base)| ~S.base)), 872792#(and (= 0 ~S.base) (= 0 ~S.offset)), 872795#(and (= 0 ~t4~0.base) (= 0 ~t4~0.offset)), 872794#(and (= ~t4~0.offset |old(~S.offset)|) (= |old(~S.base)| ~t4~0.base)), 872789#(and (= 0 ~x4~0.offset) (= 0 ~x4~0.base)), 872788#false, 872791#(and (= ~S.offset |old(~x4~0.offset)|) (= |old(~x4~0.base)| ~S.base)), 872790#(and (= ~x4~0.offset |old(~x4~0.offset)|) (= |old(~x4~0.base)| ~x4~0.base)), 872787#true] [2018-02-04 02:07:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 69 proven. 127 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-02-04 02:07:40,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:07:40,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:07:40,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:07:40,814 INFO L87 Difference]: Start difference. First operand 48452 states and 69183 transitions. Second operand 11 states. [2018-02-04 02:07:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:42,174 INFO L93 Difference]: Finished difference Result 91049 states and 127932 transitions. [2018-02-04 02:07:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 02:07:42,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 141 [2018-02-04 02:07:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:42,364 INFO L225 Difference]: With dead ends: 91049 [2018-02-04 02:07:42,364 INFO L226 Difference]: Without dead ends: 90381 [2018-02-04 02:07:42,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 02:07:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90381 states. [2018-02-04 02:07:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90381 to 87571. [2018-02-04 02:07:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87571 states. [2018-02-04 02:07:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87571 states to 87571 states and 123169 transitions. [2018-02-04 02:07:43,740 INFO L78 Accepts]: Start accepts. Automaton has 87571 states and 123169 transitions. Word has length 141 [2018-02-04 02:07:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:43,740 INFO L432 AbstractCegarLoop]: Abstraction has 87571 states and 123169 transitions. [2018-02-04 02:07:43,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:07:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 87571 states and 123169 transitions. [2018-02-04 02:07:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-04 02:07:43,753 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:43,753 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:43,754 INFO L371 AbstractCegarLoop]: === Iteration 36 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1748393166, now seen corresponding path program 1 times [2018-02-04 02:07:43,754 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:43,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 100 proven. 195 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-02-04 02:07:43,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:43,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 02:07:43,877 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:07:43,878 INFO L182 omatonBuilderFactory]: Interpolants [1051504#(= ~S.base |old(~S.base)|), 1051505#(= ~t4~0.base |old(~S.base)|), 1051506#(not (= ~t4~0.base 0)), 1051507#(= ~t4~0.base |old(~t4~0.base)|), 1051508#(= 0 |old(~t4~0.base)|), 1051497#true, 1051498#false, 1051499#(not (= |push_#t~malloc2.base| 0)), 1051500#(not (= ~x1~0.base 0)), 1051501#(= ~x1~0.base |old(~x1~0.base)|), 1051502#(= ~S.base |old(~x1~0.base)|), 1051503#(not (= ~S.base 0))] [2018-02-04 02:07:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 100 proven. 195 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-02-04 02:07:43,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 02:07:43,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 02:07:43,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 02:07:43,878 INFO L87 Difference]: Start difference. First operand 87571 states and 123169 transitions. Second operand 12 states. [2018-02-04 02:07:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:46,360 INFO L93 Difference]: Finished difference Result 118747 states and 183254 transitions. [2018-02-04 02:07:46,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-04 02:07:46,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2018-02-04 02:07:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:46,697 INFO L225 Difference]: With dead ends: 118747 [2018-02-04 02:07:46,697 INFO L226 Difference]: Without dead ends: 118563 [2018-02-04 02:07:46,699 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=814, Invalid=4736, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 02:07:46,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118563 states. [2018-02-04 02:07:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118563 to 115623. [2018-02-04 02:07:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115623 states. [2018-02-04 02:07:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115623 states to 115623 states and 173947 transitions. [2018-02-04 02:07:49,077 INFO L78 Accepts]: Start accepts. Automaton has 115623 states and 173947 transitions. Word has length 143 [2018-02-04 02:07:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:49,077 INFO L432 AbstractCegarLoop]: Abstraction has 115623 states and 173947 transitions. [2018-02-04 02:07:49,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 02:07:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 115623 states and 173947 transitions. [2018-02-04 02:07:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 02:07:49,097 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:49,098 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:49,098 INFO L371 AbstractCegarLoop]: === Iteration 37 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash 738810213, now seen corresponding path program 1 times [2018-02-04 02:07:49,099 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:49,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2018-02-04 02:07:49,163 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:49,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:07:49,164 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:07:49,164 INFO L182 omatonBuilderFactory]: Interpolants [1286039#(= 1 (select |#valid| ~t4~0.base)), 1286038#false, 1286037#true, 1286040#(= 1 (select |#valid| ~garbage.base))] [2018-02-04 02:07:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2018-02-04 02:07:49,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:07:49,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:07:49,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:07:49,165 INFO L87 Difference]: Start difference. First operand 115623 states and 173947 transitions. Second operand 4 states. [2018-02-04 02:07:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:49,770 INFO L93 Difference]: Finished difference Result 136659 states and 205996 transitions. [2018-02-04 02:07:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:07:49,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-02-04 02:07:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:50,110 INFO L225 Difference]: With dead ends: 136659 [2018-02-04 02:07:50,110 INFO L226 Difference]: Without dead ends: 136387 [2018-02-04 02:07:50,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 02:07:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136387 states. [2018-02-04 02:07:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136387 to 135218. [2018-02-04 02:07:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135218 states. [2018-02-04 02:07:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135218 states to 135218 states and 204299 transitions. [2018-02-04 02:07:53,863 INFO L78 Accepts]: Start accepts. Automaton has 135218 states and 204299 transitions. Word has length 148 [2018-02-04 02:07:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:53,863 INFO L432 AbstractCegarLoop]: Abstraction has 135218 states and 204299 transitions. [2018-02-04 02:07:53,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:07:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 135218 states and 204299 transitions. [2018-02-04 02:07:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-04 02:07:53,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:53,884 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:53,884 INFO L371 AbstractCegarLoop]: === Iteration 38 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash 738810214, now seen corresponding path program 1 times [2018-02-04 02:07:53,885 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:53,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 134 proven. 15 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-02-04 02:07:54,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:54,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:07:54,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:07:54,013 INFO L182 omatonBuilderFactory]: Interpolants [1557927#(= |pop_#t~post7| |old(~pc4)|), 1557926#(= |old(~pc4)| ~pc4), 1557925#(<= ~pc4 3), 1557924#(or (not |pop_#t~switch8|) (<= ~pc4 3)), 1557923#(<= ~pc4 (+ |pop_#t~post7| 1)), 1557922#false, 1557921#true, 1557929#(<= 4 |old(~pc4)|), 1557928#(or (not |pop_#t~switch8|) (<= 4 |old(~pc4)|))] [2018-02-04 02:07:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 134 proven. 15 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-02-04 02:07:54,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:07:54,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:07:54,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:07:54,014 INFO L87 Difference]: Start difference. First operand 135218 states and 204299 transitions. Second operand 9 states. [2018-02-04 02:07:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:54,604 INFO L93 Difference]: Finished difference Result 59920 states and 89257 transitions. [2018-02-04 02:07:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:07:54,604 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-04 02:07:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:54,727 INFO L225 Difference]: With dead ends: 59920 [2018-02-04 02:07:54,728 INFO L226 Difference]: Without dead ends: 58750 [2018-02-04 02:07:54,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:07:54,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58750 states. [2018-02-04 02:07:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58750 to 58400. [2018-02-04 02:07:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58400 states. [2018-02-04 02:07:55,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58400 states to 58400 states and 87388 transitions. [2018-02-04 02:07:55,457 INFO L78 Accepts]: Start accepts. Automaton has 58400 states and 87388 transitions. Word has length 148 [2018-02-04 02:07:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:55,457 INFO L432 AbstractCegarLoop]: Abstraction has 58400 states and 87388 transitions. [2018-02-04 02:07:55,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:07:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 58400 states and 87388 transitions. [2018-02-04 02:07:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-02-04 02:07:55,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:55,471 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:55,471 INFO L371 AbstractCegarLoop]: === Iteration 39 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:55,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1286652162, now seen corresponding path program 1 times [2018-02-04 02:07:55,472 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:55,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 203 proven. 11 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-02-04 02:07:55,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:55,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:07:55,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:07:55,572 INFO L182 omatonBuilderFactory]: Interpolants [1676281#(<= |old(~pc4)| 1), 1676280#(or (not |pop_#t~switch8|) (<= |old(~pc4)| 1)), 1676275#false, 1676274#true, 1676277#(or (not |pop_#t~switch8|) (<= 5 ~pc4)), 1676276#(<= (+ |pop_#t~post7| 1) ~pc4), 1676279#(= |old(~pc4)| ~pc4), 1676278#(<= 5 ~pc4)] [2018-02-04 02:07:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 203 proven. 11 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2018-02-04 02:07:55,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:07:55,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:07:55,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:07:55,573 INFO L87 Difference]: Start difference. First operand 58400 states and 87388 transitions. Second operand 8 states. [2018-02-04 02:07:56,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:56,429 INFO L93 Difference]: Finished difference Result 97417 states and 153853 transitions. [2018-02-04 02:07:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 02:07:56,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2018-02-04 02:07:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:56,654 INFO L225 Difference]: With dead ends: 97417 [2018-02-04 02:07:56,654 INFO L226 Difference]: Without dead ends: 97141 [2018-02-04 02:07:56,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97141 states. [2018-02-04 02:07:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97141 to 77936. [2018-02-04 02:07:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77936 states. [2018-02-04 02:07:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77936 states to 77936 states and 116522 transitions. [2018-02-04 02:07:59,476 INFO L78 Accepts]: Start accepts. Automaton has 77936 states and 116522 transitions. Word has length 155 [2018-02-04 02:07:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:59,476 INFO L432 AbstractCegarLoop]: Abstraction has 77936 states and 116522 transitions. [2018-02-04 02:07:59,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:07:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 77936 states and 116522 transitions. [2018-02-04 02:07:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-02-04 02:07:59,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:59,489 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:59,489 INFO L371 AbstractCegarLoop]: === Iteration 40 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:07:59,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1819967685, now seen corresponding path program 1 times [2018-02-04 02:07:59,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:59,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 02:07:59,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:07:59,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:07:59,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:07:59,677 INFO L182 omatonBuilderFactory]: Interpolants [1851668#(and (= |old(~t4~0.offset)| ~t4~0.offset) (or (<= (+ ~t4~0.offset 8) (select |#length| ~t4~0.base)) (not (= ~t4~0.offset 0)))), 1851669#(and (or (= ~garbage.offset 0) (= ~garbage.offset |old(~t4~0.offset)|)) (or (not (= |old(~t4~0.offset)| 0)) (<= 8 (select |#length| ~garbage.base)))), 1851670#(and (= ~garbage.offset 0) (<= 8 (select |#length| ~garbage.base))), 1851664#(= |old(~S.offset)| ~S.offset), 1851665#(= |old(~S.offset)| ~t4~0.offset), 1851666#(= 0 ~t4~0.offset), 1851667#(= |old(~t4~0.offset)| ~t4~0.offset), 1851660#(= 0 ~x1~0.offset), 1851661#(= |old(~x1~0.offset)| ~x1~0.offset), 1851662#(= |old(~x1~0.offset)| ~S.offset), 1851663#(= 0 ~S.offset), 1851657#true, 1851658#false, 1851659#(= 0 |push_#t~malloc2.offset|)] [2018-02-04 02:07:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 02:07:59,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 02:07:59,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 02:07:59,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:07:59,677 INFO L87 Difference]: Start difference. First operand 77936 states and 116522 transitions. Second operand 14 states. [2018-02-04 02:08:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:08:02,125 INFO L93 Difference]: Finished difference Result 141820 states and 217985 transitions. [2018-02-04 02:08:02,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-02-04 02:08:02,126 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 162 [2018-02-04 02:08:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:08:02,508 INFO L225 Difference]: With dead ends: 141820 [2018-02-04 02:08:02,508 INFO L226 Difference]: Without dead ends: 141820 [2018-02-04 02:08:02,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1641 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1051, Invalid=3779, Unknown=0, NotChecked=0, Total=4830 [2018-02-04 02:08:02,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141820 states. [2018-02-04 02:08:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141820 to 132918. [2018-02-04 02:08:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132918 states. [2018-02-04 02:08:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132918 states to 132918 states and 199665 transitions. [2018-02-04 02:08:04,426 INFO L78 Accepts]: Start accepts. Automaton has 132918 states and 199665 transitions. Word has length 162 [2018-02-04 02:08:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:08:04,426 INFO L432 AbstractCegarLoop]: Abstraction has 132918 states and 199665 transitions. [2018-02-04 02:08:04,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 02:08:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 132918 states and 199665 transitions. [2018-02-04 02:08:04,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-02-04 02:08:04,443 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:08:04,443 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:08:04,443 INFO L371 AbstractCegarLoop]: === Iteration 41 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:08:04,444 INFO L82 PathProgramCache]: Analyzing trace with hash 584421793, now seen corresponding path program 1 times [2018-02-04 02:08:04,444 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:08:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:08:04,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:08:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 02:08:04,570 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:08:04,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 02:08:04,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:08:04,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:08:04,571 INFO L182 omatonBuilderFactory]: Interpolants [2126543#true, 2126544#false, 2126545#(not (= |push_#t~malloc2.base| 0)), 2126546#(not (= ~x1~0.base 0)), 2126547#(= ~x1~0.base |old(~x1~0.base)|), 2126548#(= ~S.base |old(~x1~0.base)|), 2126549#(not (= ~S.base 0)), 2126550#(= ~S.base |old(~S.base)|), 2126551#(= ~t4~0.base |old(~S.base)|), 2126552#(not (= ~t4~0.base 0)), 2126553#(= ~t4~0.base |old(~t4~0.base)|), 2126554#(= ~garbage.base |old(~t4~0.base)|), 2126555#(not (= ~garbage.base 0))] [2018-02-04 02:08:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 69 proven. 272 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 02:08:04,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:08:04,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:08:04,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:08:04,571 INFO L87 Difference]: Start difference. First operand 132918 states and 199665 transitions. Second operand 13 states. [2018-02-04 02:08:05,800 WARN L146 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-02-04 02:08:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:08:07,077 INFO L93 Difference]: Finished difference Result 135227 states and 208663 transitions. [2018-02-04 02:08:07,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-02-04 02:08:07,078 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 163 [2018-02-04 02:08:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:08:07,423 INFO L225 Difference]: With dead ends: 135227 [2018-02-04 02:08:07,423 INFO L226 Difference]: Without dead ends: 135227 [2018-02-04 02:08:07,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=826, Invalid=4430, Unknown=0, NotChecked=0, Total=5256 [2018-02-04 02:08:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135227 states. [2018-02-04 02:08:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135227 to 132918. [2018-02-04 02:08:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132918 states. [2018-02-04 02:08:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132918 states to 132918 states and 199664 transitions. [2018-02-04 02:08:09,505 INFO L78 Accepts]: Start accepts. Automaton has 132918 states and 199664 transitions. Word has length 163 [2018-02-04 02:08:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:08:09,505 INFO L432 AbstractCegarLoop]: Abstraction has 132918 states and 199664 transitions. [2018-02-04 02:08:09,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:08:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 132918 states and 199664 transitions. [2018-02-04 02:08:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 02:08:09,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:08:09,525 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:08:09,525 INFO L371 AbstractCegarLoop]: === Iteration 42 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:08:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1456360472, now seen corresponding path program 1 times [2018-02-04 02:08:09,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:08:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:08:09,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:08:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 59 proven. 20 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-02-04 02:08:11,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:08:11,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:08:11,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:08:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:08:11,762 INFO L182 omatonBuilderFactory]: Interpolants [2394848#(and (not (= 1 ~pc1)) (= 1 ~pc4)), 2394849#(= |old(~pc1)| ~pc1), 2394850#(or (= 1 |old(~pc1)|) (not |push_#t~switch1|)), 2394851#(= 1 |old(~pc1)|), 2394844#true, 2394845#false, 2394846#(and (= ~pc4 1) (= 0 ~S.base) (= 0 ~S.offset)), 2394847#(and (= 1 ~pc4) (or (not (= 1 ~pc1)) (not |main_#t~short13|)))] [2018-02-04 02:08:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 59 proven. 20 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-02-04 02:08:11,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:08:11,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:08:11,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:08:11,762 INFO L87 Difference]: Start difference. First operand 132918 states and 199664 transitions. Second operand 8 states. [2018-02-04 02:08:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:08:12,457 INFO L93 Difference]: Finished difference Result 134715 states and 207861 transitions. [2018-02-04 02:08:12,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:08:12,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 168 [2018-02-04 02:08:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:08:12,786 INFO L225 Difference]: With dead ends: 134715 [2018-02-04 02:08:12,786 INFO L226 Difference]: Without dead ends: 134707 [2018-02-04 02:08:12,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:08:12,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134707 states. [2018-02-04 02:08:14,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134707 to 132916. [2018-02-04 02:08:14,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132916 states. [2018-02-04 02:08:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132916 states to 132916 states and 199661 transitions. [2018-02-04 02:08:14,738 INFO L78 Accepts]: Start accepts. Automaton has 132916 states and 199661 transitions. Word has length 168 [2018-02-04 02:08:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:08:14,739 INFO L432 AbstractCegarLoop]: Abstraction has 132916 states and 199661 transitions. [2018-02-04 02:08:14,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:08:14,739 INFO L276 IsEmpty]: Start isEmpty. Operand 132916 states and 199661 transitions. [2018-02-04 02:08:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-02-04 02:08:14,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:08:14,759 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:08:14,759 INFO L371 AbstractCegarLoop]: === Iteration 43 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:08:14,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1434737638, now seen corresponding path program 2 times [2018-02-04 02:08:14,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:08:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:08:14,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:08:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 66 proven. 290 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-02-04 02:08:15,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:08:15,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 02:08:15,417 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:08:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:08:15,417 INFO L182 omatonBuilderFactory]: Interpolants [2662504#(and (= 0 ~garbage.base) (= 0 ~garbage.offset)), 2662505#(= 0 |push_#t~malloc2.offset|), 2662506#(= ~x1~0.offset 0), 2662507#(and (= 0 ~garbage.base) (= 0 ~garbage.offset) (= ~x1~0.offset 0)), 2662508#(= |old(~x1~0.offset)| ~x1~0.offset), 2662509#(= |old(~x1~0.offset)| ~S.offset), 2662510#(and (= 0 ~garbage.base) (= 0 ~garbage.offset) (= 0 ~S.offset)), 2662511#(= |old(~S.offset)| ~S.offset), 2662502#true, 2662503#false, 2662520#(and (= ~garbage.offset 0) (= 0 |main_#t~mem15.offset|) (= 0 |main_#t~mem15.base|)), 2662521#(and (= ~garbage.offset 0) (= 0 main_~next~0.offset) (= 0 main_~next~0.base)), 2662522#(and (= 0 main_~next~0.offset) (= 0 main_~next~0.base)), 2662512#(and (= |old(~S.offset)| ~S.offset) (= ~garbage.base |old(~garbage.base)|) (= |old(~garbage.offset)| ~garbage.offset)), 2662513#(and (= ~garbage.base |old(~garbage.base)|) (= |old(~garbage.offset)| ~garbage.offset) (= |old(~S.offset)| ~t4~0.offset)), 2662514#(and (= 0 ~t4~0.offset) (= 0 ~garbage.base) (= 0 ~garbage.offset)), 2662515#(and (= |old(~t4~0.offset)| ~t4~0.offset) (= ~garbage.base |old(~garbage.base)|) (= |old(~garbage.offset)| ~garbage.offset)), 2662516#(and (or (not (= ~t4~0.offset 0)) (and (= ~garbage.base |old(~garbage.base)|) (= |old(~garbage.offset)| ~garbage.offset))) (= |old(~t4~0.offset)| ~t4~0.offset)), 2662517#(and (or (and (= |old(~garbage.offset)| (select (select |#memory_$Pointer$.offset| ~t4~0.base) (+ ~t4~0.offset 4))) (= (select (select |#memory_$Pointer$.base| ~t4~0.base) (+ ~t4~0.offset 4)) |old(~garbage.base)|)) (not (= ~t4~0.offset 0))) (= |old(~t4~0.offset)| ~t4~0.offset)), 2662518#(or (not (= |old(~t4~0.offset)| 0)) (and (= ~garbage.offset |old(~t4~0.offset)|) (= (select (select |#memory_$Pointer$.base| ~garbage.base) (+ (- 0) 4)) |old(~garbage.base)|) (= |old(~garbage.offset)| (select (select |#memory_$Pointer$.offset| ~garbage.base) (+ (- 0) 4))))), 2662519#(and (= ~garbage.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| ~garbage.base) (+ ~garbage.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ~garbage.base) (+ ~garbage.offset 4))))] [2018-02-04 02:08:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 66 proven. 290 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-02-04 02:08:15,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 02:08:15,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 02:08:15,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2018-02-04 02:08:15,418 INFO L87 Difference]: Start difference. First operand 132916 states and 199661 transitions. Second operand 21 states. [2018-02-04 02:08:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:08:18,924 INFO L93 Difference]: Finished difference Result 185907 states and 294944 transitions. [2018-02-04 02:08:18,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-02-04 02:08:18,924 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 168 [2018-02-04 02:08:18,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:08:19,391 INFO L225 Difference]: With dead ends: 185907 [2018-02-04 02:08:19,391 INFO L226 Difference]: Without dead ends: 185172 [2018-02-04 02:08:19,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2259 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1040, Invalid=6270, Unknown=0, NotChecked=0, Total=7310 [2018-02-04 02:08:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185172 states. [2018-02-04 02:08:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185172 to 168190. [2018-02-04 02:08:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168190 states. [2018-02-04 02:08:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168190 states to 168190 states and 253837 transitions. [2018-02-04 02:08:22,315 INFO L78 Accepts]: Start accepts. Automaton has 168190 states and 253837 transitions. Word has length 168 [2018-02-04 02:08:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:08:22,316 INFO L432 AbstractCegarLoop]: Abstraction has 168190 states and 253837 transitions. [2018-02-04 02:08:22,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 02:08:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 168190 states and 253837 transitions. [2018-02-04 02:08:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-02-04 02:08:22,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:08:22,341 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 11, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:08:22,341 INFO L371 AbstractCegarLoop]: === Iteration 44 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:08:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1527195381, now seen corresponding path program 1 times [2018-02-04 02:08:22,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:08:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:08:22,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:08:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 10 proven. 333 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 02:08:22,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:08:22,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 02:08:22,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:08:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 02:08:22,708 INFO L182 omatonBuilderFactory]: Interpolants [3016772#(and (not (= ~garbage.base 0)) (= (store |#valid| ~garbage.base 0) |old(#valid)|)), 3016770#(= ~t4~0.base |old(~t4~0.base)|), 3016771#(= ~garbage.base |old(~t4~0.base)|), 3016768#(= ~t4~0.base |old(~S.base)|), 3016769#(and (not (= ~t4~0.base 0)) (= |old(#valid)| (store |#valid| ~t4~0.base 0))), 3016766#(and (= |#valid| |old(#valid)|) (= ~S.base |old(~S.base)|)), 3016767#(= ~S.base |old(~S.base)|), 3016764#(and (= |#valid| |old(#valid)|) (= ~S.base |old(~x1~0.base)|)), 3016765#(and (not (= ~S.base 0)) (= (store |#valid| ~S.base 0) |old(#valid)|)), 3016762#(and (not (= ~x1~0.base 0)) (= |#valid| (store |old(#valid)| ~x1~0.base (select |#valid| ~x1~0.base))) (= (select |old(#valid)| ~x1~0.base) 0)), 3016763#(and (= |#valid| |old(#valid)|) (= ~x1~0.base |old(~x1~0.base)|)), 3016760#(= |#valid| |old(#valid)|), 3016761#(and (= (select |old(#valid)| |push_#t~malloc2.base|) 0) (not (= |push_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |push_#t~malloc2.base| (select |#valid| |push_#t~malloc2.base|)))), 3016758#true, 3016759#false] [2018-02-04 02:08:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 10 proven. 333 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-02-04 02:08:22,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:08:22,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:08:22,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:08:22,709 INFO L87 Difference]: Start difference. First operand 168190 states and 253837 transitions. Second operand 15 states. [2018-02-04 02:08:25,083 WARN L146 SmtUtils]: Spent 1554ms on a formula simplification. DAG size of input: 23 DAG size of output 20 [2018-02-04 02:08:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:08:26,710 INFO L93 Difference]: Finished difference Result 227012 states and 385559 transitions. [2018-02-04 02:08:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 02:08:26,710 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 169 [2018-02-04 02:08:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:08:27,583 INFO L225 Difference]: With dead ends: 227012 [2018-02-04 02:08:27,583 INFO L226 Difference]: Without dead ends: 227002 [2018-02-04 02:08:27,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=207, Invalid=1275, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 02:08:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227002 states. [2018-02-04 02:08:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227002 to 221762. [2018-02-04 02:08:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221762 states. [2018-02-04 02:08:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221762 states to 221762 states and 373821 transitions. [2018-02-04 02:08:32,305 INFO L78 Accepts]: Start accepts. Automaton has 221762 states and 373821 transitions. Word has length 169 [2018-02-04 02:08:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:08:32,306 INFO L432 AbstractCegarLoop]: Abstraction has 221762 states and 373821 transitions. [2018-02-04 02:08:32,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:08:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 221762 states and 373821 transitions. [2018-02-04 02:08:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-02-04 02:08:32,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:08:32,351 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 8, 8, 8, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:08:32,351 INFO L371 AbstractCegarLoop]: === Iteration 45 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:08:32,352 INFO L82 PathProgramCache]: Analyzing trace with hash -427633868, now seen corresponding path program 1 times [2018-02-04 02:08:32,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:08:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:08:32,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:08:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 106 proven. 461 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-02-04 02:08:35,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:08:35,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-04 02:08:35,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:08:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 02:08:35,725 INFO L182 omatonBuilderFactory]: Interpolants [3465596#true, 3465597#false, 3465598#(and (= 0 ~S.base) (= 0 ~S.offset)), 3465599#(and (= ~S.offset |old(~S.offset)|) (= |old(~S.base)| ~S.base)), 3465620#(and (or (= |old(~t4~0.offset)| ~t4~0.offset) (= ~t4~0.offset 0)) (or (not (= ~t4~0.offset 0)) (and (= ~x4~0.offset (select (select |#memory_$Pointer$.offset| ~t4~0.base) (+ ~t4~0.offset 4))) (= (select (select |#memory_$Pointer$.base| ~t4~0.base) (+ ~t4~0.offset 4)) ~x4~0.base) (= ~t4~0.base |old(~t4~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 3465621#(and (= ~t4~0.offset 0) (= 0 ~x4~0.offset) (= 0 ~x4~0.base)), 3465622#(and (= ~x4~0.offset |old(~x4~0.offset)|) (= |old(~x4~0.base)| ~x4~0.base)), 3465623#(and (= ~S.offset |old(~x4~0.offset)|) (= |old(~x4~0.base)| ~S.base)), 3465616#(and (= 0 (select (select |#memory_$Pointer$.offset| ~t4~0.base) (+ 0 4))) (= 0 ~t4~0.offset) (= 0 (select (select |#memory_$Pointer$.base| ~t4~0.base) (+ 0 4)))), 3465617#(and (= |old(~t4~0.offset)| ~t4~0.offset) (= ~t4~0.base |old(~t4~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3465618#(and (or (and (= ~t4~0.base |old(~t4~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~t4~0.offset 0))) (or (= |old(~t4~0.offset)| ~t4~0.offset) (= ~t4~0.offset 0))), 3465619#(and (or (and (= ~t4~0.base |old(~t4~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (select |#memory_$Pointer$.base| ~t4~0.base) (+ ~t4~0.offset 4)) |pop_#t~mem9.base|) (= |pop_#t~mem9.offset| (select (select |#memory_$Pointer$.offset| ~t4~0.base) (+ ~t4~0.offset 4))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~t4~0.offset 0))) (or (= |old(~t4~0.offset)| ~t4~0.offset) (= ~t4~0.offset 0))), 3465624#(and (= ~t4~0.offset |old(~S.offset)|) (= |old(~S.base)| ~t4~0.base)), 3465625#(and (= 0 ~t4~0.base) (= 0 ~t4~0.offset)), 3465626#(and (= ~t4~0.base |old(~t4~0.base)|) (= ~t4~0.offset |old(~t4~0.offset)|)), 3465627#(or (not (= 0 |old(~t4~0.offset)|)) (not (= |old(~t4~0.base)| 0))), 3465604#(and (= ~x1~0.base |old(~x1~0.base)|) (= ~x1~0.offset |old(~x1~0.offset)|) (= ~S.offset |old(~S.offset)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~S.base)| ~S.base)), 3465605#(and (= ~x1~0.base |old(~x1~0.base)|) (= ~x1~0.offset |old(~x1~0.offset)|) (= ~S.offset |old(~S.offset)|) (= |old(~S.base)| ~S.base) (= (store (select |old(#memory_$Pointer$.offset)| ~x1~0.base) ~x1~0.offset (select (select |#memory_$Pointer$.offset| ~x1~0.base) ~x1~0.offset)) (select |#memory_$Pointer$.offset| ~x1~0.base))), 3465606#(and (= ~x1~0.base |old(~x1~0.base)|) (= ~t1~0.offset |old(~S.offset)|) (= ~x1~0.offset |old(~x1~0.offset)|) (= |old(~S.base)| ~t1~0.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3465607#(and (= 0 ~x1~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| ~x1~0.base) (+ 0 4))) (= 0 ~t1~0.base) (= 0 ~t1~0.offset)), 3465600#(and (= 0 |push_#t~malloc2.offset|) (= ~S.offset |old(~S.offset)|) (= |old(~S.base)| ~S.base)), 3465601#(and (= ~x1~0.offset 0) (= ~S.offset |old(~S.offset)|) (= |old(~S.base)| ~S.base)), 3465602#(and (= 0 (select (select |#memory_$Pointer$.offset| ~x1~0.base) (+ ~x1~0.offset 4))) (= ~x1~0.offset 0) (= ~S.offset |old(~S.offset)|) (= |old(~S.base)| ~S.base)), 3465603#(and (= 0 (select (select |#memory_$Pointer$.offset| ~x1~0.base) (+ ~x1~0.offset 4))) (= ~x1~0.offset 0) (= 0 ~S.base) (= 0 ~S.offset)), 3465612#(and (= |old(~x1~0.offset)| ~S.offset) (= ~S.base |old(~x1~0.base)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3465613#(and (= 0 (select (select |#memory_$Pointer$.base| ~S.base) (+ 0 4))) (= 0 (select (select |#memory_$Pointer$.offset| ~S.base) (+ 0 4))) (= 0 ~S.offset)), 3465614#(and (= |old(~S.offset)| ~S.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~S.base)| ~S.base)), 3465615#(and (= |old(~S.base)| ~t4~0.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(~S.offset)| ~t4~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 3465608#(and (= |old(~x1~0.offset)| ~x1~0.offset) (or (not (= ~x1~0.offset 0)) (and (= ~x1~0.base |old(~x1~0.base)|) (= ~t1~0.offset |old(~t1~0.offset)|) (= |old(~t1~0.base)| ~t1~0.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))), 3465609#(and (= |old(~x1~0.offset)| ~x1~0.offset) (or (and (= (select (select |#memory_$Pointer$.offset| ~x1~0.base) (+ ~x1~0.offset 4)) |old(~t1~0.offset)|) (= ~x1~0.base |old(~x1~0.base)|) (= |old(~t1~0.base)| (select (select |#memory_$Pointer$.base| ~x1~0.base) (+ ~x1~0.offset 4))) (= (store (select |old(#memory_$Pointer$.offset)| ~x1~0.base) (+ ~x1~0.offset 4) (select (select |#memory_$Pointer$.offset| ~x1~0.base) (+ ~x1~0.offset 4))) (select |#memory_$Pointer$.offset| ~x1~0.base))) (not (= ~x1~0.offset 0)))), 3465610#(and (= 0 (select (select |#memory_$Pointer$.offset| ~x1~0.base) (+ 0 4))) (= ~x1~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| ~x1~0.base) (+ 0 4)))), 3465611#(and (= |old(~x1~0.offset)| ~x1~0.offset) (= |old(~x1~0.base)| ~x1~0.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-04 02:08:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 106 proven. 461 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-02-04 02:08:35,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 02:08:35,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 02:08:35,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992 [2018-02-04 02:08:35,726 INFO L87 Difference]: Start difference. First operand 221762 states and 373821 transitions. Second operand 32 states. [2018-02-04 02:09:01,869 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 75 DAG size of output 57 [2018-02-04 02:09:11,137 WARN L146 SmtUtils]: Spent 600ms on a formula simplification. DAG size of input: 56 DAG size of output 52 [2018-02-04 02:09:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:09:14,785 INFO L93 Difference]: Finished difference Result 950664 states and 1612990 transitions. [2018-02-04 02:09:14,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 451 states. [2018-02-04 02:09:14,786 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 173 [2018-02-04 02:09:14,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:09:18,817 INFO L225 Difference]: With dead ends: 950664 [2018-02-04 02:09:18,817 INFO L226 Difference]: Without dead ends: 874186 [2018-02-04 02:09:18,828 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100699 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=17827, Invalid=208273, Unknown=0, NotChecked=0, Total=226100 [2018-02-04 02:09:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874186 states. Received shutdown request... [2018-02-04 02:09:29,784 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 02:09:29,787 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 02:09:29,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:09:29 BoogieIcfgContainer [2018-02-04 02:09:29,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:09:29,788 INFO L168 Benchmark]: Toolchain (without parser) took 132742.21 ms. Allocated memory was 397.4 MB in the beginning and 4.6 GB in the end (delta: 4.2 GB). Free memory was 354.3 MB in the beginning and 2.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 5.3 GB. [2018-02-04 02:09:29,789 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:09:29,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.27 ms. Allocated memory is still 397.4 MB. Free memory was 354.3 MB in the beginning and 343.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:09:29,789 INFO L168 Benchmark]: Boogie Preprocessor took 31.07 ms. Allocated memory is still 397.4 MB. Free memory was 343.7 MB in the beginning and 341.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:09:29,789 INFO L168 Benchmark]: RCFGBuilder took 277.73 ms. Allocated memory is still 397.4 MB. Free memory was 341.1 MB in the beginning and 313.7 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. [2018-02-04 02:09:29,789 INFO L168 Benchmark]: TraceAbstraction took 132269.95 ms. Allocated memory was 397.4 MB in the beginning and 4.6 GB in the end (delta: 4.2 GB). Free memory was 313.7 MB in the beginning and 2.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.6 GB. Max. memory is 5.3 GB. [2018-02-04 02:09:29,790 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.10 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.27 ms. Allocated memory is still 397.4 MB. Free memory was 354.3 MB in the beginning and 343.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.07 ms. Allocated memory is still 397.4 MB. Free memory was 343.7 MB in the beginning and 341.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 277.73 ms. Allocated memory is still 397.4 MB. Free memory was 341.1 MB in the beginning and 313.7 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 132269.95 ms. Allocated memory was 397.4 MB in the beginning and 4.6 GB in the end (delta: 4.2 GB). Free memory was 313.7 MB in the beginning and 2.6 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 132.2s OverallTime, 45 OverallIterations, 13 TraceHistogramMax, 77.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5321 SDtfs, 20542 SDslu, 14065 SDs, 0 SdLazy, 40490 SolverSat, 7081 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1805 GetRequests, 403 SyntacticMatches, 17 SemanticMatches, 1385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111512 ImplicationChecksByTransitivity, 35.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221762occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 4374/6712 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 43.7s AutomataMinimizationTime, 45 MinimizatonAttempts, 111615 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 3368 NumberOfCodeBlocks, 3368 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3323 ConstructedInterpolants, 0 QuantifiedInterpolants, 1683959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 11 PerfectInterpolantSequences, 4374/6712 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-09-29-800.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-09-29-800.csv Completed graceful shutdown