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/cav18-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-26d9e06-m [2018-02-02 09:56:52,173 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:56:52,174 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:56:52,184 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:56:52,185 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:56:52,185 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:56:52,186 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:56:52,188 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:56:52,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:56:52,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:56:52,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:56:52,191 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:56:52,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:56:52,193 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:56:52,194 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:56:52,196 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:56:52,197 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:56:52,199 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:56:52,200 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:56:52,201 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:56:52,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:56:52,203 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:56:52,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:56:52,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:56:52,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:56:52,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:56:52,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:56:52,206 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:56:52,206 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:56:52,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:56:52,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:56:52,207 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:56:52,218 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:56:52,218 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:56:52,219 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:56:52,219 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:56:52,219 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:56:52,220 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:56:52,220 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:56:52,220 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:56:52,220 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:56:52,220 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:56:52,220 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:56:52,221 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:56:52,221 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:56:52,221 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:56:52,221 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:56:52,221 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:56:52,221 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:56:52,222 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:56:52,222 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:56:52,222 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:56:52,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:56:52,222 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:56:52,222 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:56:52,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:56:52,266 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:56:52,270 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:56:52,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:56:52,273 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:56:52,274 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-02 09:56:52,425 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:56:52,426 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:56:52,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:56:52,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:56:52,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:56:52,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59897e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52, skipping insertion in model container [2018-02-02 09:56:52,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,455 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:56:52,486 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:56:52,580 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:56:52,595 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:56:52,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52 WrapperNode [2018-02-02 09:56:52,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:56:52,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:56:52,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:56:52,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:56:52,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (1/1) ... [2018-02-02 09:56:52,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:56:52,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:56:52,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:56:52,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:56:52,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (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-02 09:56:52,677 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:56:52,677 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:56:52,677 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-02 09:56:52,678 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-02 09:56:52,678 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:56:52,678 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:56:52,679 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-02 09:56:52,679 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-02 09:56:52,679 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:56:52,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:56:52,679 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:56:52,911 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:56:52,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:56:52 BoogieIcfgContainer [2018-02-02 09:56:52,911 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:56:52,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:56:52,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:56:52,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:56:52,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:56:52" (1/3) ... [2018-02-02 09:56:52,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5439ccbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:56:52, skipping insertion in model container [2018-02-02 09:56:52,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:56:52" (2/3) ... [2018-02-02 09:56:52,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5439ccbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:56:52, skipping insertion in model container [2018-02-02 09:56:52,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:56:52" (3/3) ... [2018-02-02 09:56:52,917 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-02-02 09:56:52,923 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:56:52,928 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 09:56:52,955 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:56:52,955 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:56:52,955 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:56:52,955 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:56:52,956 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:56:52,956 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:56:52,956 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:56:52,956 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:56:52,957 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:56:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 09:56:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-02 09:56:52,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:52,975 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:52,976 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-02 09:56:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-02 09:56:53,013 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:53,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:53,095 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-02 09:56:53,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:53,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:56:53,099 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:53,099 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-02 09:56:53,099 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 79#true] [2018-02-02 09:56:53,100 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-02 09:56:53,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 09:56:53,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 09:56:53,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:56:53,113 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-02 09:56:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:53,204 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-02 09:56:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 09:56:53,205 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-02 09:56:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:53,215 INFO L225 Difference]: With dead ends: 76 [2018-02-02 09:56:53,215 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 09:56:53,216 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-02 09:56:53,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 09:56:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-02 09:56:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 09:56:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-02 09:56:53,243 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-02 09:56:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:53,244 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-02 09:56:53,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 09:56:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-02 09:56:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 09:56:53,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:53,244 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:53,244 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-02 09:56:53,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-02 09:56:53,246 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:53,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:53,305 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-02 09:56:53,305 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:53,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:56:53,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:53,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-02 09:56:53,306 INFO L182 omatonBuilderFactory]: Interpolants [230#true, 231#false, 232#|main_#t~short13|] [2018-02-02 09:56:53,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-02 09:56:53,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:56:53,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:56:53,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:56:53,308 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-02 09:56:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:53,330 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-02 09:56:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:56:53,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 09:56:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:53,332 INFO L225 Difference]: With dead ends: 74 [2018-02-02 09:56:53,332 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 09:56:53,333 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-02 09:56:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 09:56:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 09:56:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 09:56:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-02 09:56:53,339 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-02 09:56:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:53,340 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-02 09:56:53,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:56:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-02 09:56:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 09:56:53,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:53,341 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:53,341 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-02 09:56:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-02 09:56:53,342 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:53,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:53,413 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-02 09:56:53,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:53,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:56:53,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:53,414 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-02 09:56:53,414 INFO L182 omatonBuilderFactory]: Interpolants [381#true, 382#false, 383#(and (= 0 ~garbage.base) (= 0 ~garbage.offset))] [2018-02-02 09:56:53,414 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-02 09:56:53,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:56:53,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:56:53,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:56:53,415 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-02 09:56:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:53,467 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-02 09:56:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:56:53,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-02 09:56:53,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:53,469 INFO L225 Difference]: With dead ends: 132 [2018-02-02 09:56:53,469 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 09:56:53,469 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-02 09:56:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 09:56:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-02 09:56:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 09:56:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-02 09:56:53,480 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-02 09:56:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:53,481 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-02 09:56:53,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:56:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-02 09:56:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:56:53,481 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:53,481 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:53,482 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-02 09:56:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-02 09:56:53,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:53,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:53,520 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-02 09:56:53,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:53,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:56:53,521 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:53,521 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-02 09:56:53,521 INFO L182 omatonBuilderFactory]: Interpolants [630#true, 631#false, 632#(= |#valid| |old(#valid)|)] [2018-02-02 09:56:53,521 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-02 09:56:53,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:56:53,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:56:53,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:56:53,522 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-02 09:56:53,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:53,572 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-02 09:56:53,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:56:53,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-02 09:56:53,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:53,574 INFO L225 Difference]: With dead ends: 147 [2018-02-02 09:56:53,574 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 09:56:53,574 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-02 09:56:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 09:56:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-02 09:56:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:56:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-02 09:56:53,583 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-02 09:56:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:53,584 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-02 09:56:53,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:56:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-02 09:56:53,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:56:53,585 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:53,585 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:53,585 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-02 09:56:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-02 09:56:53,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:53,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:53,625 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-02 09:56:53,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:53,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:56:53,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:53,626 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-02 09:56:53,626 INFO L182 omatonBuilderFactory]: Interpolants [915#true, 916#false, 917#(<= ~pc1 1), 918#(<= |push_#t~post0| 1), 919#(not |push_#t~switch1|)] [2018-02-02 09:56:53,626 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-02 09:56:53,626 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:56:53,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:56:53,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:56:53,626 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-02 09:56:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:53,681 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-02 09:56:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:56:53,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 09:56:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:53,683 INFO L225 Difference]: With dead ends: 255 [2018-02-02 09:56:53,684 INFO L226 Difference]: Without dead ends: 255 [2018-02-02 09:56:53,684 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-02 09:56:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-02 09:56:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-02 09:56:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 09:56:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-02 09:56:53,699 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-02 09:56:53,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:53,699 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-02 09:56:53,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:56:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-02 09:56:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:56:53,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:53,700 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:53,700 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-02 09:56:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-02 09:56:53,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:53,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:53,736 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-02 09:56:53,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:53,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:56:53,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:53,737 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-02 09:56:53,737 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-02 09:56:53,737 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-02 09:56:53,737 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:56:53,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:56:53,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:56:53,738 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-02 09:56:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:53,852 INFO L93 Difference]: Finished difference Result 388 states and 570 transitions. [2018-02-02 09:56:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:56:53,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 09:56:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:53,855 INFO L225 Difference]: With dead ends: 388 [2018-02-02 09:56:53,855 INFO L226 Difference]: Without dead ends: 388 [2018-02-02 09:56:53,855 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-02 09:56:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-02-02 09:56:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2018-02-02 09:56:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-02 09:56:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-02 09:56:53,873 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-02 09:56:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:53,874 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-02 09:56:53,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:56:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-02 09:56:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:56:53,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:53,875 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:53,875 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-02 09:56:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-02 09:56:53,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:53,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:53,931 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-02 09:56:53,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:53,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:56:53,931 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:53,932 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-02 09:56:53,932 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-02 09:56:53,932 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-02 09:56:53,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:56:53,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:56:53,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:56:53,933 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-02 09:56:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:54,063 INFO L93 Difference]: Finished difference Result 487 states and 717 transitions. [2018-02-02 09:56:54,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:56:54,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 09:56:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:54,068 INFO L225 Difference]: With dead ends: 487 [2018-02-02 09:56:54,068 INFO L226 Difference]: Without dead ends: 487 [2018-02-02 09:56:54,068 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-02 09:56:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-02-02 09:56:54,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 460. [2018-02-02 09:56:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-02 09:56:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-02 09:56:54,086 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-02 09:56:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:54,086 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-02 09:56:54,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:56:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-02 09:56:54,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:56:54,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:54,087 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:56:54,087 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-02 09:56:54,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-02 09:56:54,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:54,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:54,121 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-02 09:56:54,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:54,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:56:54,122 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:54,122 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-02 09:56:54,123 INFO L182 omatonBuilderFactory]: Interpolants [3108#true, 3109#false, 3110#(<= ~pc4 1), 3111#(<= |pop_#t~post7| 1), 3112#(not |pop_#t~switch8|)] [2018-02-02 09:56:54,123 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-02 09:56:54,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:56:54,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:56:54,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:56:54,124 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-02 09:56:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:54,172 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-02 09:56:54,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:56:54,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 09:56:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:54,177 INFO L225 Difference]: With dead ends: 861 [2018-02-02 09:56:54,177 INFO L226 Difference]: Without dead ends: 861 [2018-02-02 09:56:54,177 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-02 09:56:54,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-02 09:56:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-02 09:56:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-02 09:56:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-02 09:56:54,204 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-02 09:56:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:54,205 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-02 09:56:54,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:56:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-02 09:56:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:56:54,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:54,206 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-02 09:56:54,206 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-02 09:56:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-02 09:56:54,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:54,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:54,258 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-02 09:56:54,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:54,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 09:56:54,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:54,259 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-02 09:56:54,259 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-02 09:56:54,259 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-02 09:56:54,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:56:54,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:56:54,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:56:54,260 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-02 09:56:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:54,326 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-02 09:56:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:56:54,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 09:56:54,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:54,332 INFO L225 Difference]: With dead ends: 1289 [2018-02-02 09:56:54,333 INFO L226 Difference]: Without dead ends: 1289 [2018-02-02 09:56:54,333 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-02 09:56:54,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-02 09:56:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-02 09:56:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-02 09:56:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-02 09:56:54,366 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-02 09:56:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:54,366 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-02 09:56:54,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:56:54,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-02 09:56:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:56:54,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:54,368 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-02 09:56:54,368 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-02 09:56:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-02 09:56:54,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:54,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:54,456 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-02 09:56:54,456 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:54,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:56:54,456 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:54,456 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-02 09:56:54,456 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-02 09:56:54,456 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-02 09:56:54,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:56:54,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:56:54,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:56:54,457 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 10 states. [2018-02-02 09:56:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:55,184 INFO L93 Difference]: Finished difference Result 4157 states and 6578 transitions. [2018-02-02 09:56:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 09:56:55,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-02 09:56:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:55,225 INFO L225 Difference]: With dead ends: 4157 [2018-02-02 09:56:55,225 INFO L226 Difference]: Without dead ends: 4157 [2018-02-02 09:56:55,226 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-02 09:56:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2018-02-02 09:56:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 3278. [2018-02-02 09:56:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3278 states. [2018-02-02 09:56:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4768 transitions. [2018-02-02 09:56:55,344 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4768 transitions. Word has length 27 [2018-02-02 09:56:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:55,344 INFO L432 AbstractCegarLoop]: Abstraction has 3278 states and 4768 transitions. [2018-02-02 09:56:55,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:56:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4768 transitions. [2018-02-02 09:56:55,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 09:56:55,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:55,348 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-02 09:56:55,352 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-02 09:56:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-02-02 09:56:55,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:55,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:55,446 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-02 09:56:55,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:55,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:56:55,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:55,447 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-02 09:56:55,447 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-02 09:56:55,447 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-02 09:56:55,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:56:55,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:56:55,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:56:55,448 INFO L87 Difference]: Start difference. First operand 3278 states and 4768 transitions. Second operand 9 states. [2018-02-02 09:56:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:56,073 INFO L93 Difference]: Finished difference Result 8508 states and 13720 transitions. [2018-02-02 09:56:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:56:56,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-02 09:56:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:56,119 INFO L225 Difference]: With dead ends: 8508 [2018-02-02 09:56:56,119 INFO L226 Difference]: Without dead ends: 8508 [2018-02-02 09:56:56,120 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-02 09:56:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2018-02-02 09:56:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 6896. [2018-02-02 09:56:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2018-02-02 09:56:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 10048 transitions. [2018-02-02 09:56:56,375 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 10048 transitions. Word has length 27 [2018-02-02 09:56:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:56,375 INFO L432 AbstractCegarLoop]: Abstraction has 6896 states and 10048 transitions. [2018-02-02 09:56:56,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:56:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 10048 transitions. [2018-02-02 09:56:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:56:56,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:56,376 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-02 09:56:56,376 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-02 09:56:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-02 09:56:56,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:56,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:56,439 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-02 09:56:56,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:56,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:56:56,440 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:56,440 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-02 09:56:56,440 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-02 09:56:56,440 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-02 09:56:56,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:56:56,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:56:56,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:56:56,441 INFO L87 Difference]: Start difference. First operand 6896 states and 10048 transitions. Second operand 7 states. [2018-02-02 09:56:56,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:56,603 INFO L93 Difference]: Finished difference Result 4168 states and 5475 transitions. [2018-02-02 09:56:56,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:56:56,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-02 09:56:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:56,619 INFO L225 Difference]: With dead ends: 4168 [2018-02-02 09:56:56,620 INFO L226 Difference]: Without dead ends: 3736 [2018-02-02 09:56:56,620 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-02 09:56:56,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2018-02-02 09:56:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3409. [2018-02-02 09:56:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3409 states. [2018-02-02 09:56:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4605 transitions. [2018-02-02 09:56:56,704 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4605 transitions. Word has length 31 [2018-02-02 09:56:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:56,704 INFO L432 AbstractCegarLoop]: Abstraction has 3409 states and 4605 transitions. [2018-02-02 09:56:56,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:56:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4605 transitions. [2018-02-02 09:56:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:56:56,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:56,705 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-02 09:56:56,705 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-02 09:56:56,705 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-02 09:56:56,706 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:56,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:56,831 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-02 09:56:56,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:56,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:56:56,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:56,831 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-02 09:56:56,832 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-02 09:56:56,832 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-02 09:56:56,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:56:56,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:56:56,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:56:56,832 INFO L87 Difference]: Start difference. First operand 3409 states and 4605 transitions. Second operand 8 states. [2018-02-02 09:56:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:57,071 INFO L93 Difference]: Finished difference Result 4758 states and 6414 transitions. [2018-02-02 09:56:57,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:56:57,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-02 09:56:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:57,090 INFO L225 Difference]: With dead ends: 4758 [2018-02-02 09:56:57,090 INFO L226 Difference]: Without dead ends: 4758 [2018-02-02 09:56:57,091 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-02 09:56:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4758 states. [2018-02-02 09:56:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4758 to 4673. [2018-02-02 09:56:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4673 states. [2018-02-02 09:56:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 6333 transitions. [2018-02-02 09:56:57,215 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 6333 transitions. Word has length 31 [2018-02-02 09:56:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:57,215 INFO L432 AbstractCegarLoop]: Abstraction has 4673 states and 6333 transitions. [2018-02-02 09:56:57,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:56:57,215 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 6333 transitions. [2018-02-02 09:56:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:56:57,216 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:57,216 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-02 09:56:57,216 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-02 09:56:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2106794323, now seen corresponding path program 1 times [2018-02-02 09:56:57,217 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:57,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:57,311 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-02 09:56:57,312 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:57,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:56:57,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:57,312 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-02 09:56:57,312 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-02 09:56:57,312 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-02 09:56:57,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:56:57,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:56:57,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:56:57,313 INFO L87 Difference]: Start difference. First operand 4673 states and 6333 transitions. Second operand 7 states. [2018-02-02 09:56:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:57,589 INFO L93 Difference]: Finished difference Result 5922 states and 7990 transitions. [2018-02-02 09:56:57,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:56:57,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-02 09:56:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:57,629 INFO L225 Difference]: With dead ends: 5922 [2018-02-02 09:56:57,629 INFO L226 Difference]: Without dead ends: 5922 [2018-02-02 09:56:57,630 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-02 09:56:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2018-02-02 09:56:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 5825. [2018-02-02 09:56:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2018-02-02 09:56:57,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7893 transitions. [2018-02-02 09:56:57,741 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7893 transitions. Word has length 33 [2018-02-02 09:56:57,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:57,741 INFO L432 AbstractCegarLoop]: Abstraction has 5825 states and 7893 transitions. [2018-02-02 09:56:57,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:56:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7893 transitions. [2018-02-02 09:56:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 09:56:57,742 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:57,743 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-02 09:56:57,743 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-02 09:56:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-02 09:56:57,744 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:57,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:57,839 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-02 09:56:57,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:57,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:56:57,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:57,840 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-02 09:56:57,840 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-02 09:56:57,840 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-02 09:56:57,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:56:57,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:56:57,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:56:57,840 INFO L87 Difference]: Start difference. First operand 5825 states and 7893 transitions. Second operand 8 states. [2018-02-02 09:56:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:58,194 INFO L93 Difference]: Finished difference Result 6688 states and 9145 transitions. [2018-02-02 09:56:58,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:56:58,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 09:56:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:58,223 INFO L225 Difference]: With dead ends: 6688 [2018-02-02 09:56:58,223 INFO L226 Difference]: Without dead ends: 6688 [2018-02-02 09:56:58,223 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-02 09:56:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2018-02-02 09:56:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 5773. [2018-02-02 09:56:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5773 states. [2018-02-02 09:56:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5773 states to 5773 states and 7730 transitions. [2018-02-02 09:56:58,359 INFO L78 Accepts]: Start accepts. Automaton has 5773 states and 7730 transitions. Word has length 38 [2018-02-02 09:56:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:58,359 INFO L432 AbstractCegarLoop]: Abstraction has 5773 states and 7730 transitions. [2018-02-02 09:56:58,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:56:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5773 states and 7730 transitions. [2018-02-02 09:56:58,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 09:56:58,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:58,361 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-02 09:56:58,361 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-02 09:56:58,361 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-02 09:56:58,362 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:58,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:58,452 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-02 09:56:58,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:58,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:56:58,453 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:58,453 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-02 09:56:58,453 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-02 09:56:58,453 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-02 09:56:58,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:56:58,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:56:58,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:56:58,454 INFO L87 Difference]: Start difference. First operand 5773 states and 7730 transitions. Second operand 11 states. [2018-02-02 09:56:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:59,243 INFO L93 Difference]: Finished difference Result 8708 states and 13062 transitions. [2018-02-02 09:56:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 09:56:59,244 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-02-02 09:56:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:59,272 INFO L225 Difference]: With dead ends: 8708 [2018-02-02 09:56:59,272 INFO L226 Difference]: Without dead ends: 8708 [2018-02-02 09:56:59,273 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-02 09:56:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8708 states. [2018-02-02 09:56:59,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8708 to 7176. [2018-02-02 09:56:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7176 states. [2018-02-02 09:56:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7176 states to 7176 states and 9757 transitions. [2018-02-02 09:56:59,464 INFO L78 Accepts]: Start accepts. Automaton has 7176 states and 9757 transitions. Word has length 42 [2018-02-02 09:56:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:59,464 INFO L432 AbstractCegarLoop]: Abstraction has 7176 states and 9757 transitions. [2018-02-02 09:56:59,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:56:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7176 states and 9757 transitions. [2018-02-02 09:56:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:56:59,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:59,467 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-02 09:56:59,467 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-02 09:56:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1272667095, now seen corresponding path program 1 times [2018-02-02 09:56:59,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:59,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:59,515 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-02 09:56:59,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:56:59,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:56:59,516 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:59,516 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-02 09:56:59,516 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-02 09:56:59,516 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-02 09:56:59,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:56:59,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:56:59,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:56:59,517 INFO L87 Difference]: Start difference. First operand 7176 states and 9757 transitions. Second operand 5 states. [2018-02-02 09:56:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:56:59,577 INFO L93 Difference]: Finished difference Result 8911 states and 12341 transitions. [2018-02-02 09:56:59,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:56:59,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-02 09:56:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:56:59,603 INFO L225 Difference]: With dead ends: 8911 [2018-02-02 09:56:59,603 INFO L226 Difference]: Without dead ends: 8911 [2018-02-02 09:56:59,603 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-02 09:56:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8911 states. [2018-02-02 09:56:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8911 to 8737. [2018-02-02 09:56:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8737 states. [2018-02-02 09:56:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8737 states to 8737 states and 12077 transitions. [2018-02-02 09:56:59,737 INFO L78 Accepts]: Start accepts. Automaton has 8737 states and 12077 transitions. Word has length 47 [2018-02-02 09:56:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:56:59,737 INFO L432 AbstractCegarLoop]: Abstraction has 8737 states and 12077 transitions. [2018-02-02 09:56:59,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:56:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8737 states and 12077 transitions. [2018-02-02 09:56:59,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:56:59,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:56:59,739 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-02 09:56:59,739 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-02 09:56:59,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1079771155, now seen corresponding path program 1 times [2018-02-02 09:56:59,740 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:56:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:56:59,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:56:59,878 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-02 09:56:59,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:56:59,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:56:59,879 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:56:59,879 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-02 09:56:59,879 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-02 09:56:59,879 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-02 09:56:59,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:56:59,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:56:59,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:56:59,880 INFO L87 Difference]: Start difference. First operand 8737 states and 12077 transitions. Second operand 10 states. [2018-02-02 09:57:00,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:00,208 INFO L93 Difference]: Finished difference Result 8392 states and 11461 transitions. [2018-02-02 09:57:00,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:00,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-02 09:57:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:00,231 INFO L225 Difference]: With dead ends: 8392 [2018-02-02 09:57:00,231 INFO L226 Difference]: Without dead ends: 8233 [2018-02-02 09:57:00,232 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-02 09:57:00,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2018-02-02 09:57:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 7953. [2018-02-02 09:57:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7953 states. [2018-02-02 09:57:00,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 10917 transitions. [2018-02-02 09:57:00,358 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 10917 transitions. Word has length 47 [2018-02-02 09:57:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:00,358 INFO L432 AbstractCegarLoop]: Abstraction has 7953 states and 10917 transitions. [2018-02-02 09:57:00,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:57:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 10917 transitions. [2018-02-02 09:57:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 09:57:00,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:00,360 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-02 09:57:00,360 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-02 09:57:00,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1244589299, now seen corresponding path program 1 times [2018-02-02 09:57:00,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:00,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:00,426 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-02 09:57:00,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:00,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 09:57:00,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:00,427 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-02 09:57:00,427 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-02 09:57:00,427 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-02 09:57:00,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:57:00,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:57:00,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:57:00,428 INFO L87 Difference]: Start difference. First operand 7953 states and 10917 transitions. Second operand 8 states. [2018-02-02 09:57:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:00,712 INFO L93 Difference]: Finished difference Result 7731 states and 10907 transitions. [2018-02-02 09:57:00,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:00,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-02-02 09:57:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:00,733 INFO L225 Difference]: With dead ends: 7731 [2018-02-02 09:57:00,734 INFO L226 Difference]: Without dead ends: 7731 [2018-02-02 09:57:00,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:57:00,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7731 states. [2018-02-02 09:57:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7731 to 7133. [2018-02-02 09:57:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7133 states. [2018-02-02 09:57:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9644 transitions. [2018-02-02 09:57:00,843 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9644 transitions. Word has length 49 [2018-02-02 09:57:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:00,844 INFO L432 AbstractCegarLoop]: Abstraction has 7133 states and 9644 transitions. [2018-02-02 09:57:00,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:57:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9644 transitions. [2018-02-02 09:57:00,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:57:00,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:00,847 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-02 09:57:00,847 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-02 09:57:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-02 09:57:00,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:00,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:00,922 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-02 09:57:00,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:00,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:00,922 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:00,923 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-02 09:57:00,923 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-02 09:57:00,923 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-02 09:57:00,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:00,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:00,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:00,924 INFO L87 Difference]: Start difference. First operand 7133 states and 9644 transitions. Second operand 9 states. [2018-02-02 09:57:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:01,165 INFO L93 Difference]: Finished difference Result 9487 states and 13279 transitions. [2018-02-02 09:57:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:01,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-02 09:57:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:01,191 INFO L225 Difference]: With dead ends: 9487 [2018-02-02 09:57:01,192 INFO L226 Difference]: Without dead ends: 9487 [2018-02-02 09:57:01,192 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-02 09:57:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2018-02-02 09:57:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 7857. [2018-02-02 09:57:01,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-02-02 09:57:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 10833 transitions. [2018-02-02 09:57:01,321 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 10833 transitions. Word has length 54 [2018-02-02 09:57:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:01,322 INFO L432 AbstractCegarLoop]: Abstraction has 7857 states and 10833 transitions. [2018-02-02 09:57:01,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 10833 transitions. [2018-02-02 09:57:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 09:57:01,324 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:01,324 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-02 09:57:01,324 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-02 09:57:01,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-02 09:57:01,325 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:01,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:01,395 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-02 09:57:01,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:01,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:01,396 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:01,396 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-02 09:57:01,396 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-02 09:57:01,396 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-02 09:57:01,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:01,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:01,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:01,397 INFO L87 Difference]: Start difference. First operand 7857 states and 10833 transitions. Second operand 9 states. [2018-02-02 09:57:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:01,652 INFO L93 Difference]: Finished difference Result 9947 states and 14391 transitions. [2018-02-02 09:57:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:01,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-02 09:57:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:01,678 INFO L225 Difference]: With dead ends: 9947 [2018-02-02 09:57:01,678 INFO L226 Difference]: Without dead ends: 9947 [2018-02-02 09:57:01,679 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-02 09:57:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9947 states. [2018-02-02 09:57:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9947 to 7857. [2018-02-02 09:57:01,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-02-02 09:57:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 10833 transitions. [2018-02-02 09:57:01,894 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 10833 transitions. Word has length 54 [2018-02-02 09:57:01,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:01,895 INFO L432 AbstractCegarLoop]: Abstraction has 7857 states and 10833 transitions. [2018-02-02 09:57:01,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 10833 transitions. [2018-02-02 09:57:01,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 09:57:01,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:01,897 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-02 09:57:01,897 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-02 09:57:01,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1006007847, now seen corresponding path program 1 times [2018-02-02 09:57:01,898 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:01,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:02,088 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-02 09:57:02,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:02,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:02,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:02,088 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-02 09:57:02,088 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-02 09:57:02,088 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-02 09:57:02,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:02,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:02,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:02,089 INFO L87 Difference]: Start difference. First operand 7857 states and 10833 transitions. Second operand 9 states. [2018-02-02 09:57:02,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:02,379 INFO L93 Difference]: Finished difference Result 9915 states and 14327 transitions. [2018-02-02 09:57:02,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:02,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-02-02 09:57:02,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:02,405 INFO L225 Difference]: With dead ends: 9915 [2018-02-02 09:57:02,405 INFO L226 Difference]: Without dead ends: 9915 [2018-02-02 09:57:02,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:57:02,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9915 states. [2018-02-02 09:57:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9915 to 7857. [2018-02-02 09:57:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7857 states. [2018-02-02 09:57:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7857 states to 7857 states and 10833 transitions. [2018-02-02 09:57:02,569 INFO L78 Accepts]: Start accepts. Automaton has 7857 states and 10833 transitions. Word has length 56 [2018-02-02 09:57:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:02,569 INFO L432 AbstractCegarLoop]: Abstraction has 7857 states and 10833 transitions. [2018-02-02 09:57:02,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 7857 states and 10833 transitions. [2018-02-02 09:57:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 09:57:02,572 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:02,572 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-02 09:57:02,572 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-02 09:57:02,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1207017357, now seen corresponding path program 1 times [2018-02-02 09:57:02,573 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:02,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:02,741 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-02 09:57:02,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:02,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:02,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:02,742 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-02 09:57:02,742 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-02 09:57:02,742 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-02 09:57:02,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:02,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:02,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:02,743 INFO L87 Difference]: Start difference. First operand 7857 states and 10833 transitions. Second operand 9 states. [2018-02-02 09:57:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:03,132 INFO L93 Difference]: Finished difference Result 14394 states and 20271 transitions. [2018-02-02 09:57:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:57:03,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-02-02 09:57:03,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:03,156 INFO L225 Difference]: With dead ends: 14394 [2018-02-02 09:57:03,156 INFO L226 Difference]: Without dead ends: 14394 [2018-02-02 09:57:03,157 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:57:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14394 states. [2018-02-02 09:57:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14394 to 14013. [2018-02-02 09:57:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14013 states. [2018-02-02 09:57:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14013 states to 14013 states and 19721 transitions. [2018-02-02 09:57:03,403 INFO L78 Accepts]: Start accepts. Automaton has 14013 states and 19721 transitions. Word has length 57 [2018-02-02 09:57:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:03,403 INFO L432 AbstractCegarLoop]: Abstraction has 14013 states and 19721 transitions. [2018-02-02 09:57:03,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14013 states and 19721 transitions. [2018-02-02 09:57:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 09:57:03,406 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:03,406 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-02 09:57:03,406 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-02 09:57:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1674128402, now seen corresponding path program 1 times [2018-02-02 09:57:03,407 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:03,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:03,546 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-02 09:57:03,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:03,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:03,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:03,547 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-02 09:57:03,547 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-02 09:57:03,547 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-02 09:57:03,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:03,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:03,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:03,550 INFO L87 Difference]: Start difference. First operand 14013 states and 19721 transitions. Second operand 9 states. [2018-02-02 09:57:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:03,909 INFO L93 Difference]: Finished difference Result 16596 states and 24399 transitions. [2018-02-02 09:57:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:57:03,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-02-02 09:57:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:03,943 INFO L225 Difference]: With dead ends: 16596 [2018-02-02 09:57:03,943 INFO L226 Difference]: Without dead ends: 16500 [2018-02-02 09:57:03,943 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-02 09:57:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16500 states. [2018-02-02 09:57:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16500 to 11044. [2018-02-02 09:57:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11044 states. [2018-02-02 09:57:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 15542 transitions. [2018-02-02 09:57:04,146 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 15542 transitions. Word has length 58 [2018-02-02 09:57:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:04,147 INFO L432 AbstractCegarLoop]: Abstraction has 11044 states and 15542 transitions. [2018-02-02 09:57:04,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 15542 transitions. [2018-02-02 09:57:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 09:57:04,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:04,150 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-02 09:57:04,150 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-02 09:57:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash -698837692, now seen corresponding path program 1 times [2018-02-02 09:57:04,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:04,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:04,272 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-02 09:57:04,272 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:04,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:57:04,272 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:04,272 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-02 09:57:04,273 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-02 09:57:04,273 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-02 09:57:04,273 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:57:04,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:57:04,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:57:04,273 INFO L87 Difference]: Start difference. First operand 11044 states and 15542 transitions. Second operand 11 states. [2018-02-02 09:57:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:05,483 INFO L93 Difference]: Finished difference Result 20780 states and 29409 transitions. [2018-02-02 09:57:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:57:05,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-02 09:57:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:05,528 INFO L225 Difference]: With dead ends: 20780 [2018-02-02 09:57:05,528 INFO L226 Difference]: Without dead ends: 20644 [2018-02-02 09:57:05,528 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:57:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20644 states. [2018-02-02 09:57:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20644 to 19665. [2018-02-02 09:57:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19665 states. [2018-02-02 09:57:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 27717 transitions. [2018-02-02 09:57:05,826 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 27717 transitions. Word has length 67 [2018-02-02 09:57:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:05,826 INFO L432 AbstractCegarLoop]: Abstraction has 19665 states and 27717 transitions. [2018-02-02 09:57:05,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:57:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 27717 transitions. [2018-02-02 09:57:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 09:57:05,830 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:05,830 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-02 09:57:05,830 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-02 09:57:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash -698837691, now seen corresponding path program 1 times [2018-02-02 09:57:05,831 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:05,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:05,912 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-02 09:57:05,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:05,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:05,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:05,912 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-02 09:57:05,913 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-02 09:57:05,913 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-02 09:57:05,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:05,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:05,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:05,913 INFO L87 Difference]: Start difference. First operand 19665 states and 27717 transitions. Second operand 9 states. [2018-02-02 09:57:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:06,160 INFO L93 Difference]: Finished difference Result 24179 states and 34471 transitions. [2018-02-02 09:57:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:57:06,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-02-02 09:57:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:06,197 INFO L225 Difference]: With dead ends: 24179 [2018-02-02 09:57:06,197 INFO L226 Difference]: Without dead ends: 24179 [2018-02-02 09:57:06,197 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-02 09:57:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24179 states. [2018-02-02 09:57:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24179 to 23154. [2018-02-02 09:57:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23154 states. [2018-02-02 09:57:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23154 states to 23154 states and 32877 transitions. [2018-02-02 09:57:06,643 INFO L78 Accepts]: Start accepts. Automaton has 23154 states and 32877 transitions. Word has length 67 [2018-02-02 09:57:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:06,643 INFO L432 AbstractCegarLoop]: Abstraction has 23154 states and 32877 transitions. [2018-02-02 09:57:06,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 23154 states and 32877 transitions. [2018-02-02 09:57:06,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 09:57:06,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:06,647 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-02 09:57:06,647 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-02 09:57:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2040879096, now seen corresponding path program 1 times [2018-02-02 09:57:06,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:06,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:06,730 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-02 09:57:06,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:06,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:06,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:06,731 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-02 09:57:06,731 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-02 09:57:06,732 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-02 09:57:06,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:06,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:06,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:06,732 INFO L87 Difference]: Start difference. First operand 23154 states and 32877 transitions. Second operand 9 states. [2018-02-02 09:57:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:06,980 INFO L93 Difference]: Finished difference Result 29149 states and 42555 transitions. [2018-02-02 09:57:06,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:06,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-02-02 09:57:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:07,037 INFO L225 Difference]: With dead ends: 29149 [2018-02-02 09:57:07,038 INFO L226 Difference]: Without dead ends: 29149 [2018-02-02 09:57:07,038 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-02 09:57:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29149 states. [2018-02-02 09:57:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29149 to 26079. [2018-02-02 09:57:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26079 states. [2018-02-02 09:57:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26079 states to 26079 states and 37263 transitions. [2018-02-02 09:57:07,342 INFO L78 Accepts]: Start accepts. Automaton has 26079 states and 37263 transitions. Word has length 79 [2018-02-02 09:57:07,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:07,342 INFO L432 AbstractCegarLoop]: Abstraction has 26079 states and 37263 transitions. [2018-02-02 09:57:07,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26079 states and 37263 transitions. [2018-02-02 09:57:07,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 09:57:07,348 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:07,348 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-02 09:57:07,348 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-02 09:57:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash -968199174, now seen corresponding path program 1 times [2018-02-02 09:57:07,349 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:07,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:07,659 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-02 09:57:07,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:07,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:07,659 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:07,660 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-02 09:57:07,660 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-02 09:57:07,660 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-02 09:57:07,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:07,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:07,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:07,660 INFO L87 Difference]: Start difference. First operand 26079 states and 37263 transitions. Second operand 9 states. [2018-02-02 09:57:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:07,954 INFO L93 Difference]: Finished difference Result 32004 states and 47553 transitions. [2018-02-02 09:57:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:07,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-02-02 09:57:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:08,009 INFO L225 Difference]: With dead ends: 32004 [2018-02-02 09:57:08,009 INFO L226 Difference]: Without dead ends: 32004 [2018-02-02 09:57:08,009 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-02 09:57:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32004 states. [2018-02-02 09:57:08,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32004 to 26079. [2018-02-02 09:57:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26079 states. [2018-02-02 09:57:08,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26079 states to 26079 states and 37263 transitions. [2018-02-02 09:57:08,325 INFO L78 Accepts]: Start accepts. Automaton has 26079 states and 37263 transitions. Word has length 79 [2018-02-02 09:57:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:08,325 INFO L432 AbstractCegarLoop]: Abstraction has 26079 states and 37263 transitions. [2018-02-02 09:57:08,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:08,325 INFO L276 IsEmpty]: Start isEmpty. Operand 26079 states and 37263 transitions. [2018-02-02 09:57:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 09:57:08,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:08,329 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-02 09:57:08,330 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-02 09:57:08,330 INFO L82 PathProgramCache]: Analyzing trace with hash 596782844, now seen corresponding path program 1 times [2018-02-02 09:57:08,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:08,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:08,464 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-02 09:57:08,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:08,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:08,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:08,465 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-02 09:57:08,465 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-02 09:57:08,465 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-02 09:57:08,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:08,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:08,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:08,466 INFO L87 Difference]: Start difference. First operand 26079 states and 37263 transitions. Second operand 9 states. [2018-02-02 09:57:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:08,783 INFO L93 Difference]: Finished difference Result 29055 states and 42207 transitions. [2018-02-02 09:57:08,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:57:08,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-02-02 09:57:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:08,838 INFO L225 Difference]: With dead ends: 29055 [2018-02-02 09:57:08,838 INFO L226 Difference]: Without dead ends: 29055 [2018-02-02 09:57:08,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:57:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29055 states. [2018-02-02 09:57:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29055 to 28598. [2018-02-02 09:57:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28598 states. [2018-02-02 09:57:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28598 states to 28598 states and 41591 transitions. [2018-02-02 09:57:09,486 INFO L78 Accepts]: Start accepts. Automaton has 28598 states and 41591 transitions. Word has length 81 [2018-02-02 09:57:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:09,487 INFO L432 AbstractCegarLoop]: Abstraction has 28598 states and 41591 transitions. [2018-02-02 09:57:09,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 28598 states and 41591 transitions. [2018-02-02 09:57:09,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 09:57:09,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:09,490 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-02 09:57:09,490 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-02 09:57:09,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1852600825, now seen corresponding path program 1 times [2018-02-02 09:57:09,491 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:09,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:09,648 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-02 09:57:09,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:09,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:57:09,649 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:09,649 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-02 09:57:09,649 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-02 09:57:09,649 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-02 09:57:09,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:57:09,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:57:09,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:57:09,650 INFO L87 Difference]: Start difference. First operand 28598 states and 41591 transitions. Second operand 10 states. [2018-02-02 09:57:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:09,965 INFO L93 Difference]: Finished difference Result 35599 states and 52366 transitions. [2018-02-02 09:57:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:09,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-02-02 09:57:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:10,029 INFO L225 Difference]: With dead ends: 35599 [2018-02-02 09:57:10,030 INFO L226 Difference]: Without dead ends: 35599 [2018-02-02 09:57:10,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:57:10,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35599 states. [2018-02-02 09:57:10,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35599 to 28100. [2018-02-02 09:57:10,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28100 states. [2018-02-02 09:57:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28100 states to 28100 states and 39811 transitions. [2018-02-02 09:57:10,392 INFO L78 Accepts]: Start accepts. Automaton has 28100 states and 39811 transitions. Word has length 83 [2018-02-02 09:57:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:10,392 INFO L432 AbstractCegarLoop]: Abstraction has 28100 states and 39811 transitions. [2018-02-02 09:57:10,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:57:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 28100 states and 39811 transitions. [2018-02-02 09:57:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:57:10,395 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:10,395 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-02 09:57:10,395 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-02 09:57:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 751746159, now seen corresponding path program 1 times [2018-02-02 09:57:10,396 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:10,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:10,490 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-02 09:57:10,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:10,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:10,490 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:10,491 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-02 09:57:10,491 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-02 09:57:10,491 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-02 09:57:10,491 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:10,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:10,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:10,492 INFO L87 Difference]: Start difference. First operand 28100 states and 39811 transitions. Second operand 9 states. [2018-02-02 09:57:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:10,880 INFO L93 Difference]: Finished difference Result 34025 states and 50183 transitions. [2018-02-02 09:57:10,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:10,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-02-02 09:57:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:10,947 INFO L225 Difference]: With dead ends: 34025 [2018-02-02 09:57:10,947 INFO L226 Difference]: Without dead ends: 34025 [2018-02-02 09:57:10,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:57:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34025 states. [2018-02-02 09:57:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34025 to 30955. [2018-02-02 09:57:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2018-02-02 09:57:11,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 44543 transitions. [2018-02-02 09:57:11,299 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 44543 transitions. Word has length 93 [2018-02-02 09:57:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:11,300 INFO L432 AbstractCegarLoop]: Abstraction has 30955 states and 44543 transitions. [2018-02-02 09:57:11,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 44543 transitions. [2018-02-02 09:57:11,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:57:11,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:11,303 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-02 09:57:11,303 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-02 09:57:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1475760911, now seen corresponding path program 1 times [2018-02-02 09:57:11,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:11,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:11,378 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-02 09:57:11,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:11,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:57:11,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:11,379 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-02 09:57:11,379 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-02 09:57:11,379 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-02 09:57:11,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:57:11,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:57:11,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:57:11,380 INFO L87 Difference]: Start difference. First operand 30955 states and 44543 transitions. Second operand 9 states. [2018-02-02 09:57:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:11,671 INFO L93 Difference]: Finished difference Result 33931 states and 49835 transitions. [2018-02-02 09:57:11,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:57:11,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-02-02 09:57:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:11,735 INFO L225 Difference]: With dead ends: 33931 [2018-02-02 09:57:11,735 INFO L226 Difference]: Without dead ends: 33931 [2018-02-02 09:57:11,735 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-02 09:57:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33931 states. [2018-02-02 09:57:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33931 to 33474. [2018-02-02 09:57:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33474 states. [2018-02-02 09:57:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33474 states to 33474 states and 49120 transitions. [2018-02-02 09:57:12,323 INFO L78 Accepts]: Start accepts. Automaton has 33474 states and 49120 transitions. Word has length 93 [2018-02-02 09:57:12,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:12,347 INFO L432 AbstractCegarLoop]: Abstraction has 33474 states and 49120 transitions. [2018-02-02 09:57:12,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:57:12,349 INFO L276 IsEmpty]: Start isEmpty. Operand 33474 states and 49120 transitions. [2018-02-02 09:57:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 09:57:12,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:12,358 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-02 09:57:12,358 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-02 09:57:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1484893246, now seen corresponding path program 1 times [2018-02-02 09:57:12,359 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:12,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:12,921 WARN L143 SmtUtils]: Spent 288ms on a formula simplification that was a NOOP. DAG size: 8 [2018-02-02 09:57:12,936 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-02 09:57:12,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:12,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:57:12,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:12,937 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-02 09:57:12,937 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-02 09:57:12,937 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-02 09:57:12,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:57:12,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:57:12,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:57:12,938 INFO L87 Difference]: Start difference. First operand 33474 states and 49120 transitions. Second operand 10 states. [2018-02-02 09:57:13,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:13,289 INFO L93 Difference]: Finished difference Result 40475 states and 59908 transitions. [2018-02-02 09:57:13,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:57:13,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-02-02 09:57:13,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:13,368 INFO L225 Difference]: With dead ends: 40475 [2018-02-02 09:57:13,368 INFO L226 Difference]: Without dead ends: 40475 [2018-02-02 09:57:13,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:57:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40475 states. [2018-02-02 09:57:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40475 to 32976. [2018-02-02 09:57:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32976 states. [2018-02-02 09:57:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32976 states to 32976 states and 47005 transitions. [2018-02-02 09:57:13,773 INFO L78 Accepts]: Start accepts. Automaton has 32976 states and 47005 transitions. Word has length 97 [2018-02-02 09:57:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:13,774 INFO L432 AbstractCegarLoop]: Abstraction has 32976 states and 47005 transitions. [2018-02-02 09:57:13,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:57:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 32976 states and 47005 transitions. [2018-02-02 09:57:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 09:57:13,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:13,778 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-02 09:57:13,778 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-02 09:57:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash 112633316, now seen corresponding path program 1 times [2018-02-02 09:57:13,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:13,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:13,974 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-02 09:57:13,975 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:13,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 09:57:13,975 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:13,975 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-02 09:57:13,975 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-02 09:57:13,975 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-02 09:57:13,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:57:13,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:57:13,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:57:13,976 INFO L87 Difference]: Start difference. First operand 32976 states and 47005 transitions. Second operand 11 states. [2018-02-02 09:57:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:15,519 INFO L93 Difference]: Finished difference Result 50060 states and 72823 transitions. [2018-02-02 09:57:15,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:57:15,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2018-02-02 09:57:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:15,611 INFO L225 Difference]: With dead ends: 50060 [2018-02-02 09:57:15,611 INFO L226 Difference]: Without dead ends: 50060 [2018-02-02 09:57:15,611 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-02 09:57:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50060 states. [2018-02-02 09:57:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50060 to 48452. [2018-02-02 09:57:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48452 states. [2018-02-02 09:57:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48452 states to 48452 states and 69183 transitions. [2018-02-02 09:57:16,140 INFO L78 Accepts]: Start accepts. Automaton has 48452 states and 69183 transitions. Word has length 105 [2018-02-02 09:57:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:16,140 INFO L432 AbstractCegarLoop]: Abstraction has 48452 states and 69183 transitions. [2018-02-02 09:57:16,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:57:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 48452 states and 69183 transitions. [2018-02-02 09:57:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 09:57:16,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:16,150 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-02 09:57:16,150 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-02 09:57:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1707311773, now seen corresponding path program 1 times [2018-02-02 09:57:16,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:16,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:16,289 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-02 09:57:16,289 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:16,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:57:16,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:16,289 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-02 09:57:16,289 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-02 09:57:16,290 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-02 09:57:16,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:57:16,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:57:16,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:57:16,290 INFO L87 Difference]: Start difference. First operand 48452 states and 69183 transitions. Second operand 11 states. [2018-02-02 09:57:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:17,496 INFO L93 Difference]: Finished difference Result 91049 states and 127932 transitions. [2018-02-02 09:57:17,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 09:57:17,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 141 [2018-02-02 09:57:17,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:17,693 INFO L225 Difference]: With dead ends: 91049 [2018-02-02 09:57:17,693 INFO L226 Difference]: Without dead ends: 90381 [2018-02-02 09:57:17,694 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=398, Invalid=1672, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:57:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90381 states. [2018-02-02 09:57:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90381 to 87571. [2018-02-02 09:57:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87571 states. [2018-02-02 09:57:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87571 states to 87571 states and 123169 transitions. [2018-02-02 09:57:19,191 INFO L78 Accepts]: Start accepts. Automaton has 87571 states and 123169 transitions. Word has length 141 [2018-02-02 09:57:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:19,192 INFO L432 AbstractCegarLoop]: Abstraction has 87571 states and 123169 transitions. [2018-02-02 09:57:19,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:57:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 87571 states and 123169 transitions. [2018-02-02 09:57:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-02-02 09:57:19,205 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:19,205 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-02 09:57:19,205 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-02 09:57:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1748393166, now seen corresponding path program 1 times [2018-02-02 09:57:19,206 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:19,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:19,352 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-02 09:57:19,353 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:57:19,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:57:19,353 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:19,353 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-02 09:57:19,353 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-02 09:57:19,353 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-02 09:57:19,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:57:19,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:57:19,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:57:19,354 INFO L87 Difference]: Start difference. First operand 87571 states and 123169 transitions. Second operand 12 states. [2018-02-02 09:57:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:22,062 INFO L93 Difference]: Finished difference Result 118747 states and 183254 transitions. [2018-02-02 09:57:22,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-02-02 09:57:22,063 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2018-02-02 09:57:22,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:22,357 INFO L225 Difference]: With dead ends: 118747 [2018-02-02 09:57:22,357 INFO L226 Difference]: Without dead ends: 118563 [2018-02-02 09:57:22,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=814, Invalid=4736, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 09:57:22,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118563 states. [2018-02-02 09:57:23,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118563 to 115623. [2018-02-02 09:57:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115623 states. [2018-02-02 09:57:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115623 states to 115623 states and 173947 transitions. [2018-02-02 09:57:26,290 INFO L78 Accepts]: Start accepts. Automaton has 115623 states and 173947 transitions. Word has length 143 [2018-02-02 09:57:26,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:57:26,290 INFO L432 AbstractCegarLoop]: Abstraction has 115623 states and 173947 transitions. [2018-02-02 09:57:26,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:57:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 115623 states and 173947 transitions. [2018-02-02 09:57:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 09:57:26,305 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:57:26,305 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-02 09:57:26,305 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-02 09:57:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash 738810213, now seen corresponding path program 1 times [2018-02-02 09:57:26,306 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:57:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:57:26,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:57:26,361 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-02 09:57:26,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:57:26,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:57:26,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:57:26,362 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-02 09:57:26,363 INFO L182 omatonBuilderFactory]: Interpolants [1286039#(= 1 (select |#valid| ~t4~0.base)), 1286038#false, 1286037#true, 1286040#(= 1 (select |#valid| ~garbage.base))] [2018-02-02 09:57:26,363 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-02 09:57:26,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:57:26,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:57:26,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:57:26,364 INFO L87 Difference]: Start difference. First operand 115623 states and 173947 transitions. Second operand 4 states. [2018-02-02 09:57:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:57:26,952 INFO L93 Difference]: Finished difference Result 136659 states and 205996 transitions. [2018-02-02 09:57:26,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:57:26,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-02-02 09:57:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:57:27,294 INFO L225 Difference]: With dead ends: 136659 [2018-02-02 09:57:27,294 INFO L226 Difference]: Without dead ends: 136387 [2018-02-02 09:57:27,294 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-02 09:57:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136387 states. [2018-02-02 09:57:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136387 to 135218. [2018-02-02 09:57:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135218 states. Received shutdown request... [2018-02-02 09:57:29,261 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:57:29,265 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:57:29,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:57:29 BoogieIcfgContainer [2018-02-02 09:57:29,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:57:29,266 INFO L168 Benchmark]: Toolchain (without parser) took 36840.17 ms. Allocated memory was 400.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 357.2 MB in the beginning and 765.4 MB in the end (delta: -408.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 5.3 GB. [2018-02-02 09:57:29,267 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:57:29,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.65 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:57:29,267 INFO L168 Benchmark]: Boogie Preprocessor took 32.60 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:57:29,267 INFO L168 Benchmark]: RCFGBuilder took 277.66 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 316.1 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:57:29,267 INFO L168 Benchmark]: TraceAbstraction took 36353.37 ms. Allocated memory was 400.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 316.1 MB in the beginning and 765.4 MB in the end (delta: -449.3 MB). Peak memory consumption was 2.2 GB. Max. memory is 5.3 GB. [2018-02-02 09:57:29,268 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.20 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 173.65 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 346.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 32.60 ms. Allocated memory is still 400.6 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 277.66 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 316.1 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 36353.37 ms. Allocated memory was 400.6 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 316.1 MB in the beginning and 765.4 MB in the end (delta: -449.3 MB). Peak memory consumption was 2.2 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 ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 698). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 697). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while ReachableStatesComputation was computing reachable states (86072 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. TIMEOUT Result, 36.3s OverallTime, 37 OverallIterations, 11 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4008 SDtfs, 9304 SDslu, 8517 SDs, 0 SdLazy, 13417 SolverSat, 2252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 874 GetRequests, 265 SyntacticMatches, 3 SemanticMatches, 606 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4837 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115623occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2177/2841 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 14.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 55667 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2062 NumberOfCodeBlocks, 2062 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2025 ConstructedInterpolants, 0 QuantifiedInterpolants, 512044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 11 PerfectInterpolantSequences, 2177/2841 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-02_09-57-29-273.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-02_09-57-29-273.csv Completed graceful shutdown