java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:07:55,506 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:07:55,508 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:07:55,517 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:07:55,517 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:07:55,518 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:07:55,519 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:07:55,520 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:07:55,521 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:07:55,522 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:07:55,522 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:07:55,523 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:07:55,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:07:55,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:07:55,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:07:55,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:07:55,528 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:07:55,529 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:07:55,530 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:07:55,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:07:55,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:07:55,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:07:55,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:07:55,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:07:55,535 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:07:55,536 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:07:55,536 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:07:55,536 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:07:55,536 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:07:55,537 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:07:55,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:07:55,537 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:07:55,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:07:55,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:07:55,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:07:55,548 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:07:55,548 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:07:55,548 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:07:55,548 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:07:55,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:07:55,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:07:55,549 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:07:55,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:07:55,549 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:07:55,549 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:07:55,549 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:07:55,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:07:55,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:07:55,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:07:55,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:07:55,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:07:55,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:07:55,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:07:55,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:07:55,551 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:07:55,551 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:07:55,551 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:07:55,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:07:55,588 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:07:55,592 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:07:55,593 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:07:55,594 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:07:55,594 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 04:07:55,744 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:07:55,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:07:55,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:07:55,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:07:55,751 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:07:55,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55, skipping insertion in model container [2018-02-04 04:07:55,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,768 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:07:55,797 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:07:55,900 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:07:55,915 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:07:55,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55 WrapperNode [2018-02-04 04:07:55,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:07:55,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:07:55,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:07:55,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:07:55,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... [2018-02-04 04:07:55,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:07:55,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:07:55,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:07:55,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:07:55,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:07:55,977 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:07:55,978 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:07:55,978 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-02-04 04:07:55,978 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-02-04 04:07:55,978 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:07:55,978 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:07:55,979 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:07:55,979 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:07:55,979 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-02-04 04:07:55,979 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-02-04 04:07:55,979 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:07:55,979 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:07:55,979 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:07:56,168 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:07:56,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:07:56 BoogieIcfgContainer [2018-02-04 04:07:56,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:07:56,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:07:56,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:07:56,172 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:07:56,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:07:55" (1/3) ... [2018-02-04 04:07:56,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b0ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:07:56, skipping insertion in model container [2018-02-04 04:07:56,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:07:55" (2/3) ... [2018-02-04 04:07:56,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4b0ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:07:56, skipping insertion in model container [2018-02-04 04:07:56,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:07:56" (3/3) ... [2018-02-04 04:07:56,175 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-02-04 04:07:56,183 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:07:56,189 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-04 04:07:56,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:07:56,222 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:07:56,222 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:07:56,222 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:07:56,222 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:07:56,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:07:56,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:07:56,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:07:56,223 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:07:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-04 04:07:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 04:07:56,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:56,243 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:56,243 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:56,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1799126466, now seen corresponding path program 1 times [2018-02-04 04:07:56,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:56,249 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:56,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,279 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:56,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:56,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:56,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:56,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:07:56,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 04:07:56,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 04:07:56,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:07:56,381 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2018-02-04 04:07:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:56,396 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-02-04 04:07:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 04:07:56,459 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 04:07:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:56,472 INFO L225 Difference]: With dead ends: 76 [2018-02-04 04:07:56,472 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 04:07:56,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 04:07:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 04:07:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-02-04 04:07:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-04 04:07:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2018-02-04 04:07:56,502 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 9 [2018-02-04 04:07:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:56,502 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2018-02-04 04:07:56,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 04:07:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2018-02-04 04:07:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:07:56,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:56,503 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:56,503 INFO L371 AbstractCegarLoop]: === Iteration 2 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:56,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1199640283, now seen corresponding path program 1 times [2018-02-04 04:07:56,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:56,504 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:56,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,505 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:56,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:56,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:56,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:56,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:56,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:07:56,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:07:56,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:56,552 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand 3 states. [2018-02-04 04:07:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:56,582 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2018-02-04 04:07:56,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:07:56,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 04:07:56,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:56,584 INFO L225 Difference]: With dead ends: 74 [2018-02-04 04:07:56,584 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 04:07:56,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 04:07:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 04:07:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 04:07:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2018-02-04 04:07:56,591 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 12 [2018-02-04 04:07:56,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:56,591 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2018-02-04 04:07:56,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:07:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2018-02-04 04:07:56,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 04:07:56,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:56,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:56,592 INFO L371 AbstractCegarLoop]: === Iteration 3 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1201487325, now seen corresponding path program 1 times [2018-02-04 04:07:56,593 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:56,593 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:56,593 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,593 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:56,594 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:56,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:56,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:56,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:56,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:07:56,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:07:56,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:56,662 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand 3 states. [2018-02-04 04:07:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:56,693 INFO L93 Difference]: Finished difference Result 132 states and 167 transitions. [2018-02-04 04:07:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:07:56,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 04:07:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:56,694 INFO L225 Difference]: With dead ends: 132 [2018-02-04 04:07:56,694 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 04:07:56,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 04:07:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-02-04 04:07:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 04:07:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-02-04 04:07:56,705 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 12 [2018-02-04 04:07:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:56,705 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-02-04 04:07:56,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:07:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-02-04 04:07:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 04:07:56,706 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:56,706 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:56,706 INFO L371 AbstractCegarLoop]: === Iteration 4 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1408600152, now seen corresponding path program 1 times [2018-02-04 04:07:56,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:56,706 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:56,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,707 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:56,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:56,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:56,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:56,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:07:56,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:07:56,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:07:56,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:56,759 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 3 states. [2018-02-04 04:07:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:56,808 INFO L93 Difference]: Finished difference Result 147 states and 205 transitions. [2018-02-04 04:07:56,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:07:56,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-02-04 04:07:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:56,809 INFO L225 Difference]: With dead ends: 147 [2018-02-04 04:07:56,809 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 04:07:56,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:07:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 04:07:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-02-04 04:07:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-04 04:07:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 192 transitions. [2018-02-04 04:07:56,816 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 192 transitions. Word has length 13 [2018-02-04 04:07:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:56,816 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 192 transitions. [2018-02-04 04:07:56,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:07:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 192 transitions. [2018-02-04 04:07:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 04:07:56,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:56,817 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:56,817 INFO L371 AbstractCegarLoop]: === Iteration 5 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1628464921, now seen corresponding path program 1 times [2018-02-04 04:07:56,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:56,817 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:56,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,818 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:56,818 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:56,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:56,866 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:56,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:07:56,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:07:56,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:07:56,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:56,867 INFO L87 Difference]: Start difference. First operand 135 states and 192 transitions. Second operand 5 states. [2018-02-04 04:07:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:56,928 INFO L93 Difference]: Finished difference Result 255 states and 357 transitions. [2018-02-04 04:07:56,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:07:56,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 04:07:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:56,930 INFO L225 Difference]: With dead ends: 255 [2018-02-04 04:07:56,930 INFO L226 Difference]: Without dead ends: 255 [2018-02-04 04:07:56,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:07:56,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-02-04 04:07:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-02-04 04:07:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-04 04:07:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 338 transitions. [2018-02-04 04:07:56,946 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 338 transitions. Word has length 15 [2018-02-04 04:07:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:56,947 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 338 transitions. [2018-02-04 04:07:56,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:07:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 338 transitions. [2018-02-04 04:07:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:07:56,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:56,947 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:56,947 INFO L371 AbstractCegarLoop]: === Iteration 6 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:56,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474006, now seen corresponding path program 1 times [2018-02-04 04:07:56,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:56,948 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:56,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:56,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:56,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:56,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 04:07:56,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:56,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:56,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:07:56,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:07:56,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:07:56,982 INFO L87 Difference]: Start difference. First operand 226 states and 338 transitions. Second operand 4 states. [2018-02-04 04:07:57,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:57,072 INFO L93 Difference]: Finished difference Result 386 states and 569 transitions. [2018-02-04 04:07:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:07:57,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 04:07:57,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:57,075 INFO L225 Difference]: With dead ends: 386 [2018-02-04 04:07:57,075 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 04:07:57,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 04:07:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 358. [2018-02-04 04:07:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-02-04 04:07:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2018-02-04 04:07:57,092 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 16 [2018-02-04 04:07:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:57,093 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2018-02-04 04:07:57,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:07:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2018-02-04 04:07:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:07:57,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:57,093 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:57,093 INFO L371 AbstractCegarLoop]: === Iteration 7 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:57,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1057474005, now seen corresponding path program 1 times [2018-02-04 04:07:57,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:57,094 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:57,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:57,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:57,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:57,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:57,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 04:07:57,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:07:57,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:07:57,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:07:57,148 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2018-02-04 04:07:57,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:57,257 INFO L93 Difference]: Finished difference Result 485 states and 716 transitions. [2018-02-04 04:07:57,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:07:57,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 04:07:57,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:57,261 INFO L225 Difference]: With dead ends: 485 [2018-02-04 04:07:57,261 INFO L226 Difference]: Without dead ends: 485 [2018-02-04 04:07:57,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-02-04 04:07:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 460. [2018-02-04 04:07:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-02-04 04:07:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 696 transitions. [2018-02-04 04:07:57,276 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 696 transitions. Word has length 16 [2018-02-04 04:07:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:57,277 INFO L432 AbstractCegarLoop]: Abstraction has 460 states and 696 transitions. [2018-02-04 04:07:57,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:07:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 696 transitions. [2018-02-04 04:07:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:07:57,277 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:57,277 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:57,278 INFO L371 AbstractCegarLoop]: === Iteration 8 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1708141764, now seen corresponding path program 1 times [2018-02-04 04:07:57,278 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:57,278 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:57,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,279 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:57,279 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:57,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:57,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:57,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:07:57,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:07:57,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:07:57,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:07:57,329 INFO L87 Difference]: Start difference. First operand 460 states and 696 transitions. Second operand 5 states. [2018-02-04 04:07:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:57,382 INFO L93 Difference]: Finished difference Result 861 states and 1225 transitions. [2018-02-04 04:07:57,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:07:57,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 04:07:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:57,386 INFO L225 Difference]: With dead ends: 861 [2018-02-04 04:07:57,386 INFO L226 Difference]: Without dead ends: 861 [2018-02-04 04:07:57,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:07:57,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2018-02-04 04:07:57,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 828. [2018-02-04 04:07:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2018-02-04 04:07:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1196 transitions. [2018-02-04 04:07:57,412 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1196 transitions. Word has length 16 [2018-02-04 04:07:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:57,412 INFO L432 AbstractCegarLoop]: Abstraction has 828 states and 1196 transitions. [2018-02-04 04:07:57,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:07:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1196 transitions. [2018-02-04 04:07:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 04:07:57,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:57,413 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:57,413 INFO L371 AbstractCegarLoop]: === Iteration 9 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:57,414 INFO L82 PathProgramCache]: Analyzing trace with hash 750766986, now seen corresponding path program 1 times [2018-02-04 04:07:57,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:57,414 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:57,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,415 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:57,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:57,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:57,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:57,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:57,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:57,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:57,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:57,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:07:57,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-02-04 04:07:57,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:07:57,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:07:57,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:07:57,553 INFO L87 Difference]: Start difference. First operand 828 states and 1196 transitions. Second operand 6 states. [2018-02-04 04:07:57,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:57,626 INFO L93 Difference]: Finished difference Result 1289 states and 1809 transitions. [2018-02-04 04:07:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:07:57,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 04:07:57,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:57,633 INFO L225 Difference]: With dead ends: 1289 [2018-02-04 04:07:57,634 INFO L226 Difference]: Without dead ends: 1289 [2018-02-04 04:07:57,634 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 04:07:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2018-02-04 04:07:57,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1220. [2018-02-04 04:07:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2018-02-04 04:07:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1744 transitions. [2018-02-04 04:07:57,664 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 1744 transitions. Word has length 26 [2018-02-04 04:07:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:57,664 INFO L432 AbstractCegarLoop]: Abstraction has 1220 states and 1744 transitions. [2018-02-04 04:07:57,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:07:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 1744 transitions. [2018-02-04 04:07:57,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 04:07:57,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:57,665 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:57,665 INFO L371 AbstractCegarLoop]: === Iteration 10 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:57,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1952857995, now seen corresponding path program 1 times [2018-02-04 04:07:57,666 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:57,666 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:57,667 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,667 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:57,667 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:57,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:57,749 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 04:07:57,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:57,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:57,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:57,782 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:57,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:07:57,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2018-02-04 04:07:57,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:07:57,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:07:57,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:07:57,820 INFO L87 Difference]: Start difference. First operand 1220 states and 1744 transitions. Second operand 12 states. [2018-02-04 04:07:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:58,851 INFO L93 Difference]: Finished difference Result 5202 states and 7738 transitions. [2018-02-04 04:07:58,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-04 04:07:58,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-04 04:07:58,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:58,873 INFO L225 Difference]: With dead ends: 5202 [2018-02-04 04:07:58,873 INFO L226 Difference]: Without dead ends: 5202 [2018-02-04 04:07:58,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 04:07:58,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2018-02-04 04:07:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 4910. [2018-02-04 04:07:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2018-02-04 04:07:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 7315 transitions. [2018-02-04 04:07:58,995 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 7315 transitions. Word has length 27 [2018-02-04 04:07:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:58,996 INFO L432 AbstractCegarLoop]: Abstraction has 4910 states and 7315 transitions. [2018-02-04 04:07:58,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:07:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 7315 transitions. [2018-02-04 04:07:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:07:58,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:58,997 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:58,998 INFO L371 AbstractCegarLoop]: === Iteration 11 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:58,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1995842725, now seen corresponding path program 1 times [2018-02-04 04:07:58,998 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:58,998 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:58,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:58,999 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:58,999 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:59,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:59,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:07:59,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:07:59,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:07:59,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:07:59,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:07:59,064 INFO L87 Difference]: Start difference. First operand 4910 states and 7315 transitions. Second operand 7 states. [2018-02-04 04:07:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:07:59,219 INFO L93 Difference]: Finished difference Result 2110 states and 2748 transitions. [2018-02-04 04:07:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:07:59,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-02-04 04:07:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:07:59,230 INFO L225 Difference]: With dead ends: 2110 [2018-02-04 04:07:59,231 INFO L226 Difference]: Without dead ends: 1762 [2018-02-04 04:07:59,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:07:59,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2018-02-04 04:07:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1605. [2018-02-04 04:07:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2018-02-04 04:07:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2191 transitions. [2018-02-04 04:07:59,267 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2191 transitions. Word has length 31 [2018-02-04 04:07:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:07:59,268 INFO L432 AbstractCegarLoop]: Abstraction has 1605 states and 2191 transitions. [2018-02-04 04:07:59,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:07:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2191 transitions. [2018-02-04 04:07:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 04:07:59,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:07:59,269 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:07:59,269 INFO L371 AbstractCegarLoop]: === Iteration 12 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:07:59,269 INFO L82 PathProgramCache]: Analyzing trace with hash 735152201, now seen corresponding path program 1 times [2018-02-04 04:07:59,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:07:59,270 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:07:59,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:59,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:59,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:07:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:59,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:07:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:59,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:07:59,393 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:07:59,394 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:07:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:07:59,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:07:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:07:59,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:07:59,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-02-04 04:07:59,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:07:59,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:07:59,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:07:59,480 INFO L87 Difference]: Start difference. First operand 1605 states and 2191 transitions. Second operand 12 states. [2018-02-04 04:08:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:00,147 INFO L93 Difference]: Finished difference Result 2946 states and 3978 transitions. [2018-02-04 04:08:00,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:08:00,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-02-04 04:08:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:00,158 INFO L225 Difference]: With dead ends: 2946 [2018-02-04 04:08:00,158 INFO L226 Difference]: Without dead ends: 2926 [2018-02-04 04:08:00,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-02-04 04:08:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2018-02-04 04:08:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2272. [2018-02-04 04:08:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2018-02-04 04:08:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3098 transitions. [2018-02-04 04:08:00,223 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3098 transitions. Word has length 31 [2018-02-04 04:08:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:00,224 INFO L432 AbstractCegarLoop]: Abstraction has 2272 states and 3098 transitions. [2018-02-04 04:08:00,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:08:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3098 transitions. [2018-02-04 04:08:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 04:08:00,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:00,225 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:00,225 INFO L371 AbstractCegarLoop]: === Iteration 13 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash -663528086, now seen corresponding path program 1 times [2018-02-04 04:08:00,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:00,225 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:00,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:00,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:00,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:00,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:00,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:00,332 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:00,333 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:00,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-04 04:08:00,406 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 04:08:00,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-02-04 04:08:00,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:08:00,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:08:00,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:08:00,407 INFO L87 Difference]: Start difference. First operand 2272 states and 3098 transitions. Second operand 10 states. [2018-02-04 04:08:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:00,884 INFO L93 Difference]: Finished difference Result 1746 states and 2285 transitions. [2018-02-04 04:08:00,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:08:00,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 04:08:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:00,890 INFO L225 Difference]: With dead ends: 1746 [2018-02-04 04:08:00,891 INFO L226 Difference]: Without dead ends: 1746 [2018-02-04 04:08:00,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:08:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-02-04 04:08:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1495. [2018-02-04 04:08:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2018-02-04 04:08:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1987 transitions. [2018-02-04 04:08:00,921 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1987 transitions. Word has length 38 [2018-02-04 04:08:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:00,921 INFO L432 AbstractCegarLoop]: Abstraction has 1495 states and 1987 transitions. [2018-02-04 04:08:00,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:08:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1987 transitions. [2018-02-04 04:08:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 04:08:00,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:00,922 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:00,922 INFO L371 AbstractCegarLoop]: === Iteration 14 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 490510064, now seen corresponding path program 1 times [2018-02-04 04:08:00,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:00,923 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:00,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:00,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:00,924 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:00,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 04:08:01,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:01,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:01,006 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:01,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:01,081 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:01,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2018-02-04 04:08:01,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 04:08:01,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 04:08:01,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-02-04 04:08:01,082 INFO L87 Difference]: Start difference. First operand 1495 states and 1987 transitions. Second operand 12 states. [2018-02-04 04:08:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:01,370 INFO L93 Difference]: Finished difference Result 2094 states and 2899 transitions. [2018-02-04 04:08:01,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 04:08:01,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-02-04 04:08:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:01,378 INFO L225 Difference]: With dead ends: 2094 [2018-02-04 04:08:01,378 INFO L226 Difference]: Without dead ends: 2094 [2018-02-04 04:08:01,378 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2018-02-04 04:08:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2018-02-04 04:08:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1851. [2018-02-04 04:08:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2018-02-04 04:08:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2485 transitions. [2018-02-04 04:08:01,416 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2485 transitions. Word has length 42 [2018-02-04 04:08:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:01,417 INFO L432 AbstractCegarLoop]: Abstraction has 1851 states and 2485 transitions. [2018-02-04 04:08:01,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 04:08:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2485 transitions. [2018-02-04 04:08:01,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 04:08:01,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:01,417 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:01,418 INFO L371 AbstractCegarLoop]: === Iteration 15 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1159552053, now seen corresponding path program 1 times [2018-02-04 04:08:01,418 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:01,418 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:01,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:01,420 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:01,420 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:01,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:08:01,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:01,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:01,537 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:01,563 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:08:01,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:01,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-02-04 04:08:01,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 04:08:01,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 04:08:01,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:08:01,633 INFO L87 Difference]: Start difference. First operand 1851 states and 2485 transitions. Second operand 13 states. [2018-02-04 04:08:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:02,839 INFO L93 Difference]: Finished difference Result 1465 states and 1908 transitions. [2018-02-04 04:08:02,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 04:08:02,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-04 04:08:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:02,845 INFO L225 Difference]: With dead ends: 1465 [2018-02-04 04:08:02,845 INFO L226 Difference]: Without dead ends: 1405 [2018-02-04 04:08:02,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:08:02,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2018-02-04 04:08:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1271. [2018-02-04 04:08:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2018-02-04 04:08:02,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1684 transitions. [2018-02-04 04:08:02,874 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1684 transitions. Word has length 43 [2018-02-04 04:08:02,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:02,874 INFO L432 AbstractCegarLoop]: Abstraction has 1271 states and 1684 transitions. [2018-02-04 04:08:02,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 04:08:02,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1684 transitions. [2018-02-04 04:08:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 04:08:02,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:02,875 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:02,875 INFO L371 AbstractCegarLoop]: === Iteration 16 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1425126877, now seen corresponding path program 1 times [2018-02-04 04:08:02,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:02,876 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:02,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:02,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:02,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:02,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:08:02,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:02,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:02,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:02,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:03,026 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:08:03,026 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:03,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 04:08:03,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:08:03,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:08:03,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:08:03,027 INFO L87 Difference]: Start difference. First operand 1271 states and 1684 transitions. Second operand 11 states. [2018-02-04 04:08:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:03,246 INFO L93 Difference]: Finished difference Result 1671 states and 2281 transitions. [2018-02-04 04:08:03,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:08:03,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-04 04:08:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:03,252 INFO L225 Difference]: With dead ends: 1671 [2018-02-04 04:08:03,253 INFO L226 Difference]: Without dead ends: 1671 [2018-02-04 04:08:03,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:08:03,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-02-04 04:08:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1301. [2018-02-04 04:08:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2018-02-04 04:08:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1729 transitions. [2018-02-04 04:08:03,283 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1729 transitions. Word has length 54 [2018-02-04 04:08:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:03,283 INFO L432 AbstractCegarLoop]: Abstraction has 1301 states and 1729 transitions. [2018-02-04 04:08:03,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:08:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1729 transitions. [2018-02-04 04:08:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 04:08:03,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:03,284 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:03,284 INFO L371 AbstractCegarLoop]: === Iteration 17 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1162734491, now seen corresponding path program 1 times [2018-02-04 04:08:03,285 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:03,285 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:03,285 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:03,286 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:03,286 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:03,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 04:08:03,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:03,359 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:03,359 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:03,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 04:08:03,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:03,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-02-04 04:08:03,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 04:08:03,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 04:08:03,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-02-04 04:08:03,460 INFO L87 Difference]: Start difference. First operand 1301 states and 1729 transitions. Second operand 15 states. [2018-02-04 04:08:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:03,925 INFO L93 Difference]: Finished difference Result 2178 states and 3009 transitions. [2018-02-04 04:08:03,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 04:08:03,926 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-04 04:08:03,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:03,933 INFO L225 Difference]: With dead ends: 2178 [2018-02-04 04:08:03,933 INFO L226 Difference]: Without dead ends: 2144 [2018-02-04 04:08:03,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=803, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:08:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2144 states. [2018-02-04 04:08:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2144 to 1768. [2018-02-04 04:08:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1768 states. [2018-02-04 04:08:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2365 transitions. [2018-02-04 04:08:03,974 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2365 transitions. Word has length 54 [2018-02-04 04:08:03,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:03,974 INFO L432 AbstractCegarLoop]: Abstraction has 1768 states and 2365 transitions. [2018-02-04 04:08:03,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 04:08:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2365 transitions. [2018-02-04 04:08:03,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 04:08:03,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:03,976 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:03,976 INFO L371 AbstractCegarLoop]: === Iteration 18 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:03,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1047296506, now seen corresponding path program 1 times [2018-02-04 04:08:03,976 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:03,976 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:03,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:03,977 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:03,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:03,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 04:08:04,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:04,061 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:04,061 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:04,089 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 04:08:04,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:04,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 04:08:04,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:08:04,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:08:04,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:08:04,126 INFO L87 Difference]: Start difference. First operand 1768 states and 2365 transitions. Second operand 11 states. [2018-02-04 04:08:04,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:04,366 INFO L93 Difference]: Finished difference Result 2138 states and 2900 transitions. [2018-02-04 04:08:04,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 04:08:04,366 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-02-04 04:08:04,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:04,371 INFO L225 Difference]: With dead ends: 2138 [2018-02-04 04:08:04,371 INFO L226 Difference]: Without dead ends: 2138 [2018-02-04 04:08:04,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-02-04 04:08:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2018-02-04 04:08:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2115. [2018-02-04 04:08:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-02-04 04:08:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2881 transitions. [2018-02-04 04:08:04,421 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2881 transitions. Word has length 68 [2018-02-04 04:08:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:04,421 INFO L432 AbstractCegarLoop]: Abstraction has 2115 states and 2881 transitions. [2018-02-04 04:08:04,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:08:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2881 transitions. [2018-02-04 04:08:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 04:08:04,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:04,422 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:04,422 INFO L371 AbstractCegarLoop]: === Iteration 19 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:04,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1597143259, now seen corresponding path program 1 times [2018-02-04 04:08:04,423 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:04,423 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:04,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:04,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:04,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:04,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-04 04:08:04,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:04,521 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:04,521 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:04,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 53 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 04:08:04,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:04,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2018-02-04 04:08:04,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:08:04,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:08:04,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:08:04,639 INFO L87 Difference]: Start difference. First operand 2115 states and 2881 transitions. Second operand 18 states. [2018-02-04 04:08:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:05,438 INFO L93 Difference]: Finished difference Result 3702 states and 5110 transitions. [2018-02-04 04:08:05,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 04:08:05,439 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-02-04 04:08:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:05,451 INFO L225 Difference]: With dead ends: 3702 [2018-02-04 04:08:05,451 INFO L226 Difference]: Without dead ends: 3657 [2018-02-04 04:08:05,451 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 04:08:05,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3657 states. [2018-02-04 04:08:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3657 to 2699. [2018-02-04 04:08:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2699 states. [2018-02-04 04:08:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 3619 transitions. [2018-02-04 04:08:05,516 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 3619 transitions. Word has length 70 [2018-02-04 04:08:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:05,516 INFO L432 AbstractCegarLoop]: Abstraction has 2699 states and 3619 transitions. [2018-02-04 04:08:05,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:08:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 3619 transitions. [2018-02-04 04:08:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 04:08:05,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:05,518 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:05,518 INFO L371 AbstractCegarLoop]: === Iteration 20 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash 933081794, now seen corresponding path program 1 times [2018-02-04 04:08:05,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:05,518 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:05,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:05,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:05,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:05,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 68 proven. 31 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 04:08:05,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:05,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:05,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:05,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 78 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-02-04 04:08:05,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:05,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 04:08:05,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:08:05,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:08:05,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:08:05,897 INFO L87 Difference]: Start difference. First operand 2699 states and 3619 transitions. Second operand 17 states. [2018-02-04 04:08:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:06,623 INFO L93 Difference]: Finished difference Result 3630 states and 4965 transitions. [2018-02-04 04:08:06,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 04:08:06,623 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-04 04:08:06,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:06,632 INFO L225 Difference]: With dead ends: 3630 [2018-02-04 04:08:06,632 INFO L226 Difference]: Without dead ends: 3566 [2018-02-04 04:08:06,633 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 04:08:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3566 states. [2018-02-04 04:08:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3566 to 2645. [2018-02-04 04:08:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-02-04 04:08:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3515 transitions. [2018-02-04 04:08:06,695 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3515 transitions. Word has length 84 [2018-02-04 04:08:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:06,696 INFO L432 AbstractCegarLoop]: Abstraction has 2645 states and 3515 transitions. [2018-02-04 04:08:06,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:08:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3515 transitions. [2018-02-04 04:08:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 04:08:06,697 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:06,697 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:06,697 INFO L371 AbstractCegarLoop]: === Iteration 21 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1343466028, now seen corresponding path program 1 times [2018-02-04 04:08:06,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:06,697 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:06,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:06,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:06,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:06,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 40 proven. 64 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-04 04:08:06,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:06,788 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:06,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:06,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 101 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-04 04:08:06,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:06,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-02-04 04:08:06,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 04:08:06,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 04:08:06,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 04:08:06,906 INFO L87 Difference]: Start difference. First operand 2645 states and 3515 transitions. Second operand 17 states. [2018-02-04 04:08:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:08,114 INFO L93 Difference]: Finished difference Result 6191 states and 8334 transitions. [2018-02-04 04:08:08,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-02-04 04:08:08,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87 [2018-02-04 04:08:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:08,133 INFO L225 Difference]: With dead ends: 6191 [2018-02-04 04:08:08,133 INFO L226 Difference]: Without dead ends: 6137 [2018-02-04 04:08:08,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1093, Invalid=5387, Unknown=0, NotChecked=0, Total=6480 [2018-02-04 04:08:08,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2018-02-04 04:08:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 5460. [2018-02-04 04:08:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5460 states. [2018-02-04 04:08:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 7360 transitions. [2018-02-04 04:08:08,230 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 7360 transitions. Word has length 87 [2018-02-04 04:08:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:08,230 INFO L432 AbstractCegarLoop]: Abstraction has 5460 states and 7360 transitions. [2018-02-04 04:08:08,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 04:08:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 7360 transitions. [2018-02-04 04:08:08,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-04 04:08:08,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:08,232 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 4, 4, 4, 4, 4, 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] [2018-02-04 04:08:08,232 INFO L371 AbstractCegarLoop]: === Iteration 22 === [popErr2RequiresViolation, popErr5RequiresViolation, popErr4RequiresViolation, popErr3RequiresViolation, popErr0RequiresViolation, popErr1RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, pushErr5RequiresViolation, pushErr3RequiresViolation, pushErr0RequiresViolation, pushErr1RequiresViolation, pushErr7RequiresViolation, pushErr6RequiresViolation, pushErr2RequiresViolation, pushErr4RequiresViolation]=== [2018-02-04 04:08:08,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1189470598, now seen corresponding path program 1 times [2018-02-04 04:08:08,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:08,233 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:08,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:08,233 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:08,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:08,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:08,376 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 39 proven. 76 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-02-04 04:08:08,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:08,376 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:08,377 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:08,398 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 103 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-02-04 04:08:08,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:08,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-04 04:08:08,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 04:08:08,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 04:08:08,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-02-04 04:08:08,495 INFO L87 Difference]: Start difference. First operand 5460 states and 7360 transitions. Second operand 18 states. [2018-02-04 04:08:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:11,084 INFO L93 Difference]: Finished difference Result 12673 states and 17616 transitions. [2018-02-04 04:08:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-02-04 04:08:11,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-02-04 04:08:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:11,117 INFO L225 Difference]: With dead ends: 12673 [2018-02-04 04:08:11,117 INFO L226 Difference]: Without dead ends: 12673 [2018-02-04 04:08:11,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1614, Invalid=9942, Unknown=0, NotChecked=0, Total=11556 [2018-02-04 04:08:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12673 states. [2018-02-04 04:08:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12673 to 9656. [2018-02-04 04:08:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9656 states. [2018-02-04 04:08:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9656 states to 9656 states and 13350 transitions. [2018-02-04 04:08:11,284 INFO L78 Accepts]: Start accepts. Automaton has 9656 states and 13350 transitions. Word has length 99 [2018-02-04 04:08:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:11,284 INFO L432 AbstractCegarLoop]: Abstraction has 9656 states and 13350 transitions. [2018-02-04 04:08:11,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 04:08:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 9656 states and 13350 transitions. [2018-02-04 04:08:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-04 04:08:11,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:11,286 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 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, 1] [2018-02-04 04:08:11,286 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 04:08:11,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1793769950, now seen corresponding path program 1 times [2018-02-04 04:08:11,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:11,287 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:11,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:11,287 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:11,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:11,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:11,494 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 04:08:11,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:11,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:11,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:11,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:11,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:08:11,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:08:11,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:08:11,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 04:08:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 85 proven. 91 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 04:08:11,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:11,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2018-02-04 04:08:11,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:08:11,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:08:11,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:08:11,845 INFO L87 Difference]: Start difference. First operand 9656 states and 13350 transitions. Second operand 22 states. [2018-02-04 04:08:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:13,447 INFO L93 Difference]: Finished difference Result 13596 states and 18690 transitions. [2018-02-04 04:08:13,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 04:08:13,448 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 105 [2018-02-04 04:08:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:13,477 INFO L225 Difference]: With dead ends: 13596 [2018-02-04 04:08:13,477 INFO L226 Difference]: Without dead ends: 13596 [2018-02-04 04:08:13,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=467, Invalid=2083, Unknown=0, NotChecked=0, Total=2550 [2018-02-04 04:08:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13596 states. [2018-02-04 04:08:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13596 to 12790. [2018-02-04 04:08:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12790 states. [2018-02-04 04:08:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 17634 transitions. [2018-02-04 04:08:13,609 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 17634 transitions. Word has length 105 [2018-02-04 04:08:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:13,609 INFO L432 AbstractCegarLoop]: Abstraction has 12790 states and 17634 transitions. [2018-02-04 04:08:13,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:08:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 17634 transitions. [2018-02-04 04:08:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-02-04 04:08:13,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:13,612 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 9, 8, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:08:13,612 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 04:08:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1854918738, now seen corresponding path program 1 times [2018-02-04 04:08:13,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:13,612 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:13,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:13,613 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:13,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:13,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:08:13,692 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 04:08:13,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:08:13,692 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:08:13,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:08:13,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:08:13,825 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 04:08:13,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:08:13,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-02-04 04:08:13,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 04:08:13,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 04:08:13,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:08:13,827 INFO L87 Difference]: Start difference. First operand 12790 states and 17634 transitions. Second operand 11 states. [2018-02-04 04:08:14,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:08:14,042 INFO L93 Difference]: Finished difference Result 13454 states and 18016 transitions. [2018-02-04 04:08:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 04:08:14,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 131 [2018-02-04 04:08:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:08:14,072 INFO L225 Difference]: With dead ends: 13454 [2018-02-04 04:08:14,072 INFO L226 Difference]: Without dead ends: 12782 [2018-02-04 04:08:14,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-04 04:08:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2018-02-04 04:08:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 12010. [2018-02-04 04:08:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12010 states. [2018-02-04 04:08:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12010 states to 12010 states and 16249 transitions. [2018-02-04 04:08:14,237 INFO L78 Accepts]: Start accepts. Automaton has 12010 states and 16249 transitions. Word has length 131 [2018-02-04 04:08:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:08:14,237 INFO L432 AbstractCegarLoop]: Abstraction has 12010 states and 16249 transitions. [2018-02-04 04:08:14,237 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 04:08:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 12010 states and 16249 transitions. [2018-02-04 04:08:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-02-04 04:08:14,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:08:14,242 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 04:08:14,242 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 04:08:14,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1800322707, now seen corresponding path program 1 times [2018-02-04 04:08:14,242 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:08:14,243 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:08:14,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:14,243 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:08:14,243 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:08:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 04:08:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 04:08:14,337 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 04:08:14,425 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 04:08:14,435 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,436 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,437 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,437 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,438 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,443 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,451 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,453 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,454 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,455 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,457 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,457 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,459 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-02-04 04:08:14,460 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 04:08:14,462 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 04:08:14,463 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 04:08:14,464 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 04:08:14,465 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 04:08:14,466 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 04:08:14,467 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 04:08:14,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:08:14 BoogieIcfgContainer [2018-02-04 04:08:14,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 04:08:14,482 INFO L168 Benchmark]: Toolchain (without parser) took 18737.24 ms. Allocated memory was 390.6 MB in the beginning and 1.1 GB in the end (delta: 702.5 MB). Free memory was 344.6 MB in the beginning and 731.3 MB in the end (delta: -386.7 MB). Peak memory consumption was 315.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:08:14,483 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 390.6 MB. Free memory is still 351.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:08:14,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.93 ms. Allocated memory is still 390.6 MB. Free memory was 344.6 MB in the beginning and 334.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:08:14,483 INFO L168 Benchmark]: Boogie Preprocessor took 22.01 ms. Allocated memory is still 390.6 MB. Free memory was 334.1 MB in the beginning and 331.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:08:14,483 INFO L168 Benchmark]: RCFGBuilder took 223.52 ms. Allocated memory is still 390.6 MB. Free memory was 331.4 MB in the beginning and 303.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:08:14,484 INFO L168 Benchmark]: TraceAbstraction took 18311.82 ms. Allocated memory was 390.6 MB in the beginning and 1.1 GB in the end (delta: 702.5 MB). Free memory was 303.6 MB in the beginning and 731.3 MB in the end (delta: -427.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 5.3 GB. [2018-02-04 04:08:14,485 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.16 ms. Allocated memory is still 390.6 MB. Free memory is still 351.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 176.93 ms. Allocated memory is still 390.6 MB. Free memory was 344.6 MB in the beginning and 334.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.01 ms. Allocated memory is still 390.6 MB. Free memory was 334.1 MB in the beginning and 331.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 223.52 ms. Allocated memory is still 390.6 MB. Free memory was 331.4 MB in the beginning and 303.6 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18311.82 ms. Allocated memory was 390.6 MB in the beginning and 1.1 GB in the end (delta: 702.5 MB). Free memory was 303.6 MB in the beginning and 731.3 MB in the end (delta: -427.8 MB). Peak memory consumption was 274.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - 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)=0, \old(x1)=12, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L690] 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)=12, \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}] [L631] pc1++ [L632] case 1: [L637] case 2: [L640] case 3: [L643] case 4: [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={12:0}, x4={0:0}] [L647] COND TRUE S == t1 [L648] RET S = x1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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)=0, \old(S)=12, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=12, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, 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)=12, \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=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)=12, \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, 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)=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=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)=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}] [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)=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}] [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)=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}, 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)=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}, 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)=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=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)=0, \old(t4)=12, \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)=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=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, 18.2s OverallTime, 25 OverallIterations, 11 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2558 SDtfs, 8526 SDslu, 6455 SDs, 0 SdLazy, 12911 SolverSat, 2106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1654 GetRequests, 1086 SyntacticMatches, 12 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8220 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12790occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 9861 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2203 NumberOfCodeBlocks, 2203 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2019 ConstructedInterpolants, 10 QuantifiedInterpolants, 500639 SizeOfPredicates, 64 NumberOfNonLiveVariables, 7256 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 2164/2663 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_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-08-14-497.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_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_04-08-14-497.csv Received shutdown request...