java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:03:41,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:03:41,924 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:03:41,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:03:41,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:03:41,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:03:41,936 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:03:41,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:03:41,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:03:41,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:03:41,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:03:41,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:03:41,941 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:03:41,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:03:41,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:03:41,944 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:03:41,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:03:41,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:03:41,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:03:41,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:03:41,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:03:41,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:03:41,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:03:41,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:03:41,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:03:41,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:03:41,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:03:41,954 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:03:41,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:03:41,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:03:41,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:03:41,955 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 02:03:41,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:03:41,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:03:41,965 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:03:41,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:03:41,965 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:03:41,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:03:41,966 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:03:41,966 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:03:41,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:03:41,966 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:03:41,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:03:41,966 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:03:41,966 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:03:41,967 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:03:41,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:03:41,967 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:03:41,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:03:41,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:03:41,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:03:41,968 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:03:41,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:03:41,968 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:03:41,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:03:41,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:03:42,007 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:03:42,010 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:03:42,012 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:03:42,012 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:03:42,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-02-04 02:03:42,153 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:03:42,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:03:42,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:03:42,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:03:42,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:03:42,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd6f628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42, skipping insertion in model container [2018-02-04 02:03:42,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,176 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:03:42,205 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:03:42,292 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:03:42,306 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:03:42,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42 WrapperNode [2018-02-04 02:03:42,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:03:42,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:03:42,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:03:42,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:03:42,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... [2018-02-04 02:03:42,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:03:42,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:03:42,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:03:42,337 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:03:42,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:03:42,370 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:03:42,371 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:03:42,371 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 02:03:42,371 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 02:03:42,371 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:03:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 02:03:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 02:03:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:03:42,371 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:03:42,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:03:42,373 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:03:42,653 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:03:42,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:03:42 BoogieIcfgContainer [2018-02-04 02:03:42,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:03:42,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:03:42,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:03:42,657 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:03:42,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:03:42" (1/3) ... [2018-02-04 02:03:42,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e40caea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:03:42, skipping insertion in model container [2018-02-04 02:03:42,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:03:42" (2/3) ... [2018-02-04 02:03:42,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e40caea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:03:42, skipping insertion in model container [2018-02-04 02:03:42,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:03:42" (3/3) ... [2018-02-04 02:03:42,660 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-02-04 02:03:42,667 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:03:42,676 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 02:03:42,707 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:03:42,707 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:03:42,708 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:03:42,708 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:03:42,708 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:03:42,708 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:03:42,708 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:03:42,708 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:03:42,709 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:03:42,721 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 02:03:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 02:03:42,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:42,730 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:42,730 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:42,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 02:03:42,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:42,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:42,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:42,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:03:42,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:42,842 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 79#true] [2018-02-04 02:03:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:42,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 02:03:42,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 02:03:42,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:03:42,853 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 02:03:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:42,914 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 02:03:42,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 02:03:42,915 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 02:03:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:42,923 INFO L225 Difference]: With dead ends: 76 [2018-02-04 02:03:42,923 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 02:03:42,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 02:03:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 02:03:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 02:03:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 02:03:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 02:03:42,949 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 02:03:42,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:42,949 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 02:03:42,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 02:03:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 02:03:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:03:42,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:42,950 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:42,950 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:42,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 02:03:42,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:42,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:42,982 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:42,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:42,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:42,982 INFO L182 omatonBuilderFactory]: Interpolants [230#true, 231#false, 232#|main_#t~short13|] [2018-02-04 02:03:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:42,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:42,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:42,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:42,984 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 02:03:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:42,993 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 02:03:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:42,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:03:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:42,994 INFO L225 Difference]: With dead ends: 74 [2018-02-04 02:03:42,994 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 02:03:42,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 02:03:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 02:03:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 02:03:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 02:03:43,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 02:03:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,001 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 02:03:43,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 02:03:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 02:03:43,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,002 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,002 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 02:03:43,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:43,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:43,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,071 INFO L182 omatonBuilderFactory]: Interpolants [381#true, 382#false, 383#(and (= 0 ~garbage.base) (= 0 ~garbage.offset))] [2018-02-04 02:03:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:43,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:43,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:43,072 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 02:03:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:43,117 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 02:03:43,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:43,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 02:03:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:43,119 INFO L225 Difference]: With dead ends: 132 [2018-02-04 02:03:43,119 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 02:03:43,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:43,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 02:03:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 02:03:43,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 02:03:43,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 02:03:43,128 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 02:03:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,128 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 02:03:43,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 02:03:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 02:03:43,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,129 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,129 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 02:03:43,130 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:43,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 02:03:43,162 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,162 INFO L182 omatonBuilderFactory]: Interpolants [630#true, 631#false, 632#(= |#valid| |old(#valid)|)] [2018-02-04 02:03:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 02:03:43,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 02:03:43,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:43,163 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 02:03:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:43,209 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 02:03:43,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 02:03:43,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 02:03:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:43,211 INFO L225 Difference]: With dead ends: 147 [2018-02-04 02:03:43,211 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 02:03:43,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 02:03:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 02:03:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 02:03:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 02:03:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 02:03:43,219 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 02:03:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,219 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 02:03:43,219 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 02:03:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 02:03:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 02:03:43,220 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,220 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,220 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 02:03:43,221 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:43,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:03:43,264 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,264 INFO L182 omatonBuilderFactory]: Interpolants [915#true, 916#false, 917#(<= ~pc1 1), 918#(<= |push_#t~post0| 1), 919#(not |push_#t~switch1|)] [2018-02-04 02:03:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:03:43,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:03:43,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:43,265 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 02:03:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:43,326 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 02:03:43,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:03:43,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 02:03:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:43,329 INFO L225 Difference]: With dead ends: 255 [2018-02-04 02:03:43,329 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 02:03:43,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 02:03:43,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 02:03:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 02:03:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 02:03:43,344 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 02:03:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,344 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 02:03:43,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:03:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 02:03:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:43,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,345 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,345 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 02:03:43,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:43,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:43,390 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,391 INFO L182 omatonBuilderFactory]: Interpolants [1403#true, 1404#false, 1405#(= 1 (select |#valid| |push_#t~malloc2.base|)), 1406#(= 1 (select |#valid| ~x1.base))] [2018-02-04 02:03:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:03:43,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:03:43,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:03:43,391 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 02:03:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:43,472 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 02:03:43,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:03:43,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:03:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:43,474 INFO L225 Difference]: With dead ends: 386 [2018-02-04 02:03:43,474 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 02:03:43,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 02:03:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 02:03:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 02:03:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 02:03:43,490 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 02:03:43,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,491 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 02:03:43,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:03:43,491 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 02:03:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:43,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,492 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 02:03:43,493 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:43,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 02:03:43,534 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,535 INFO L182 omatonBuilderFactory]: Interpolants [2153#true, 2154#false, 2155#(and (= 8 (select |#length| |push_#t~malloc2.base|)) (= 0 |push_#t~malloc2.offset|)), 2156#(and (= (select |#length| ~x1.base) 8) (= ~x1.offset 0))] [2018-02-04 02:03:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 02:03:43,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 02:03:43,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 02:03:43,536 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 02:03:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:43,618 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 02:03:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:03:43,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 02:03:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:43,622 INFO L225 Difference]: With dead ends: 485 [2018-02-04 02:03:43,622 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 02:03:43,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 02:03:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 02:03:43,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 02:03:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 02:03:43,638 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 02:03:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,638 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 02:03:43,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 02:03:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 02:03:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 02:03:43,639 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,639 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,639 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 02:03:43,640 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:43,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:03:43,684 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,684 INFO L182 omatonBuilderFactory]: Interpolants [3104#true, 3105#false, 3106#(<= ~pc4 1), 3107#(<= |pop_#t~post7| 1), 3108#(not |pop_#t~switch8|)] [2018-02-04 02:03:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:03:43,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:03:43,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:03:43,685 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 02:03:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:43,741 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 02:03:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 02:03:43,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 02:03:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:43,744 INFO L225 Difference]: With dead ends: 861 [2018-02-04 02:03:43,745 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 02:03:43,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 02:03:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 02:03:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 02:03:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 02:03:43,766 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 02:03:43,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,766 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 02:03:43,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:03:43,766 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 02:03:43,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 02:03:43,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,767 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,767 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 02:03:43,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:43,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 02:03:43,814 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,825 INFO L182 omatonBuilderFactory]: Interpolants [4800#true, 4801#false, 4802#(or (not |pop_#t~switch8|) (<= ~pc4 2)), 4803#(<= ~pc4 2), 4804#(<= |pop_#t~post7| 2), 4805#(not |pop_#t~switch8|)] [2018-02-04 02:03:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:43,825 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:03:43,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:03:43,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:03:43,826 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 02:03:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:43,906 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 02:03:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:03:43,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 02:03:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:43,914 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 02:03:43,914 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 02:03:43,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 02:03:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 02:03:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 02:03:43,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 02:03:43,948 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 02:03:43,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:43,948 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 02:03:43,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:03:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 02:03:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:03:43,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:43,950 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:43,950 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 02:03:43,951 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:43,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:44,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:44,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:44,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:44,051 INFO L182 omatonBuilderFactory]: Interpolants [7328#(and (= 1 |old(~pc1)|) (= ~S.offset |old(~S.offset)|)), 7329#(not (= ~S.offset 0)), 7330#|main_#t~short13|, 7321#true, 7322#false, 7323#(= 0 ~S.base), 7324#(or (not (= ~S.offset 0)) (not (= 1 ~pc1)) (not |main_#t~short13|)), 7325#(or (not (= ~S.offset 0)) (not (= 1 ~pc1))), 7326#(and (= |old(~pc1)| ~pc1) (= ~S.offset |old(~S.offset)|)), 7327#(and (or (= 1 |old(~pc1)|) (not |push_#t~switch1|)) (= ~S.offset |old(~S.offset)|))] [2018-02-04 02:03:44,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:44,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:03:44,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:03:44,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:44,052 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 10 states. [2018-02-04 02:03:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:44,878 INFO L93 Difference]: Finished difference Result 4747 states and 6957 transitions. [2018-02-04 02:03:44,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-04 02:03:44,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 02:03:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:44,900 INFO L225 Difference]: With dead ends: 4747 [2018-02-04 02:03:44,901 INFO L226 Difference]: Without dead ends: 4747 [2018-02-04 02:03:44,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=869, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 02:03:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2018-02-04 02:03:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 3960. [2018-02-04 02:03:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2018-02-04 02:03:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5791 transitions. [2018-02-04 02:03:45,018 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5791 transitions. Word has length 27 [2018-02-04 02:03:45,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:45,019 INFO L432 AbstractCegarLoop]: Abstraction has 3960 states and 5791 transitions. [2018-02-04 02:03:45,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:03:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5791 transitions. [2018-02-04 02:03:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:03:45,020 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:45,020 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:45,021 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1524460851, now seen corresponding path program 1 times [2018-02-04 02:03:45,021 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:45,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,074 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:45,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:03:45,075 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,075 INFO L182 omatonBuilderFactory]: Interpolants [16086#true, 16087#false, 16088#(<= 1 ~pc1), 16089#(= |old(~pc1)| ~pc1), 16090#(<= (+ |old(~pc1)| 1) ~pc1), 16091#(<= 2 ~pc1), 16092#|main_#t~short13|] [2018-02-04 02:03:45,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:03:45,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:03:45,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:03:45,076 INFO L87 Difference]: Start difference. First operand 3960 states and 5791 transitions. Second operand 7 states. [2018-02-04 02:03:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:45,321 INFO L93 Difference]: Finished difference Result 4173 states and 6241 transitions. [2018-02-04 02:03:45,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:45,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-02-04 02:03:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:45,341 INFO L225 Difference]: With dead ends: 4173 [2018-02-04 02:03:45,341 INFO L226 Difference]: Without dead ends: 4173 [2018-02-04 02:03:45,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:03:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2018-02-04 02:03:45,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 3600. [2018-02-04 02:03:45,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2018-02-04 02:03:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 5146 transitions. [2018-02-04 02:03:45,444 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 5146 transitions. Word has length 27 [2018-02-04 02:03:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:45,444 INFO L432 AbstractCegarLoop]: Abstraction has 3600 states and 5146 transitions. [2018-02-04 02:03:45,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:03:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 5146 transitions. [2018-02-04 02:03:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:03:45,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:45,446 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:45,446 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 02:03:45,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:45,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:03:45,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 02:03:45,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,513 INFO L182 omatonBuilderFactory]: Interpolants [23880#true, 23881#false, 23882#(and (= ~pc4 1) (= ~pc4 ~pc1)), 23883#(= 1 ~pc1), 23884#(= |old(~pc1)| ~pc1), 23885#(or (not (= |old(~pc1)| 1)) |push_#t~switch1|), 23886#(not (= |old(~pc1)| 1))] [2018-02-04 02:03:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:03:45,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:03:45,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:03:45,513 INFO L87 Difference]: Start difference. First operand 3600 states and 5146 transitions. Second operand 7 states. [2018-02-04 02:03:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:45,706 INFO L93 Difference]: Finished difference Result 2208 states and 2949 transitions. [2018-02-04 02:03:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:03:45,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 02:03:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:45,714 INFO L225 Difference]: With dead ends: 2208 [2018-02-04 02:03:45,714 INFO L226 Difference]: Without dead ends: 2022 [2018-02-04 02:03:45,714 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2018-02-04 02:03:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1829. [2018-02-04 02:03:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2018-02-04 02:03:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2500 transitions. [2018-02-04 02:03:45,757 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2500 transitions. Word has length 31 [2018-02-04 02:03:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:45,757 INFO L432 AbstractCegarLoop]: Abstraction has 1829 states and 2500 transitions. [2018-02-04 02:03:45,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:03:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2500 transitions. [2018-02-04 02:03:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 02:03:45,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:45,758 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:45,758 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 02:03:45,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:45,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:45,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:03:45,884 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,885 INFO L182 omatonBuilderFactory]: Interpolants [27936#(or (<= 4 |pop_#t~post7|) (<= |pop_#t~post7| 2)), 27937#(not |pop_#t~switch8|), 27930#true, 27931#false, 27932#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 1 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 2))), 27933#(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|), 27934#(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))), 27935#(or (<= ~pc4 2) (<= 4 ~pc4))] [2018-02-04 02:03:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:45,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:03:45,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:03:45,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:03:45,885 INFO L87 Difference]: Start difference. First operand 1829 states and 2500 transitions. Second operand 8 states. [2018-02-04 02:03:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:46,088 INFO L93 Difference]: Finished difference Result 2715 states and 3699 transitions. [2018-02-04 02:03:46,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:46,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 02:03:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:46,097 INFO L225 Difference]: With dead ends: 2715 [2018-02-04 02:03:46,097 INFO L226 Difference]: Without dead ends: 2715 [2018-02-04 02:03:46,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:03:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2018-02-04 02:03:46,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2606. [2018-02-04 02:03:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2606 states. [2018-02-04 02:03:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2606 states to 2606 states and 3594 transitions. [2018-02-04 02:03:46,154 INFO L78 Accepts]: Start accepts. Automaton has 2606 states and 3594 transitions. Word has length 31 [2018-02-04 02:03:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:46,154 INFO L432 AbstractCegarLoop]: Abstraction has 2606 states and 3594 transitions. [2018-02-04 02:03:46,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:03:46,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2606 states and 3594 transitions. [2018-02-04 02:03:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 02:03:46,155 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:46,155 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:46,155 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:46,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2106794323, now seen corresponding path program 1 times [2018-02-04 02:03:46,156 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:46,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:46,251 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:46,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 02:03:46,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:46,252 INFO L182 omatonBuilderFactory]: Interpolants [33273#true, 33274#false, 33275#(and (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 4)) (or (< 3 |pop_#t~post7|) (<= ~pc4 (+ |pop_#t~post7| 1)))), 33276#(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))))), 33277#(or (<= ~pc4 4) (<= 6 ~pc4)), 33278#(or (<= 6 |pop_#t~post7|) (<= |pop_#t~post7| 4)), 33279#(not |pop_#t~switch8|)] [2018-02-04 02:03:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:46,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 02:03:46,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 02:03:46,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:03:46,253 INFO L87 Difference]: Start difference. First operand 2606 states and 3594 transitions. Second operand 7 states. [2018-02-04 02:03:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:46,521 INFO L93 Difference]: Finished difference Result 3356 states and 4584 transitions. [2018-02-04 02:03:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 02:03:46,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 02:03:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:46,536 INFO L225 Difference]: With dead ends: 3356 [2018-02-04 02:03:46,536 INFO L226 Difference]: Without dead ends: 3356 [2018-02-04 02:03:46,537 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:03:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3356 states. [2018-02-04 02:03:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3356 to 3229. [2018-02-04 02:03:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3229 states. [2018-02-04 02:03:46,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3229 states to 3229 states and 4457 transitions. [2018-02-04 02:03:46,609 INFO L78 Accepts]: Start accepts. Automaton has 3229 states and 4457 transitions. Word has length 33 [2018-02-04 02:03:46,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:46,610 INFO L432 AbstractCegarLoop]: Abstraction has 3229 states and 4457 transitions. [2018-02-04 02:03:46,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 02:03:46,610 INFO L276 IsEmpty]: Start isEmpty. Operand 3229 states and 4457 transitions. [2018-02-04 02:03:46,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 02:03:46,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:46,611 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:46,611 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:46,611 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 02:03:46,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:46,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:46,685 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:46,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:46,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:03:46,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:46,686 INFO L182 omatonBuilderFactory]: Interpolants [39879#true, 39880#false, 39881#(and (= 0 ~S.base) (= 0 ~S.offset)), 39882#(and (= |old(~S.offset)| ~S.offset) (= ~S.base |old(~S.base)|)), 39883#(and (= |old(~S.offset)| ~t4.offset) (= ~t4.base |old(~S.base)|)), 39884#(and (= 0 ~t4.base) (= 0 ~t4.offset)), 39885#(and (= ~t4.offset |old(~t4.offset)|) (= ~t4.base |old(~t4.base)|)), 39886#(or (not (= |old(~t4.offset)| 0)) (not (= 0 |old(~t4.base)|)))] [2018-02-04 02:03:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:46,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:03:46,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:03:46,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:03:46,687 INFO L87 Difference]: Start difference. First operand 3229 states and 4457 transitions. Second operand 8 states. [2018-02-04 02:03:47,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:47,076 INFO L93 Difference]: Finished difference Result 3887 states and 5476 transitions. [2018-02-04 02:03:47,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:03:47,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-04 02:03:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:47,091 INFO L225 Difference]: With dead ends: 3887 [2018-02-04 02:03:47,092 INFO L226 Difference]: Without dead ends: 3887 [2018-02-04 02:03:47,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3887 states. [2018-02-04 02:03:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3887 to 3585. [2018-02-04 02:03:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3585 states. [2018-02-04 02:03:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4904 transitions. [2018-02-04 02:03:47,171 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4904 transitions. Word has length 38 [2018-02-04 02:03:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:47,172 INFO L432 AbstractCegarLoop]: Abstraction has 3585 states and 4904 transitions. [2018-02-04 02:03:47,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:03:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4904 transitions. [2018-02-04 02:03:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 02:03:47,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:47,174 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:47,174 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 02:03:47,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:47,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:47,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:47,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:47,259 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:47,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-04 02:03:47,260 INFO L182 omatonBuilderFactory]: Interpolants [47378#true, 47379#false, 47380#(<= ~pc1 1), 47381#(= |old(~pc1)| ~pc1), 47382#(<= ~pc1 (+ |old(~pc1)| 1)), 47383#(<= ~pc1 2), 47384#(= |push_#t~post0| |old(~pc1)|), 47385#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 47386#(<= 6 |old(~pc1)|)] [2018-02-04 02:03:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:47,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:47,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:47,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:47,260 INFO L87 Difference]: Start difference. First operand 3585 states and 4904 transitions. Second operand 9 states. [2018-02-04 02:03:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:47,545 INFO L93 Difference]: Finished difference Result 4727 states and 6761 transitions. [2018-02-04 02:03:47,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:03:47,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 02:03:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:47,564 INFO L225 Difference]: With dead ends: 4727 [2018-02-04 02:03:47,564 INFO L226 Difference]: Without dead ends: 4727 [2018-02-04 02:03:47,565 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 02:03:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4727 states. [2018-02-04 02:03:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4727 to 4360. [2018-02-04 02:03:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2018-02-04 02:03:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6084 transitions. [2018-02-04 02:03:47,684 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6084 transitions. Word has length 42 [2018-02-04 02:03:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:47,684 INFO L432 AbstractCegarLoop]: Abstraction has 4360 states and 6084 transitions. [2018-02-04 02:03:47,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6084 transitions. [2018-02-04 02:03:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 02:03:47,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:47,687 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:47,687 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1079771155, now seen corresponding path program 1 times [2018-02-04 02:03:47,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:47,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:47,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:47,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:47,830 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:47,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:47,830 INFO L182 omatonBuilderFactory]: Interpolants [56496#(or (not |pop_#t~switch8|) (and (<= |old(~pc4)| 4) (<= 4 |old(~pc4)|))), 56497#(and (<= |old(~pc4)| 4) (<= 4 |old(~pc4)|)), 56488#true, 56489#false, 56490#(and (or (<= ~pc4 (+ |pop_#t~post7| 1)) (< 2 |pop_#t~post7|)) (or (<= (+ |pop_#t~post7| 1) ~pc4) (<= |pop_#t~post7| 3))), 56491#(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|), 56492#(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))), 56493#(or (<= 5 ~pc4) (<= ~pc4 3)), 56494#(= |old(~pc4)| ~pc4), 56495#(= |pop_#t~post7| |old(~pc4)|)] [2018-02-04 02:03:47,831 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:47,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:03:47,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:03:47,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:47,831 INFO L87 Difference]: Start difference. First operand 4360 states and 6084 transitions. Second operand 10 states. [2018-02-04 02:03:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:48,149 INFO L93 Difference]: Finished difference Result 4079 states and 5595 transitions. [2018-02-04 02:03:48,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:48,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-04 02:03:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:48,163 INFO L225 Difference]: With dead ends: 4079 [2018-02-04 02:03:48,163 INFO L226 Difference]: Without dead ends: 3965 [2018-02-04 02:03:48,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:03:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2018-02-04 02:03:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3212. [2018-02-04 02:03:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3212 states. [2018-02-04 02:03:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4417 transitions. [2018-02-04 02:03:48,230 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4417 transitions. Word has length 47 [2018-02-04 02:03:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:48,230 INFO L432 AbstractCegarLoop]: Abstraction has 3212 states and 4417 transitions. [2018-02-04 02:03:48,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:03:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4417 transitions. [2018-02-04 02:03:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:03:48,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:48,232 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:48,232 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 02:03:48,233 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:48,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:48,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:48,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:48,315 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:48,316 INFO L182 omatonBuilderFactory]: Interpolants [63808#(<= ~pc1 (+ |push_#t~post0| 1)), 63809#(or (<= ~pc1 3) (not |push_#t~switch1|)), 63810#(<= ~pc1 3), 63811#(= |old(~pc1)| ~pc1), 63812#(= |push_#t~post0| |old(~pc1)|), 63813#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 63814#(<= 6 |old(~pc1)|), 63806#true, 63807#false] [2018-02-04 02:03:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:48,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:48,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:48,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:48,317 INFO L87 Difference]: Start difference. First operand 3212 states and 4417 transitions. Second operand 9 states. [2018-02-04 02:03:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:48,568 INFO L93 Difference]: Finished difference Result 4050 states and 5759 transitions. [2018-02-04 02:03:48,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:48,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 02:03:48,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:48,584 INFO L225 Difference]: With dead ends: 4050 [2018-02-04 02:03:48,584 INFO L226 Difference]: Without dead ends: 4050 [2018-02-04 02:03:48,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4050 states. [2018-02-04 02:03:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4050 to 3792. [2018-02-04 02:03:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3792 states. [2018-02-04 02:03:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 5229 transitions. [2018-02-04 02:03:48,685 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 5229 transitions. Word has length 54 [2018-02-04 02:03:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:48,685 INFO L432 AbstractCegarLoop]: Abstraction has 3792 states and 5229 transitions. [2018-02-04 02:03:48,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 5229 transitions. [2018-02-04 02:03:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 02:03:48,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:48,687 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:48,687 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 02:03:48,688 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:48,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:48,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:48,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:48,763 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:48,763 INFO L182 omatonBuilderFactory]: Interpolants [71681#(<= ~pc1 (+ |push_#t~post0| 1)), 71680#false, 71683#(<= ~pc1 4), 71682#(or (<= ~pc1 4) (not |push_#t~switch1|)), 71685#(= |push_#t~post0| |old(~pc1)|), 71684#(= |old(~pc1)| ~pc1), 71687#(<= 6 |old(~pc1)|), 71686#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 71679#true] [2018-02-04 02:03:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:48,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:48,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:48,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:48,764 INFO L87 Difference]: Start difference. First operand 3792 states and 5229 transitions. Second operand 9 states. [2018-02-04 02:03:49,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:49,060 INFO L93 Difference]: Finished difference Result 4630 states and 6620 transitions. [2018-02-04 02:03:49,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:49,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-02-04 02:03:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:49,074 INFO L225 Difference]: With dead ends: 4630 [2018-02-04 02:03:49,074 INFO L226 Difference]: Without dead ends: 4630 [2018-02-04 02:03:49,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2018-02-04 02:03:49,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 3852. [2018-02-04 02:03:49,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3852 states. [2018-02-04 02:03:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 5334 transitions. [2018-02-04 02:03:49,155 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 5334 transitions. Word has length 54 [2018-02-04 02:03:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:49,155 INFO L432 AbstractCegarLoop]: Abstraction has 3852 states and 5334 transitions. [2018-02-04 02:03:49,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 5334 transitions. [2018-02-04 02:03:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 02:03:49,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:49,157 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:49,157 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:49,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1006007847, now seen corresponding path program 1 times [2018-02-04 02:03:49,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:49,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:49,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:49,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:49,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:49,235 INFO L182 omatonBuilderFactory]: Interpolants [80193#false, 80192#true, 80195#(or (<= ~pc1 5) (not |push_#t~switch1|)), 80194#(<= ~pc1 (+ |push_#t~post0| 1)), 80197#(= |old(~pc1)| ~pc1), 80196#(<= ~pc1 5), 80199#(or (<= 6 |old(~pc1)|) (not |push_#t~switch1|)), 80198#(= |push_#t~post0| |old(~pc1)|), 80200#(<= 6 |old(~pc1)|)] [2018-02-04 02:03:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:49,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:49,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:49,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:49,236 INFO L87 Difference]: Start difference. First operand 3852 states and 5334 transitions. Second operand 9 states. [2018-02-04 02:03:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:49,497 INFO L93 Difference]: Finished difference Result 4622 states and 6604 transitions. [2018-02-04 02:03:49,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:49,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-02-04 02:03:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:49,512 INFO L225 Difference]: With dead ends: 4622 [2018-02-04 02:03:49,512 INFO L226 Difference]: Without dead ends: 4622 [2018-02-04 02:03:49,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4622 states. [2018-02-04 02:03:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4622 to 3852. [2018-02-04 02:03:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3852 states. [2018-02-04 02:03:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 5334 transitions. [2018-02-04 02:03:49,592 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 5334 transitions. Word has length 56 [2018-02-04 02:03:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:49,593 INFO L432 AbstractCegarLoop]: Abstraction has 3852 states and 5334 transitions. [2018-02-04 02:03:49,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 5334 transitions. [2018-02-04 02:03:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 02:03:49,594 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:49,594 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-02-04 02:03:49,594 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash -725937099, now seen corresponding path program 1 times [2018-02-04 02:03:49,595 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:49,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:03:49,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:49,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 02:03:49,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:49,703 INFO L182 omatonBuilderFactory]: Interpolants [88705#(not (= ~S.offset ~t1.offset)), 88704#(and (= |old(~t1.offset)| ~t1.offset) (= 1 |old(~pc1)|) (= ~S.offset |old(~S.offset)|)), 88707#(= |old(~t1.offset)| |old(~S.offset)|), 88706#(and (= |old(~t1.offset)| ~t1.offset) (= ~S.offset |old(~S.offset)|)), 88697#true, 88699#(and (= 0 ~S.base) (= 0 ~t1.offset)), 88698#false, 88701#(or (not (= 1 ~pc1)) (not (= ~S.offset ~t1.offset))), 88700#(or (not (= 1 ~pc1)) (not (= ~S.offset ~t1.offset)) (not |main_#t~short13|)), 88703#(and (or (= 1 |old(~pc1)|) (not |push_#t~switch1|)) (= |old(~t1.offset)| ~t1.offset) (= ~S.offset |old(~S.offset)|)), 88702#(and (= |old(~t1.offset)| ~t1.offset) (= |old(~pc1)| ~pc1) (= ~S.offset |old(~S.offset)|))] [2018-02-04 02:03:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 02:03:49,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:03:49,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:03:49,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:03:49,704 INFO L87 Difference]: Start difference. First operand 3852 states and 5334 transitions. Second operand 11 states. [2018-02-04 02:03:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:50,587 INFO L93 Difference]: Finished difference Result 7927 states and 12493 transitions. [2018-02-04 02:03:50,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:03:50,588 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-02-04 02:03:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:50,612 INFO L225 Difference]: With dead ends: 7927 [2018-02-04 02:03:50,613 INFO L226 Difference]: Without dead ends: 7927 [2018-02-04 02:03:50,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 02:03:50,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7927 states. [2018-02-04 02:03:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7927 to 6164. [2018-02-04 02:03:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6164 states. [2018-02-04 02:03:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 8608 transitions. [2018-02-04 02:03:50,753 INFO L78 Accepts]: Start accepts. Automaton has 6164 states and 8608 transitions. Word has length 57 [2018-02-04 02:03:50,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:50,753 INFO L432 AbstractCegarLoop]: Abstraction has 6164 states and 8608 transitions. [2018-02-04 02:03:50,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:03:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 6164 states and 8608 transitions. [2018-02-04 02:03:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 02:03:50,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:50,756 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:50,756 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:50,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1207017357, now seen corresponding path program 2 times [2018-02-04 02:03:50,757 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:50,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:03:50,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:50,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:50,831 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:50,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-04 02:03:50,831 INFO L182 omatonBuilderFactory]: Interpolants [102855#false, 102854#true, 102857#(not (= ~x1.base 0)), 102856#(not (= |push_#t~malloc2.base| 0)), 102859#(= ~S.base |old(~x1.base)|), 102858#(= ~x1.base |old(~x1.base)|), 102861#(= ~S.base |old(~S.base)|), 102860#(not (= ~S.base 0)), 102862#|main_#t~short13|] [2018-02-04 02:03:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 02:03:50,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:50,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:50,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:50,832 INFO L87 Difference]: Start difference. First operand 6164 states and 8608 transitions. Second operand 9 states. [2018-02-04 02:03:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:51,167 INFO L93 Difference]: Finished difference Result 11518 states and 16207 transitions. [2018-02-04 02:03:51,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:03:51,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-02-04 02:03:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:51,220 INFO L225 Difference]: With dead ends: 11518 [2018-02-04 02:03:51,220 INFO L226 Difference]: Without dead ends: 11518 [2018-02-04 02:03:51,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:03:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11518 states. [2018-02-04 02:03:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11518 to 8009. [2018-02-04 02:03:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8009 states. [2018-02-04 02:03:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8009 states to 8009 states and 11258 transitions. [2018-02-04 02:03:51,337 INFO L78 Accepts]: Start accepts. Automaton has 8009 states and 11258 transitions. Word has length 57 [2018-02-04 02:03:51,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:51,338 INFO L432 AbstractCegarLoop]: Abstraction has 8009 states and 11258 transitions. [2018-02-04 02:03:51,338 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 8009 states and 11258 transitions. [2018-02-04 02:03:51,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 02:03:51,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:51,340 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:51,340 INFO L371 AbstractCegarLoop]: === Iteration 23 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1674128402, now seen corresponding path program 1 times [2018-02-04 02:03:51,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:51,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:51,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:51,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:51,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:51,469 INFO L182 omatonBuilderFactory]: Interpolants [122433#(= |old(~pc1)| ~pc1), 122432#(or (<= 7 ~pc1) (<= ~pc1 5)), 122435#(or (and (<= 6 |old(~pc1)|) (<= |old(~pc1)| 6)) (not |push_#t~switch1|)), 122434#(= |push_#t~post0| |old(~pc1)|), 122436#(and (<= 6 |old(~pc1)|) (<= |old(~pc1)| 6)), 122429#false, 122428#true, 122431#(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|), 122430#(and (or (<= |push_#t~post0| 5) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 4 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1))))] [2018-02-04 02:03:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 02:03:51,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:51,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:51,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:51,469 INFO L87 Difference]: Start difference. First operand 8009 states and 11258 transitions. Second operand 9 states. [2018-02-04 02:03:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:51,818 INFO L93 Difference]: Finished difference Result 8286 states and 12041 transitions. [2018-02-04 02:03:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:03:51,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-02-04 02:03:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:51,842 INFO L225 Difference]: With dead ends: 8286 [2018-02-04 02:03:51,842 INFO L226 Difference]: Without dead ends: 8210 [2018-02-04 02:03:51,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:03:51,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2018-02-04 02:03:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 5552. [2018-02-04 02:03:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-02-04 02:03:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 7734 transitions. [2018-02-04 02:03:51,965 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 7734 transitions. Word has length 58 [2018-02-04 02:03:51,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:51,966 INFO L432 AbstractCegarLoop]: Abstraction has 5552 states and 7734 transitions. [2018-02-04 02:03:51,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 7734 transitions. [2018-02-04 02:03:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:03:51,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:51,968 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:51,968 INFO L371 AbstractCegarLoop]: === Iteration 24 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:51,968 INFO L82 PathProgramCache]: Analyzing trace with hash -497013758, now seen corresponding path program 1 times [2018-02-04 02:03:51,969 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:51,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 02:03:52,088 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:52,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:52,088 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:52,089 INFO L182 omatonBuilderFactory]: Interpolants [136294#(= 1 (select |#valid| |push_#t~malloc2.base|)), 136295#(= 1 (select |#valid| ~x1.base)), 136292#true, 136293#false, 136298#(= 1 (select |#valid| ~S.base)), 136299#(= |old(~S.base)| ~S.base), 136296#(and (= |#valid| |old(#valid)|) (= |old(~x1.base)| ~x1.base)), 136297#(and (= |#valid| |old(#valid)|) (= |old(~x1.base)| ~S.base)), 136302#(= |old(~t4.base)| ~t4.base), 136300#(= |old(~S.base)| ~t4.base), 136301#(= 1 (select |#valid| ~t4.base))] [2018-02-04 02:03:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 23 proven. 38 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 02:03:52,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:03:52,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:03:52,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:03:52,089 INFO L87 Difference]: Start difference. First operand 5552 states and 7734 transitions. Second operand 11 states. [2018-02-04 02:03:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:53,229 INFO L93 Difference]: Finished difference Result 13497 states and 18984 transitions. [2018-02-04 02:03:53,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:03:53,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-04 02:03:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:53,263 INFO L225 Difference]: With dead ends: 13497 [2018-02-04 02:03:53,263 INFO L226 Difference]: Without dead ends: 13379 [2018-02-04 02:03:53,264 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-04 02:03:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13379 states. [2018-02-04 02:03:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13379 to 12562. [2018-02-04 02:03:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12562 states. [2018-02-04 02:03:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12562 states to 12562 states and 17680 transitions. [2018-02-04 02:03:53,465 INFO L78 Accepts]: Start accepts. Automaton has 12562 states and 17680 transitions. Word has length 67 [2018-02-04 02:03:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:53,465 INFO L432 AbstractCegarLoop]: Abstraction has 12562 states and 17680 transitions. [2018-02-04 02:03:53,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:03:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 12562 states and 17680 transitions. [2018-02-04 02:03:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 02:03:53,467 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:53,467 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:53,467 INFO L371 AbstractCegarLoop]: === Iteration 25 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -497013757, now seen corresponding path program 1 times [2018-02-04 02:03:53,468 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:53,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 02:03:53,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:53,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:53,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:53,551 INFO L182 omatonBuilderFactory]: Interpolants [162435#true, 162438#(= |old(~pc1)| ~pc1), 162439#(<= ~pc1 (+ |old(~pc1)| 1)), 162436#false, 162437#(<= ~pc1 1), 162442#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|)), 162443#(<= 5 |old(~pc1)|), 162440#(<= ~pc1 2), 162441#(= |push_#t~post0| |old(~pc1)|)] [2018-02-04 02:03:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 02:03:53,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:53,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:53,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:53,552 INFO L87 Difference]: Start difference. First operand 12562 states and 17680 transitions. Second operand 9 states. [2018-02-04 02:03:53,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:53,904 INFO L93 Difference]: Finished difference Result 14008 states and 19838 transitions. [2018-02-04 02:03:53,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:03:53,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-02-04 02:03:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:53,931 INFO L225 Difference]: With dead ends: 14008 [2018-02-04 02:03:53,931 INFO L226 Difference]: Without dead ends: 14008 [2018-02-04 02:03:53,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14008 states. [2018-02-04 02:03:54,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14008 to 13593. [2018-02-04 02:03:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13593 states. [2018-02-04 02:03:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13593 states to 13593 states and 19205 transitions. [2018-02-04 02:03:54,162 INFO L78 Accepts]: Start accepts. Automaton has 13593 states and 19205 transitions. Word has length 67 [2018-02-04 02:03:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:54,163 INFO L432 AbstractCegarLoop]: Abstraction has 13593 states and 19205 transitions. [2018-02-04 02:03:54,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 13593 states and 19205 transitions. [2018-02-04 02:03:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-04 02:03:54,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:54,166 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:54,166 INFO L371 AbstractCegarLoop]: === Iteration 26 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash -968199174, now seen corresponding path program 1 times [2018-02-04 02:03:54,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:54,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:03:54,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:54,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:54,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03: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-04 02:03:54,259 INFO L182 omatonBuilderFactory]: Interpolants [190066#(or (<= ~pc1 4) (not |push_#t~switch1|)), 190067#(<= ~pc1 4), 190064#false, 190065#(<= ~pc1 (+ |push_#t~post0| 1)), 190070#(or (<= 5 |old(~pc1)|) (not |push_#t~switch1|)), 190071#(<= 5 |old(~pc1)|), 190068#(= |old(~pc1)| ~pc1), 190069#(= |push_#t~post0| |old(~pc1)|), 190063#true] [2018-02-04 02:03:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:03:54,259 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:54,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:54,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:54,260 INFO L87 Difference]: Start difference. First operand 13593 states and 19205 transitions. Second operand 9 states. [2018-02-04 02:03:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:54,470 INFO L93 Difference]: Finished difference Result 17442 states and 25152 transitions. [2018-02-04 02:03:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:54,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-02-04 02:03:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:54,510 INFO L225 Difference]: With dead ends: 17442 [2018-02-04 02:03:54,510 INFO L226 Difference]: Without dead ends: 17442 [2018-02-04 02:03:54,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17442 states. [2018-02-04 02:03:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17442 to 16797. [2018-02-04 02:03:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16797 states. [2018-02-04 02:03:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16797 states to 16797 states and 23920 transitions. [2018-02-04 02:03:54,742 INFO L78 Accepts]: Start accepts. Automaton has 16797 states and 23920 transitions. Word has length 79 [2018-02-04 02:03:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:54,743 INFO L432 AbstractCegarLoop]: Abstraction has 16797 states and 23920 transitions. [2018-02-04 02:03:54,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 16797 states and 23920 transitions. [2018-02-04 02:03:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-04 02:03:54,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:54,748 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:54,748 INFO L371 AbstractCegarLoop]: === Iteration 27 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1484005690, now seen corresponding path program 1 times [2018-02-04 02:03:54,749 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:54,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:54,987 WARN L143 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 3 [2018-02-04 02:03:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 20 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 02:03:55,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:55,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:55,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:55,017 INFO L182 omatonBuilderFactory]: Interpolants [224339#(= |push_#t~post0| |old(~pc1)|), 224338#(<= ~pc1 2), 224337#(<= ~pc1 (+ |old(~pc1)| 1)), 224336#(= |old(~pc1)| ~pc1), 224341#(<= 4 |old(~pc1)|), 224340#(or (<= 4 |old(~pc1)|) (not |push_#t~switch1|)), 224335#(<= ~pc1 1), 224334#false, 224333#true] [2018-02-04 02:03:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 47 proven. 20 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 02:03:55,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:55,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:55,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:55,018 INFO L87 Difference]: Start difference. First operand 16797 states and 23920 transitions. Second operand 9 states. [2018-02-04 02:03:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:55,300 INFO L93 Difference]: Finished difference Result 17333 states and 24979 transitions. [2018-02-04 02:03:55,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:03:55,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-02-04 02:03:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:55,332 INFO L225 Difference]: With dead ends: 17333 [2018-02-04 02:03:55,332 INFO L226 Difference]: Without dead ends: 17333 [2018-02-04 02:03:55,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:55,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17333 states. [2018-02-04 02:03:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17333 to 17036. [2018-02-04 02:03:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17036 states. [2018-02-04 02:03:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17036 states to 17036 states and 24519 transitions. [2018-02-04 02:03:55,561 INFO L78 Accepts]: Start accepts. Automaton has 17036 states and 24519 transitions. Word has length 81 [2018-02-04 02:03:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:55,561 INFO L432 AbstractCegarLoop]: Abstraction has 17036 states and 24519 transitions. [2018-02-04 02:03:55,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 17036 states and 24519 transitions. [2018-02-04 02:03:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-04 02:03:55,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:55,564 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:55,564 INFO L371 AbstractCegarLoop]: === Iteration 28 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:55,565 INFO L82 PathProgramCache]: Analyzing trace with hash 365029573, now seen corresponding path program 1 times [2018-02-04 02:03:55,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:55,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:03:55,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:55,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:55,729 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 02:03:55,729 INFO L182 omatonBuilderFactory]: Interpolants [258739#(or (<= 6 ~pc1) (<= ~pc1 4)), 258738#(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|))), 258737#(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|), 258736#(and (or (<= |push_#t~post0| 4) (<= (+ |push_#t~post0| 1) ~pc1)) (or (<= ~pc1 (+ |push_#t~post0| 1)) (< 3 |push_#t~post0|))), 258743#(and (<= |old(~pc1)| 5) (<= 5 |old(~pc1)|)), 258742#(or (and (<= |old(~pc1)| 5) (<= 5 |old(~pc1)|)) (not |push_#t~switch1|)), 258741#(= |push_#t~post0| |old(~pc1)|), 258740#(= |old(~pc1)| ~pc1), 258735#false, 258734#true] [2018-02-04 02:03:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 70 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-04 02:03:55,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:03:55,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:03:55,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:55,730 INFO L87 Difference]: Start difference. First operand 17036 states and 24519 transitions. Second operand 10 states. [2018-02-04 02:03:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:56,107 INFO L93 Difference]: Finished difference Result 20569 states and 30343 transitions. [2018-02-04 02:03:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:56,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2018-02-04 02:03:56,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:56,147 INFO L225 Difference]: With dead ends: 20569 [2018-02-04 02:03:56,147 INFO L226 Difference]: Without dead ends: 20569 [2018-02-04 02:03:56,147 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-04 02:03:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20569 states. [2018-02-04 02:03:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20569 to 16918. [2018-02-04 02:03:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16918 states. [2018-02-04 02:03:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16918 states to 16918 states and 24063 transitions. [2018-02-04 02:03:56,536 INFO L78 Accepts]: Start accepts. Automaton has 16918 states and 24063 transitions. Word has length 83 [2018-02-04 02:03:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:56,536 INFO L432 AbstractCegarLoop]: Abstraction has 16918 states and 24063 transitions. [2018-02-04 02:03:56,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:03:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16918 states and 24063 transitions. [2018-02-04 02:03:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 02:03:56,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:56,538 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:56,538 INFO L371 AbstractCegarLoop]: === Iteration 29 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1475760911, now seen corresponding path program 1 times [2018-02-04 02:03:56,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:56,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 59 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-04 02:03:56,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:56,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:56,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 02:03:56,623 INFO L182 omatonBuilderFactory]: Interpolants [296260#(or (<= 3 |old(~pc1)|) (not |push_#t~switch1|)), 296261#(<= 3 |old(~pc1)|), 296256#(= |old(~pc1)| ~pc1), 296257#(<= ~pc1 (+ |old(~pc1)| 1)), 296258#(<= ~pc1 2), 296259#(= |push_#t~post0| |old(~pc1)|), 296253#true, 296254#false, 296255#(<= ~pc1 1)] [2018-02-04 02:03:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 59 proven. 29 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-02-04 02:03:56,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:56,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:56,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:56,624 INFO L87 Difference]: Start difference. First operand 16918 states and 24063 transitions. Second operand 9 states. [2018-02-04 02:03:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:56,822 INFO L93 Difference]: Finished difference Result 17443 states and 25140 transitions. [2018-02-04 02:03:56,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 02:03:56,823 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-02-04 02:03:56,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:56,855 INFO L225 Difference]: With dead ends: 17443 [2018-02-04 02:03:56,855 INFO L226 Difference]: Without dead ends: 17443 [2018-02-04 02:03:56,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17443 states. [2018-02-04 02:03:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17443 to 17028. [2018-02-04 02:03:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17028 states. [2018-02-04 02:03:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17028 states to 17028 states and 24334 transitions. [2018-02-04 02:03:57,034 INFO L78 Accepts]: Start accepts. Automaton has 17028 states and 24334 transitions. Word has length 93 [2018-02-04 02:03:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:57,034 INFO L432 AbstractCegarLoop]: Abstraction has 17028 states and 24334 transitions. [2018-02-04 02:03:57,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 17028 states and 24334 transitions. [2018-02-04 02:03:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 02:03:57,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:57,036 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 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, 1] [2018-02-04 02:03:57,036 INFO L371 AbstractCegarLoop]: === Iteration 30 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1206828627, now seen corresponding path program 1 times [2018-02-04 02:03:57,037 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:57,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:57,134 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:03:57,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:57,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:03:57,134 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:57,135 INFO L182 omatonBuilderFactory]: Interpolants [330757#false, 330756#true, 330759#(or (<= ~pc1 3) (not |push_#t~switch1|)), 330758#(<= ~pc1 (+ |push_#t~post0| 1)), 330764#(<= 4 |old(~pc1)|), 330761#(= |old(~pc1)| ~pc1), 330760#(<= ~pc1 3), 330763#(or (<= 4 |old(~pc1)|) (not |push_#t~switch1|)), 330762#(= |push_#t~post0| |old(~pc1)|)] [2018-02-04 02:03:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:03:57,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:03:57,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:03:57,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:03:57,136 INFO L87 Difference]: Start difference. First operand 17028 states and 24334 transitions. Second operand 9 states. [2018-02-04 02:03:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:57,472 INFO L93 Difference]: Finished difference Result 20531 states and 29876 transitions. [2018-02-04 02:03:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:57,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2018-02-04 02:03:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:57,531 INFO L225 Difference]: With dead ends: 20531 [2018-02-04 02:03:57,531 INFO L226 Difference]: Without dead ends: 20531 [2018-02-04 02:03:57,531 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:03:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20531 states. [2018-02-04 02:03:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20531 to 20353. [2018-02-04 02:03:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20353 states. [2018-02-04 02:03:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20353 states to 20353 states and 29703 transitions. [2018-02-04 02:03:57,949 INFO L78 Accepts]: Start accepts. Automaton has 20353 states and 29703 transitions. Word has length 93 [2018-02-04 02:03:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:57,949 INFO L432 AbstractCegarLoop]: Abstraction has 20353 states and 29703 transitions. [2018-02-04 02:03:57,949 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:03:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 20353 states and 29703 transitions. [2018-02-04 02:03:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-04 02:03:57,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:57,951 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 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, 1] [2018-02-04 02:03:57,951 INFO L371 AbstractCegarLoop]: === Iteration 31 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash -933010820, now seen corresponding path program 1 times [2018-02-04 02:03:57,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:57,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:03:58,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:58,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:58,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 02:03:58,090 INFO L182 omatonBuilderFactory]: Interpolants [371671#true, 371680#(and (<= 4 |old(~pc1)|) (<= |old(~pc1)| 4)), 371677#(= |old(~pc1)| ~pc1), 371676#(or (<= 5 ~pc1) (<= ~pc1 3)), 371679#(or (and (<= 4 |old(~pc1)|) (<= |old(~pc1)| 4)) (not |push_#t~switch1|)), 371678#(= |push_#t~post0| |old(~pc1)|), 371673#(and (or (<= |push_#t~post0| 3) (<= (+ |push_#t~post0| 1) ~pc1)) (or (< 2 |push_#t~post0|) (<= ~pc1 (+ |push_#t~post0| 1)))), 371672#false, 371675#(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)))), 371674#(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)))))] [2018-02-04 02:03:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-04 02:03:58,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:03:58,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:03:58,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:03:58,091 INFO L87 Difference]: Start difference. First operand 20353 states and 29703 transitions. Second operand 10 states. [2018-02-04 02:03:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:03:58,344 INFO L93 Difference]: Finished difference Result 20625 states and 30001 transitions. [2018-02-04 02:03:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 02:03:58,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-02-04 02:03:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:03:58,377 INFO L225 Difference]: With dead ends: 20625 [2018-02-04 02:03:58,377 INFO L226 Difference]: Without dead ends: 20271 [2018-02-04 02:03:58,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:03:58,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20271 states. [2018-02-04 02:03:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20271 to 16457. [2018-02-04 02:03:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16457 states. [2018-02-04 02:03:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16457 states to 16457 states and 23433 transitions. [2018-02-04 02:03:58,562 INFO L78 Accepts]: Start accepts. Automaton has 16457 states and 23433 transitions. Word has length 97 [2018-02-04 02:03:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:03:58,562 INFO L432 AbstractCegarLoop]: Abstraction has 16457 states and 23433 transitions. [2018-02-04 02:03:58,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:03:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 16457 states and 23433 transitions. [2018-02-04 02:03:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 02:03:58,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:03:58,563 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:03:58,564 INFO L371 AbstractCegarLoop]: === Iteration 32 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:03:58,564 INFO L82 PathProgramCache]: Analyzing trace with hash 112633316, now seen corresponding path program 1 times [2018-02-04 02:03:58,564 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:03:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:03:58,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:03:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 02:03:58,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:03:58,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 02:03:58,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:03:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:03:58,916 INFO L182 omatonBuilderFactory]: Interpolants [408790#(and (= |old(~x1.offset)| ~x1.offset) (= |old(~x1.base)| ~x1.base) (= |old(#length)| |#length|)), 408791#(and (= |old(~x1.offset)| ~S.offset) (= |old(#length)| |#length|) (= |old(~x1.base)| ~S.base)), 408788#(and (= 8 (select |#length| |push_#t~malloc2.base|)) (= 0 |push_#t~malloc2.offset|)), 408789#(and (= 0 ~x1.offset) (= 8 (select |#length| ~x1.base))), 408786#true, 408787#false, 408796#(and (= |old(~t4.offset)| ~t4.offset) (= |old(~t4.base)| ~t4.base)), 408794#(and (= |old(~S.offset)| ~t4.offset) (= |old(~S.base)| ~t4.base)), 408795#(and (= 0 ~t4.offset) (= 8 (select |#length| ~t4.base))), 408792#(and (= 0 ~S.offset) (= 8 (select |#length| ~S.base))), 408793#(and (= |old(~S.offset)| ~S.offset) (= |old(~S.base)| ~S.base))] [2018-02-04 02:03:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 47 proven. 95 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-04 02:03:58,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 02:03:58,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 02:03:58,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-04 02:03:58,916 INFO L87 Difference]: Start difference. First operand 16457 states and 23433 transitions. Second operand 11 states. [2018-02-04 02:04:00,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:00,069 INFO L93 Difference]: Finished difference Result 25381 states and 36237 transitions. [2018-02-04 02:04:00,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 02:04:00,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2018-02-04 02:04:00,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:00,116 INFO L225 Difference]: With dead ends: 25381 [2018-02-04 02:04:00,116 INFO L226 Difference]: Without dead ends: 25381 [2018-02-04 02:04:00,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1278, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 02:04:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25381 states. [2018-02-04 02:04:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25381 to 24491. [2018-02-04 02:04:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24491 states. [2018-02-04 02:04:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24491 states to 24491 states and 34929 transitions. [2018-02-04 02:04:00,387 INFO L78 Accepts]: Start accepts. Automaton has 24491 states and 34929 transitions. Word has length 105 [2018-02-04 02:04:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:00,387 INFO L432 AbstractCegarLoop]: Abstraction has 24491 states and 34929 transitions. [2018-02-04 02:04:00,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 02:04:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 24491 states and 34929 transitions. [2018-02-04 02:04:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-04 02:04:00,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:00,390 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:04:00,390 INFO L371 AbstractCegarLoop]: === Iteration 33 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:04:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash 907880852, now seen corresponding path program 1 times [2018-02-04 02:04:00,391 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:00,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-04 02:04:00,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:00,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 02:04:00,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:04:00,512 INFO L182 omatonBuilderFactory]: Interpolants [458742#true, 458743#false, 458750#(<= 4 |old(~pc4)|), 458748#(= |pop_#t~post7| |old(~pc4)|), 458749#(or (not |pop_#t~switch8|) (<= 4 |old(~pc4)|)), 458746#(<= ~pc4 3), 458747#(= |old(~pc4)| ~pc4), 458744#(<= ~pc4 (+ |pop_#t~post7| 1)), 458745#(or (not |pop_#t~switch8|) (<= ~pc4 3))] [2018-02-04 02:04:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 86 proven. 4 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-02-04 02:04:00,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 02:04:00,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 02:04:00,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 02:04:00,513 INFO L87 Difference]: Start difference. First operand 24491 states and 34929 transitions. Second operand 9 states. [2018-02-04 02:04:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:00,739 INFO L93 Difference]: Finished difference Result 23420 states and 32990 transitions. [2018-02-04 02:04:00,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:04:00,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-02-04 02:04:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:00,804 INFO L225 Difference]: With dead ends: 23420 [2018-02-04 02:04:00,804 INFO L226 Difference]: Without dead ends: 22661 [2018-02-04 02:04:00,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:04:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22661 states. [2018-02-04 02:04:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22661 to 21898. [2018-02-04 02:04:01,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21898 states. [2018-02-04 02:04:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21898 states to 21898 states and 30826 transitions. [2018-02-04 02:04:01,442 INFO L78 Accepts]: Start accepts. Automaton has 21898 states and 30826 transitions. Word has length 131 [2018-02-04 02:04:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:01,443 INFO L432 AbstractCegarLoop]: Abstraction has 21898 states and 30826 transitions. [2018-02-04 02:04:01,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 02:04:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 21898 states and 30826 transitions. [2018-02-04 02:04:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 02:04:01,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:01,447 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, 1, 1] [2018-02-04 02:04:01,447 INFO L371 AbstractCegarLoop]: === Iteration 34 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:04:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash -358761387, now seen corresponding path program 1 times [2018-02-04 02:04:01,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:04:01,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:04:01,528 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-02-04 02:04:01,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 02:04:01,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 02:04:01,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:04:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 02:04:01,529 INFO L182 omatonBuilderFactory]: Interpolants [504101#(= 1 |old(~pc1)|), 504100#(or (= 1 |old(~pc1)|) (not |push_#t~switch1|)), 504099#(= |old(~pc1)| ~pc1), 504098#(not (= 1 ~pc1)), 504097#(or (not (= 1 ~pc1)) (not |main_#t~short13|)), 504096#(and (= 0 ~S.base) (= 0 ~S.offset)), 504095#false, 504094#true] [2018-02-04 02:04:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-02-04 02:04:01,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 02:04:01,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 02:04:01,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 02:04:01,530 INFO L87 Difference]: Start difference. First operand 21898 states and 30826 transitions. Second operand 8 states. [2018-02-04 02:04:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:04:01,829 INFO L93 Difference]: Finished difference Result 12793 states and 17931 transitions. [2018-02-04 02:04:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 02:04:01,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 145 [2018-02-04 02:04:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:04:01,849 INFO L225 Difference]: With dead ends: 12793 [2018-02-04 02:04:01,849 INFO L226 Difference]: Without dead ends: 12715 [2018-02-04 02:04:01,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-02-04 02:04:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2018-02-04 02:04:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 11938. [2018-02-04 02:04:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11938 states. [2018-02-04 02:04:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11938 states to 11938 states and 16762 transitions. [2018-02-04 02:04:01,980 INFO L78 Accepts]: Start accepts. Automaton has 11938 states and 16762 transitions. Word has length 145 [2018-02-04 02:04:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:04:01,980 INFO L432 AbstractCegarLoop]: Abstraction has 11938 states and 16762 transitions. [2018-02-04 02:04:01,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 02:04:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 11938 states and 16762 transitions. [2018-02-04 02:04:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 02:04:01,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:04:01,983 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 9, 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] [2018-02-04 02:04:01,983 INFO L371 AbstractCegarLoop]: === Iteration 35 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 02:04:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1800322707, now seen corresponding path program 2 times [2018-02-04 02:04:01,984 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:04:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:04:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 02:04:02,072 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 02:04:02,149 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 02:04:02,158 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,159 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,160 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,161 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,161 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,163 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,164 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,167 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,169 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,170 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,172 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,173 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,176 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,178 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,179 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,180 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,182 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,182 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,184 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,185 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 02:04:02,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:04:02 BoogieIcfgContainer [2018-02-04 02:04:02,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:04:02,203 INFO L168 Benchmark]: Toolchain (without parser) took 20049.34 ms. Allocated memory was 401.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 357.8 MB in the beginning and 850.0 MB in the end (delta: -492.2 MB). Peak memory consumption was 656.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:02,204 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:04:02,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.16 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 347.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:02,204 INFO L168 Benchmark]: Boogie Preprocessor took 25.12 ms. Allocated memory is still 401.1 MB. Free memory was 347.2 MB in the beginning and 344.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:02,204 INFO L168 Benchmark]: RCFGBuilder took 317.21 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 316.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:02,204 INFO L168 Benchmark]: TraceAbstraction took 19547.92 ms. Allocated memory was 401.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 316.8 MB in the beginning and 850.0 MB in the end (delta: -533.2 MB). Peak memory consumption was 615.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:04:02,205 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.16 ms. Allocated memory is still 401.1 MB. Free memory was 357.8 MB in the beginning and 347.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.12 ms. Allocated memory is still 401.1 MB. Free memory was 347.2 MB in the beginning and 344.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 317.21 ms. Allocated memory is still 401.1 MB. Free memory was 344.6 MB in the beginning and 316.8 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19547.92 ms. Allocated memory was 401.1 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 316.8 MB in the beginning and 850.0 MB in the end (delta: -533.2 MB). Peak memory consumption was 615.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch8 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={12:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L638] RET, FCALL x1->data = 4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: [L652] case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={12:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=12, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={12:0}, t1={0:0}, t4={12:0}, t4->next={0:0}, x1={12:0}, x4={0:0}] [L672] RET x4 = t4->next [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() [L691] COND FALSE !(__VERIFIER_nondet_int()) [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=12, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L663] pc4++ [L664] case 1: [L667] case 2: [L671] case 3: [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={12:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L675] COND TRUE S == t4 [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=12, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={12:0}, x1={12:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 76 locations, 19 error locations. UNSAFE Result, 19.5s OverallTime, 35 OverallIterations, 11 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3466 SDtfs, 7175 SDslu, 7183 SDs, 0 SdLazy, 10490 SolverSat, 1452 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 218 SyntacticMatches, 3 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1985 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24491occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1881/2244 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 34 MinimizatonAttempts, 25819 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1933 NumberOfCodeBlocks, 1933 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1754 ConstructedInterpolants, 0 QuantifiedInterpolants, 371533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 9 PerfectInterpolantSequences, 1881/2244 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-04-02-209.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-04-02-209.csv Received shutdown request...