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/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:25:50,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:25:50,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:25:50,797 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:25:50,797 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:25:50,798 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:25:50,799 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:25:50,801 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:25:50,803 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:25:50,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:25:50,805 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:25:50,805 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:25:50,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:25:50,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:25:50,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:25:50,810 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:25:50,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:25:50,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:25:50,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:25:50,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:25:50,819 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:25:50,819 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:25:50,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:25:50,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:25:50,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:25:50,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:25:50,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:25:50,823 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:25:50,824 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:25:50,824 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:25:50,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:25:50,825 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:25:50,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:25:50,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:25:50,835 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:25:50,835 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:25:50,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:25:50,836 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:25:50,836 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:25:50,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:25:50,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:25:50,837 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:25:50,837 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:25:50,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:25:50,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:25:50,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:25:50,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:25:50,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:25:50,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:25:50,838 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:25:50,839 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:25:50,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:25:50,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:25:50,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:25:50,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:25:50,839 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:25:50,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:25:50,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:25:50,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:25:50,840 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:25:50,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:25:50,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:25:50,841 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:25:50,841 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:25:50,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:25:50,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:25:50,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:25:50,842 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:25:50,842 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:25:50,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:25:50,890 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:25:50,894 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:25:50,896 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:25:50,896 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:25:50,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.0_true-valid-memsafety.i [2018-01-23 14:25:51,074 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:25:51,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:25:51,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:25:51,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:25:51,084 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:25:51,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c517b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51, skipping insertion in model container [2018-01-23 14:25:51,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,102 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:25:51,140 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:25:51,262 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:25:51,285 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:25:51,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51 WrapperNode [2018-01-23 14:25:51,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:25:51,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:25:51,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:25:51,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:25:51,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... [2018-01-23 14:25:51,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:25:51,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:25:51,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:25:51,334 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:25:51,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (1/1) ... No working directory specified, using /storage/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-01-23 14:25:51,379 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:25:51,379 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:25:51,380 INFO L136 BoogieDeclarations]: Found implementation of procedure push [2018-01-23 14:25:51,380 INFO L136 BoogieDeclarations]: Found implementation of procedure pop [2018-01-23 14:25:51,380 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:25:51,380 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:25:51,380 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:25:51,380 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:25:51,380 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:25:51,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:25:51,381 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:25:51,381 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:25:51,381 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:25:51,381 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:25:51,381 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:25:51,382 INFO L128 BoogieDeclarations]: Found specification of procedure push [2018-01-23 14:25:51,382 INFO L128 BoogieDeclarations]: Found specification of procedure pop [2018-01-23 14:25:51,382 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:25:51,382 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:25:51,382 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:25:51,665 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:25:51,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:25:51 BoogieIcfgContainer [2018-01-23 14:25:51,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:25:51,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:25:51,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:25:51,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:25:51,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:25:51" (1/3) ... [2018-01-23 14:25:51,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57051268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:25:51, skipping insertion in model container [2018-01-23 14:25:51,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:25:51" (2/3) ... [2018-01-23 14:25:51,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57051268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:25:51, skipping insertion in model container [2018-01-23 14:25:51,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:25:51" (3/3) ... [2018-01-23 14:25:51,674 INFO L105 eAbstractionObserver]: Analyzing ICFG lockfree-3.0_true-valid-memsafety.i [2018-01-23 14:25:51,683 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:25:51,691 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-23 14:25:51,737 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:51,737 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:51,738 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:51,738 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:51,738 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:51,738 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:51,738 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:51,738 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == popErr0EnsuresViolation======== [2018-01-23 14:25:51,739 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:51,753 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:25:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-23 14:25:51,759 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:51,760 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:51,760 INFO L371 AbstractCegarLoop]: === Iteration 1 === [popErr0EnsuresViolation]=== [2018-01-23 14:25:51,764 INFO L82 PathProgramCache]: Analyzing trace with hash 816843792, now seen corresponding path program 1 times [2018-01-23 14:25:51,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:51,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:51,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:51,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:51,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:51,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:51,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:51,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-23 14:25:51,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:51,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:51,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:51,978 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-23 14:25:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:52,080 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-23 14:25:52,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:52,081 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-23 14:25:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:52,087 INFO L225 Difference]: With dead ends: 75 [2018-01-23 14:25:52,087 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:25:52,090 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-01-23 14:25:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:25:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:25:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:25:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:25:52,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-23 14:25:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:52,111 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:25:52,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:25:52,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:25:52,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:25:52,131 INFO L401 ceAbstractionStarter]: For program point L681(line 681) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point L680(line 680) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point popEXIT(lines 658 687) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point L663(lines 663 686) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L404 ceAbstractionStarter]: At program point popENTRY(lines 658 687) the Hoare annotation is: true [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point L682(line 682) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point L672'(line 672) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point L664(line 664) no Hoare annotation was computed. [2018-01-23 14:25:52,132 INFO L401 ceAbstractionStarter]: For program point L682'(line 682) no Hoare annotation was computed. [2018-01-23 14:25:52,133 INFO L401 ceAbstractionStarter]: For program point L668(lines 668 669) no Hoare annotation was computed. [2018-01-23 14:25:52,133 INFO L401 ceAbstractionStarter]: For program point L674(line 674) no Hoare annotation was computed. [2018-01-23 14:25:52,133 INFO L401 ceAbstractionStarter]: For program point L672(line 672) no Hoare annotation was computed. [2018-01-23 14:25:52,133 INFO L401 ceAbstractionStarter]: For program point L671(line 671) no Hoare annotation was computed. [2018-01-23 14:25:52,133 INFO L401 ceAbstractionStarter]: For program point L675(lines 675 678) no Hoare annotation was computed. [2018-01-23 14:25:52,133 INFO L401 ceAbstractionStarter]: For program point L675''(lines 675 678) no Hoare annotation was computed. [2018-01-23 14:25:52,133 INFO L401 ceAbstractionStarter]: For program point L681'(line 681) no Hoare annotation was computed. [2018-01-23 14:25:52,134 INFO L401 ceAbstractionStarter]: For program point popErr0EnsuresViolation(lines 658 687) no Hoare annotation was computed. [2018-01-23 14:25:52,134 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:25:52,134 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:25:52,134 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 702) the Hoare annotation is: true [2018-01-23 14:25:52,134 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:25:52,134 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 702) the Hoare annotation is: true [2018-01-23 14:25:52,134 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:25:52,135 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 702) the Hoare annotation is: true [2018-01-23 14:25:52,135 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:25:52,135 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 702) no Hoare annotation was computed. [2018-01-23 14:25:52,135 INFO L404 ceAbstractionStarter]: At program point L694'(line 694) the Hoare annotation is: true [2018-01-23 14:25:52,135 INFO L401 ceAbstractionStarter]: For program point L690'(line 690) no Hoare annotation was computed. [2018-01-23 14:25:52,135 INFO L401 ceAbstractionStarter]: For program point L697'(line 697) no Hoare annotation was computed. [2018-01-23 14:25:52,136 INFO L401 ceAbstractionStarter]: For program point L696'''(lines 696 700) no Hoare annotation was computed. [2018-01-23 14:25:52,136 INFO L401 ceAbstractionStarter]: For program point L690'''(line 690) no Hoare annotation was computed. [2018-01-23 14:25:52,136 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 688 702) no Hoare annotation was computed. [2018-01-23 14:25:52,136 INFO L404 ceAbstractionStarter]: At program point L692(line 692) the Hoare annotation is: true [2018-01-23 14:25:52,136 INFO L401 ceAbstractionStarter]: For program point L691(lines 691 694) no Hoare annotation was computed. [2018-01-23 14:25:52,136 INFO L401 ceAbstractionStarter]: For program point L690(lines 690 695) no Hoare annotation was computed. [2018-01-23 14:25:52,136 INFO L401 ceAbstractionStarter]: For program point L696(lines 696 700) no Hoare annotation was computed. [2018-01-23 14:25:52,137 INFO L401 ceAbstractionStarter]: For program point L696''(lines 696 700) no Hoare annotation was computed. [2018-01-23 14:25:52,137 INFO L404 ceAbstractionStarter]: At program point L694(line 694) the Hoare annotation is: true [2018-01-23 14:25:52,137 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 688 702) no Hoare annotation was computed. [2018-01-23 14:25:52,137 INFO L401 ceAbstractionStarter]: For program point L698(line 698) no Hoare annotation was computed. [2018-01-23 14:25:52,137 INFO L401 ceAbstractionStarter]: For program point L697(line 697) no Hoare annotation was computed. [2018-01-23 14:25:52,137 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 688 702) no Hoare annotation was computed. [2018-01-23 14:25:52,137 INFO L401 ceAbstractionStarter]: For program point L698'(line 698) no Hoare annotation was computed. [2018-01-23 14:25:52,138 INFO L401 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-23 14:25:52,138 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-23 14:25:52,138 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-23 14:25:52,138 INFO L401 ceAbstractionStarter]: For program point L647''(lines 647 650) no Hoare annotation was computed. [2018-01-23 14:25:52,138 INFO L401 ceAbstractionStarter]: For program point L647(lines 647 650) no Hoare annotation was computed. [2018-01-23 14:25:52,138 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-23 14:25:52,138 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-23 14:25:52,139 INFO L404 ceAbstractionStarter]: At program point pushENTRY(lines 627 656) the Hoare annotation is: true [2018-01-23 14:25:52,139 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-23 14:25:52,139 INFO L401 ceAbstractionStarter]: For program point pushErr0EnsuresViolation(lines 627 656) no Hoare annotation was computed. [2018-01-23 14:25:52,139 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-23 14:25:52,139 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-23 14:25:52,139 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-23 14:25:52,139 INFO L401 ceAbstractionStarter]: For program point L631(lines 631 655) no Hoare annotation was computed. [2018-01-23 14:25:52,140 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-23 14:25:52,140 INFO L401 ceAbstractionStarter]: For program point pushEXIT(lines 627 656) no Hoare annotation was computed. [2018-01-23 14:25:52,140 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-23 14:25:52,140 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-23 14:25:52,144 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:52,144 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:52,144 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:52,144 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:52,145 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:52,145 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:52,145 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:52,145 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:25:52,145 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:52,147 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:25:52,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:25:52,148 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,148 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:25:52,148 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:25:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 169454, now seen corresponding path program 1 times [2018-01-23 14:25:52,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,150 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:52,196 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:25:52,205 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:52,214 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:52,214 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:52,214 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:52,214 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:52,214 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:52,214 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:52,214 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:52,214 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:25:52,214 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:52,216 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:25:52,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-23 14:25:52,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,216 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:25:52,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1316586551, now seen corresponding path program 1 times [2018-01-23 14:25:52,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:52,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:52,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:52,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:52,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:52,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:52,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:52,251 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-23 14:25:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:52,257 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-23 14:25:52,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:52,257 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-01-23 14:25:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:52,264 INFO L225 Difference]: With dead ends: 75 [2018-01-23 14:25:52,265 INFO L226 Difference]: Without dead ends: 57 [2018-01-23 14:25:52,265 INFO L525 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-01-23 14:25:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-23 14:25:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-23 14:25:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-23 14:25:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2018-01-23 14:25:52,283 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 11 [2018-01-23 14:25:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:52,283 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2018-01-23 14:25:52,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2018-01-23 14:25:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-23 14:25:52,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,285 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,285 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:25:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2092868013, now seen corresponding path program 1 times [2018-01-23 14:25:52,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:52,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:52,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:52,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:25:52,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:25:52,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:25:52,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:25:52,335 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 3 states. [2018-01-23 14:25:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:52,371 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2018-01-23 14:25:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:25:52,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-23 14:25:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:52,373 INFO L225 Difference]: With dead ends: 69 [2018-01-23 14:25:52,373 INFO L226 Difference]: Without dead ends: 58 [2018-01-23 14:25:52,374 INFO L525 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-01-23 14:25:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-23 14:25:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-23 14:25:52,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-23 14:25:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2018-01-23 14:25:52,381 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 15 [2018-01-23 14:25:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:52,382 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2018-01-23 14:25:52,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:25:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2018-01-23 14:25:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-23 14:25:52,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,383 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,383 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:25:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1392752657, now seen corresponding path program 1 times [2018-01-23 14:25:52,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:25:52,433 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:25:52,442 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:52,449 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:52,450 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:25:52,457 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:25:52,457 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:25:52,457 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:25:52,457 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:25:52,457 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:25:52,457 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:25:52,457 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:25:52,457 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:25:52,458 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:25:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:25:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-23 14:25:52,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,459 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,459 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1784608256, now seen corresponding path program 1 times [2018-01-23 14:25:52,459 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:52,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:52,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:52,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:52,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:52,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-23 14:25:52,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-23 14:25:52,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-23 14:25:52,513 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-23 14:25:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:52,518 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-01-23 14:25:52,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-23 14:25:52,519 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-23 14:25:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:52,520 INFO L225 Difference]: With dead ends: 75 [2018-01-23 14:25:52,520 INFO L226 Difference]: Without dead ends: 55 [2018-01-23 14:25:52,521 INFO L525 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-01-23 14:25:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-23 14:25:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-23 14:25:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-23 14:25:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-01-23 14:25:52,527 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 9 [2018-01-23 14:25:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:52,528 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-01-23 14:25:52,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-23 14:25:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-01-23 14:25:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-23 14:25:52,529 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,529 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,529 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:52,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1548658460, now seen corresponding path program 1 times [2018-01-23 14:25:52,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:52,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:52,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:52,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-23 14:25:52,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:25:52,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:25:52,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:25:52,571 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand 3 states. [2018-01-23 14:25:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:52,585 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2018-01-23 14:25:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:25:52,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-23 14:25:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:52,587 INFO L225 Difference]: With dead ends: 65 [2018-01-23 14:25:52,587 INFO L226 Difference]: Without dead ends: 56 [2018-01-23 14:25:52,588 INFO L525 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-01-23 14:25:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-23 14:25:52,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-23 14:25:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-23 14:25:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2018-01-23 14:25:52,594 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 13 [2018-01-23 14:25:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:52,594 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2018-01-23 14:25:52,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:25:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2018-01-23 14:25:52,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-23 14:25:52,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,596 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,596 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1605916762, now seen corresponding path program 1 times [2018-01-23 14:25:52,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:52,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:52,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:52,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:25:52,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:25:52,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:25:52,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:25:52,638 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 3 states. [2018-01-23 14:25:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:52,696 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2018-01-23 14:25:52,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:25:52,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-23 14:25:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:52,698 INFO L225 Difference]: With dead ends: 65 [2018-01-23 14:25:52,698 INFO L226 Difference]: Without dead ends: 62 [2018-01-23 14:25:52,698 INFO L525 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-01-23 14:25:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-23 14:25:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-01-23 14:25:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-23 14:25:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2018-01-23 14:25:52,705 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 13 [2018-01-23 14:25:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:52,705 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2018-01-23 14:25:52,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:25:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2018-01-23 14:25:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-23 14:25:52,706 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,706 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,706 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:52,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1614897922, now seen corresponding path program 1 times [2018-01-23 14:25:52,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:52,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:52,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:52,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-23 14:25:52,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-23 14:25:52,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-23 14:25:52,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-23 14:25:52,759 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 4 states. [2018-01-23 14:25:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:52,806 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2018-01-23 14:25:52,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:25:52,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-23 14:25:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:52,808 INFO L225 Difference]: With dead ends: 114 [2018-01-23 14:25:52,808 INFO L226 Difference]: Without dead ends: 100 [2018-01-23 14:25:52,809 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01-23 14:25:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-23 14:25:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2018-01-23 14:25:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-23 14:25:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2018-01-23 14:25:52,824 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 19 [2018-01-23 14:25:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:52,824 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2018-01-23 14:25:52,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-23 14:25:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2018-01-23 14:25:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-23 14:25:52,827 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:52,827 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:52,827 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash -302614467, now seen corresponding path program 1 times [2018-01-23 14:25:52,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:52,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:52,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:52,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:52,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:25:52,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:52,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:25:52,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:25:52,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:25:52,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:25:52,937 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand 7 states. [2018-01-23 14:25:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:53,218 INFO L93 Difference]: Finished difference Result 227 states and 312 transitions. [2018-01-23 14:25:53,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:25:53,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-01-23 14:25:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:53,222 INFO L225 Difference]: With dead ends: 227 [2018-01-23 14:25:53,223 INFO L226 Difference]: Without dead ends: 174 [2018-01-23 14:25:53,223 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-23 14:25:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-23 14:25:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2018-01-23 14:25:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-23 14:25:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 207 transitions. [2018-01-23 14:25:53,248 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 207 transitions. Word has length 37 [2018-01-23 14:25:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:53,248 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 207 transitions. [2018-01-23 14:25:53,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:25:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 207 transitions. [2018-01-23 14:25:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-23 14:25:53,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:53,251 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:53,251 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:53,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1718063660, now seen corresponding path program 1 times [2018-01-23 14:25:53,251 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:53,251 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:53,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:53,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:53,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:53,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:25:53,453 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:53,453 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:25:53,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:53,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:25:53,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:25:53,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-01-23 14:25:53,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-23 14:25:53,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-23 14:25:53,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:25:53,740 INFO L87 Difference]: Start difference. First operand 150 states and 207 transitions. Second operand 15 states. [2018-01-23 14:25:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:56,648 INFO L93 Difference]: Finished difference Result 1110 states and 1686 transitions. [2018-01-23 14:25:56,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-01-23 14:25:56,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-01-23 14:25:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:56,659 INFO L225 Difference]: With dead ends: 1110 [2018-01-23 14:25:56,659 INFO L226 Difference]: Without dead ends: 941 [2018-01-23 14:25:56,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3258 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1379, Invalid=6993, Unknown=0, NotChecked=0, Total=8372 [2018-01-23 14:25:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2018-01-23 14:25:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 363. [2018-01-23 14:25:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-23 14:25:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 511 transitions. [2018-01-23 14:25:56,738 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 511 transitions. Word has length 47 [2018-01-23 14:25:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:56,738 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 511 transitions. [2018-01-23 14:25:56,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-23 14:25:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 511 transitions. [2018-01-23 14:25:56,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:25:56,741 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:56,741 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-01-23 14:25:56,741 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:56,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1650249222, now seen corresponding path program 1 times [2018-01-23 14:25:56,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:56,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:56,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:56,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:56,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:56,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-23 14:25:56,901 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:56,901 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:25:56,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:56,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-23 14:25:57,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:25:57,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-23 14:25:57,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:25:57,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:25:57,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:25:57,080 INFO L87 Difference]: Start difference. First operand 363 states and 511 transitions. Second operand 9 states. [2018-01-23 14:25:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:57,420 INFO L93 Difference]: Finished difference Result 801 states and 1160 transitions. [2018-01-23 14:25:57,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:25:57,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-01-23 14:25:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:57,425 INFO L225 Difference]: With dead ends: 801 [2018-01-23 14:25:57,425 INFO L226 Difference]: Without dead ends: 516 [2018-01-23 14:25:57,427 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:25:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-01-23 14:25:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 476. [2018-01-23 14:25:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-01-23 14:25:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 678 transitions. [2018-01-23 14:25:57,507 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 678 transitions. Word has length 73 [2018-01-23 14:25:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:57,508 INFO L432 AbstractCegarLoop]: Abstraction has 476 states and 678 transitions. [2018-01-23 14:25:57,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:25:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 678 transitions. [2018-01-23 14:25:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-23 14:25:57,511 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:57,511 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:25:57,511 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1980963244, now seen corresponding path program 1 times [2018-01-23 14:25:57,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:57,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:57,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:57,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:57,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:57,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-23 14:25:57,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:25:57,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-23 14:25:57,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-23 14:25:57,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-23 14:25:57,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-23 14:25:57,654 INFO L87 Difference]: Start difference. First operand 476 states and 678 transitions. Second operand 7 states. [2018-01-23 14:25:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:25:58,165 INFO L93 Difference]: Finished difference Result 1379 states and 2090 transitions. [2018-01-23 14:25:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:25:58,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-01-23 14:25:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:25:58,172 INFO L225 Difference]: With dead ends: 1379 [2018-01-23 14:25:58,173 INFO L226 Difference]: Without dead ends: 908 [2018-01-23 14:25:58,176 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-23 14:25:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-01-23 14:25:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 748. [2018-01-23 14:25:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-01-23 14:25:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1068 transitions. [2018-01-23 14:25:58,270 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1068 transitions. Word has length 74 [2018-01-23 14:25:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:25:58,271 INFO L432 AbstractCegarLoop]: Abstraction has 748 states and 1068 transitions. [2018-01-23 14:25:58,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-23 14:25:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1068 transitions. [2018-01-23 14:25:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-23 14:25:58,275 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:25:58,275 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 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-01-23 14:25:58,275 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-23 14:25:58,275 INFO L82 PathProgramCache]: Analyzing trace with hash 787103849, now seen corresponding path program 2 times [2018-01-23 14:25:58,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:25:58,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:25:58,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:58,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:25:58,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:25:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:25:58,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:25:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-01-23 14:25:58,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:25:58,567 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:25:58,574 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-23 14:25:58,616 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:25:58,655 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-23 14:25:58,664 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-23 14:25:58,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:25:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 79 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-23 14:25:58,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:25:58,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-01-23 14:25:58,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-23 14:25:58,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-23 14:25:58,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:25:58,908 INFO L87 Difference]: Start difference. First operand 748 states and 1068 transitions. Second operand 16 states. [2018-01-23 14:26:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:01,990 INFO L93 Difference]: Finished difference Result 2561 states and 4228 transitions. [2018-01-23 14:26:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-01-23 14:26:01,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 83 [2018-01-23 14:26:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:02,002 INFO L225 Difference]: With dead ends: 2561 [2018-01-23 14:26:02,002 INFO L226 Difference]: Without dead ends: 1818 [2018-01-23 14:26:02,008 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3245 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1128, Invalid=7802, Unknown=0, NotChecked=0, Total=8930 [2018-01-23 14:26:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2018-01-23 14:26:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 974. [2018-01-23 14:26:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-01-23 14:26:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1348 transitions. [2018-01-23 14:26:02,114 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1348 transitions. Word has length 83 [2018-01-23 14:26:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:02,114 INFO L432 AbstractCegarLoop]: Abstraction has 974 states and 1348 transitions. [2018-01-23 14:26:02,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-23 14:26:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1348 transitions. [2018-01-23 14:26:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-23 14:26:02,118 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:02,118 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:02,118 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:02,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1494721301, now seen corresponding path program 1 times [2018-01-23 14:26:02,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:02,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:02,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:02,119 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-23 14:26:02,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:02,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-01-23 14:26:02,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:02,280 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:02,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:02,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:02,436 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-01-23 14:26:02,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:02,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-23 14:26:02,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:26:02,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:26:02,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:26:02,458 INFO L87 Difference]: Start difference. First operand 974 states and 1348 transitions. Second operand 9 states. [2018-01-23 14:26:02,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:02,642 INFO L93 Difference]: Finished difference Result 2155 states and 3083 transitions. [2018-01-23 14:26:02,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-23 14:26:02,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-01-23 14:26:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:02,679 INFO L225 Difference]: With dead ends: 2155 [2018-01-23 14:26:02,680 INFO L226 Difference]: Without dead ends: 1186 [2018-01-23 14:26:02,685 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-01-23 14:26:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2018-01-23 14:26:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 978. [2018-01-23 14:26:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-01-23 14:26:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1352 transitions. [2018-01-23 14:26:02,787 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1352 transitions. Word has length 86 [2018-01-23 14:26:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:02,787 INFO L432 AbstractCegarLoop]: Abstraction has 978 states and 1352 transitions. [2018-01-23 14:26:02,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:26:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1352 transitions. [2018-01-23 14:26:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-23 14:26:02,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:02,791 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:02,792 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1024435374, now seen corresponding path program 1 times [2018-01-23 14:26:02,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:02,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:02,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:02,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:02,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:02,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-01-23 14:26:02,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:02,918 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:02,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:02,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-01-23 14:26:03,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:03,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-01-23 14:26:03,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:26:03,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:26:03,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:26:03,074 INFO L87 Difference]: Start difference. First operand 978 states and 1352 transitions. Second operand 9 states. [2018-01-23 14:26:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:03,289 INFO L93 Difference]: Finished difference Result 2288 states and 3260 transitions. [2018-01-23 14:26:03,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-23 14:26:03,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-01-23 14:26:03,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:03,295 INFO L225 Difference]: With dead ends: 2288 [2018-01-23 14:26:03,295 INFO L226 Difference]: Without dead ends: 1315 [2018-01-23 14:26:03,299 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-23 14:26:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-01-23 14:26:03,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1214. [2018-01-23 14:26:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-01-23 14:26:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1719 transitions. [2018-01-23 14:26:03,386 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1719 transitions. Word has length 87 [2018-01-23 14:26:03,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:03,386 INFO L432 AbstractCegarLoop]: Abstraction has 1214 states and 1719 transitions. [2018-01-23 14:26:03,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:26:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1719 transitions. [2018-01-23 14:26:03,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-23 14:26:03,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:03,390 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:03,390 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash 160797049, now seen corresponding path program 1 times [2018-01-23 14:26:03,391 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:03,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:03,391 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:03,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:03,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:03,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-01-23 14:26:03,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:03,512 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:03,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:03,593 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:03,704 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|push_#t~malloc2.base| Int)) (and (<= (select |c_old(#valid)| |push_#t~malloc2.base|) 0) (= |c_#valid| (store |c_old(#valid)| |push_#t~malloc2.base| 1)))) is different from true [2018-01-23 14:26:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-01-23 14:26:03,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:26:03,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-01-23 14:26:03,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-23 14:26:03,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-23 14:26:03,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2018-01-23 14:26:03,747 INFO L87 Difference]: Start difference. First operand 1214 states and 1719 transitions. Second operand 10 states. [2018-01-23 14:26:04,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:04,236 INFO L93 Difference]: Finished difference Result 2869 states and 4263 transitions. [2018-01-23 14:26:04,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-23 14:26:04,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-01-23 14:26:04,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:04,243 INFO L225 Difference]: With dead ends: 2869 [2018-01-23 14:26:04,244 INFO L226 Difference]: Without dead ends: 1590 [2018-01-23 14:26:04,248 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=141, Unknown=2, NotChecked=24, Total=210 [2018-01-23 14:26:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-01-23 14:26:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1357. [2018-01-23 14:26:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2018-01-23 14:26:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1925 transitions. [2018-01-23 14:26:04,355 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1925 transitions. Word has length 88 [2018-01-23 14:26:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:04,356 INFO L432 AbstractCegarLoop]: Abstraction has 1357 states and 1925 transitions. [2018-01-23 14:26:04,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-23 14:26:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1925 transitions. [2018-01-23 14:26:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-23 14:26:04,361 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:04,361 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:04,361 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1938594935, now seen corresponding path program 1 times [2018-01-23 14:26:04,362 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:04,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:04,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:04,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:04,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:04,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-01-23 14:26:04,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:04,487 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:04,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:04,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 77 proven. 12 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-23 14:26:04,722 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:26:04,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-23 14:26:04,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-23 14:26:04,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-23 14:26:04,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-23 14:26:04,723 INFO L87 Difference]: Start difference. First operand 1357 states and 1925 transitions. Second operand 16 states. [2018-01-23 14:26:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:05,775 INFO L93 Difference]: Finished difference Result 4709 states and 7628 transitions. [2018-01-23 14:26:05,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-23 14:26:05,777 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 88 [2018-01-23 14:26:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:05,797 INFO L225 Difference]: With dead ends: 4709 [2018-01-23 14:26:05,797 INFO L226 Difference]: Without dead ends: 3357 [2018-01-23 14:26:05,805 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2018-01-23 14:26:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2018-01-23 14:26:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 1751. [2018-01-23 14:26:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-01-23 14:26:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2416 transitions. [2018-01-23 14:26:06,056 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2416 transitions. Word has length 88 [2018-01-23 14:26:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:06,056 INFO L432 AbstractCegarLoop]: Abstraction has 1751 states and 2416 transitions. [2018-01-23 14:26:06,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-23 14:26:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2416 transitions. [2018-01-23 14:26:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-01-23 14:26:06,062 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:06,062 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:06,062 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2024113882, now seen corresponding path program 1 times [2018-01-23 14:26:06,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:06,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:06,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:06,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:06,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:06,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 38 proven. 41 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-23 14:26:06,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:06,243 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:06,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:06,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-01-23 14:26:06,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:26:06,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-01-23 14:26:06,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-23 14:26:06,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-23 14:26:06,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:26:06,415 INFO L87 Difference]: Start difference. First operand 1751 states and 2416 transitions. Second operand 15 states. [2018-01-23 14:26:08,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:08,968 INFO L93 Difference]: Finished difference Result 7899 states and 11986 transitions. [2018-01-23 14:26:08,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-01-23 14:26:08,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2018-01-23 14:26:08,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:09,011 INFO L225 Difference]: With dead ends: 7899 [2018-01-23 14:26:09,011 INFO L226 Difference]: Without dead ends: 6714 [2018-01-23 14:26:09,021 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=937, Invalid=4033, Unknown=0, NotChecked=0, Total=4970 [2018-01-23 14:26:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6714 states. [2018-01-23 14:26:09,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6714 to 5486. [2018-01-23 14:26:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5486 states. [2018-01-23 14:26:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 7742 transitions. [2018-01-23 14:26:09,657 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 7742 transitions. Word has length 90 [2018-01-23 14:26:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:09,657 INFO L432 AbstractCegarLoop]: Abstraction has 5486 states and 7742 transitions. [2018-01-23 14:26:09,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-23 14:26:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 7742 transitions. [2018-01-23 14:26:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-23 14:26:09,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:09,665 INFO L322 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:09,665 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:09,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1515124594, now seen corresponding path program 1 times [2018-01-23 14:26:09,665 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:09,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:09,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:09,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:09,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:09,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 117 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-23 14:26:09,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:09,953 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:09,958 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:10,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:10,103 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 67 proven. 13 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-23 14:26:10,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:26:10,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-01-23 14:26:10,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-23 14:26:10,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-23 14:26:10,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-01-23 14:26:10,124 INFO L87 Difference]: Start difference. First operand 5486 states and 7742 transitions. Second operand 19 states. [2018-01-23 14:26:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:20,964 INFO L93 Difference]: Finished difference Result 20727 states and 32186 transitions. [2018-01-23 14:26:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-01-23 14:26:20,965 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 107 [2018-01-23 14:26:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:21,020 INFO L225 Difference]: With dead ends: 20727 [2018-01-23 14:26:21,020 INFO L226 Difference]: Without dead ends: 14661 [2018-01-23 14:26:21,053 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21189 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=6178, Invalid=42442, Unknown=0, NotChecked=0, Total=48620 [2018-01-23 14:26:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14661 states. [2018-01-23 14:26:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14661 to 10095. [2018-01-23 14:26:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10095 states. [2018-01-23 14:26:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10095 states to 10095 states and 14119 transitions. [2018-01-23 14:26:22,299 INFO L78 Accepts]: Start accepts. Automaton has 10095 states and 14119 transitions. Word has length 107 [2018-01-23 14:26:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:22,299 INFO L432 AbstractCegarLoop]: Abstraction has 10095 states and 14119 transitions. [2018-01-23 14:26:22,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-23 14:26:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10095 states and 14119 transitions. [2018-01-23 14:26:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-23 14:26:22,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:22,311 INFO L322 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:22,311 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1101024242, now seen corresponding path program 1 times [2018-01-23 14:26:22,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:22,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:22,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:22,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:22,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:22,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 136 proven. 14 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-01-23 14:26:22,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:22,471 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:22,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:22,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 121 proven. 3 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-01-23 14:26:22,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:26:22,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-01-23 14:26:22,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-23 14:26:22,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-23 14:26:22,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-23 14:26:22,756 INFO L87 Difference]: Start difference. First operand 10095 states and 14119 transitions. Second operand 15 states. [2018-01-23 14:26:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:26:27,153 INFO L93 Difference]: Finished difference Result 47099 states and 66396 transitions. [2018-01-23 14:26:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-01-23 14:26:27,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2018-01-23 14:26:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:26:27,264 INFO L225 Difference]: With dead ends: 47099 [2018-01-23 14:26:27,264 INFO L226 Difference]: Without dead ends: 36979 [2018-01-23 14:26:27,292 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3928 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1525, Invalid=8575, Unknown=0, NotChecked=0, Total=10100 [2018-01-23 14:26:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36979 states. [2018-01-23 14:26:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36979 to 34689. [2018-01-23 14:26:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34689 states. [2018-01-23 14:26:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34689 states to 34689 states and 49121 transitions. [2018-01-23 14:26:30,095 INFO L78 Accepts]: Start accepts. Automaton has 34689 states and 49121 transitions. Word has length 109 [2018-01-23 14:26:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:26:30,095 INFO L432 AbstractCegarLoop]: Abstraction has 34689 states and 49121 transitions. [2018-01-23 14:26:30,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-23 14:26:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 34689 states and 49121 transitions. [2018-01-23 14:26:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-01-23 14:26:30,112 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:26:30,112 INFO L322 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:26:30,112 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation]=== [2018-01-23 14:26:30,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1036268918, now seen corresponding path program 1 times [2018-01-23 14:26:30,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:26:30,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:26:30,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:30,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:30,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:26:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:30,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:26:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 8 proven. 295 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-23 14:26:30,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:26:30,381 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:26:30,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:26:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:26:30,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:26:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 194 proven. 18 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-23 14:26:30,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:26:30,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-01-23 14:26:30,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-23 14:26:30,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-23 14:26:30,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-01-23 14:26:30,653 INFO L87 Difference]: Start difference. First operand 34689 states and 49121 transitions. Second operand 25 states. [2018-01-23 14:26:31,442 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 38 DAG size of output 33 [2018-01-23 14:26:34,038 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 43 DAG size of output 31 Received shutdown request... [2018-01-23 14:26:36,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-01-23 14:26:36,906 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:26:36,909 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:26:36,909 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:26:36,909 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:26:36,909 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:26:36,909 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:26:36,909 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:26:36,909 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:26:36,909 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == pushErr0EnsuresViolation======== [2018-01-23 14:26:36,910 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:26:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-23 14:26:36,911 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-23 14:26:36,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:26:36 BoogieIcfgContainer [2018-01-23 14:26:36,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:26:36,913 INFO L168 Benchmark]: Toolchain (without parser) took 45838.89 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 265.2 MB in the beginning and 1.2 GB in the end (delta: -914.0 MB). Peak memory consumption was 192.7 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:36,915 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:26:36,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.51 ms. Allocated memory is still 307.2 MB. Free memory was 264.2 MB in the beginning and 253.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:36,915 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:36,916 INFO L168 Benchmark]: RCFGBuilder took 332.41 ms. Allocated memory is still 307.2 MB. Free memory was 251.1 MB in the beginning and 227.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:36,916 INFO L168 Benchmark]: TraceAbstraction took 45244.85 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 227.9 MB in the beginning and 1.2 GB in the end (delta: -951.2 MB). Peak memory consumption was 155.5 MB. Max. memory is 5.3 GB. [2018-01-23 14:26:36,918 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.18 ms. Allocated memory is still 307.2 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.51 ms. Allocated memory is still 307.2 MB. Free memory was 264.2 MB in the beginning and 253.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.83 ms. Allocated memory is still 307.2 MB. Free memory was 253.1 MB in the beginning and 251.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 332.41 ms. Allocated memory is still 307.2 MB. Free memory was 251.1 MB in the beginning and 227.9 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45244.85 ms. Allocated memory was 307.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 227.9 MB in the beginning and 1.2 GB in the end (delta: -951.2 MB). Peak memory consumption was 155.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 658]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: popErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 8 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L629] static struct cell *t1 = ((void *)0); [L630] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L660] static struct cell *t4 = ((void *)0); [L661] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=15, \old(garbage)=17, \old(pc1)=7, \old(pc4)=10, \old(res4)=5, \old(S)=4, \old(S)=8, \old(t1)=11, \old(t1)=3, \old(t4)=14, \old(t4)=12, \old(x1)=1, \old(x1)=6, \old(x4)=16, \old(x4)=13, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L629] static struct cell *t1 = ((void *)0); [L630] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L660] static struct cell *t4 = ((void *)0); [L661] 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 || 1 != pc4 || __VERIFIER_nondet_int() [L690] S || 1 != pc1 || 1 != pc4 || __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=1, res4=0, S={0:0}, S || 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L701] return !!garbage; VAL [garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 0 SDslu, 69 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 688]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 688). Cancelled while BasicCegarLoop was constructing difference of abstraction (34689states) and interpolant automaton (currently 132 states, 25 states before enhancement), while ReachableStatesComputation was computing reachable states (20593 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 44.4s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1323 SDtfs, 12238 SDslu, 5180 SDs, 0 SdLazy, 13598 SolverSat, 5859 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2012 GetRequests, 1183 SyntacticMatches, 4 SemanticMatches, 825 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41692 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34689occurred in iteration=16, 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, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 11887 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2129 NumberOfCodeBlocks, 2129 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2101 ConstructedInterpolants, 4 QuantifiedInterpolants, 458282 SizeOfPredicates, 43 NumberOfNonLiveVariables, 6483 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 28 InterpolantComputations, 10 PerfectInterpolantSequences, 2486/3124 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 627). Cancelled while IsEmpty was searching accepting run (input had 62 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: pushErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-26-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-26-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-26-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-26-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-26-36-927.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.0_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-26-36-927.csv Completed graceful shutdown