java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:25:19,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:25:19,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:25:19,281 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:25:19,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:25:19,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:25:19,282 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:25:19,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:25:19,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:25:19,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:25:19,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:25:19,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:25:19,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:25:19,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:25:19,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:25:19,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:25:19,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:25:19,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:25:19,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:25:19,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:25:19,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:25:19,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:25:19,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:25:19,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:25:19,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:25:19,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:25:19,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:25:19,300 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:25:19,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:25:19,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:25:19,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:25:19,301 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:25:19,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:25:19,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:25:19,311 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:25:19,311 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:25:19,311 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:25:19,311 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:25:19,311 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:25:19,311 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:25:19,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:25:19,312 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:25:19,312 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:25:19,312 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:25:19,312 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:25:19,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:25:19,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:25:19,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:25:19,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:25:19,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:25:19,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:25:19,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:25:19,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:25:19,313 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:25:19,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:25:19,314 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:25:19,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:25:19,350 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:25:19,352 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:25:19,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:25:19,353 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:25:19,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/diff-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:19,492 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:25:19,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:25:19,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:19,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:25:19,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:25:19,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3ffa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19, skipping insertion in model container [2018-02-04 17:25:19,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,512 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:19,538 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:19,620 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:19,633 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:19,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19 WrapperNode [2018-02-04 17:25:19,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:19,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:25:19,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:25:19,640 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:25:19,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... [2018-02-04 17:25:19,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:25:19,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:25:19,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:25:19,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:25:19,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:25:19,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:25:19,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:25:19,701 INFO L136 BoogieDeclarations]: Found implementation of procedure diff [2018-02-04 17:25:19,701 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:25:19,701 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:25:19,701 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:25:19,701 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:25:19,701 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:25:19,702 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:25:19,702 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:25:19,702 INFO L128 BoogieDeclarations]: Found specification of procedure diff [2018-02-04 17:25:19,702 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:25:19,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:25:19,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:25:19,877 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:25:19,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:19 BoogieIcfgContainer [2018-02-04 17:25:19,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:25:19,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:25:19,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:25:19,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:25:19,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:25:19" (1/3) ... [2018-02-04 17:25:19,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1446d3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:19, skipping insertion in model container [2018-02-04 17:25:19,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:19" (2/3) ... [2018-02-04 17:25:19,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1446d3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:19, skipping insertion in model container [2018-02-04 17:25:19,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:19" (3/3) ... [2018-02-04 17:25:19,882 INFO L107 eAbstractionObserver]: Analyzing ICFG diff-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:19,888 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:25:19,892 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 17:25:19,921 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:25:19,921 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:25:19,921 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:25:19,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:25:19,922 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:25:19,922 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:25:19,922 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:25:19,922 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:25:19,923 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:25:19,934 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-04 17:25:19,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:25:19,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:19,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:19,943 INFO L371 AbstractCegarLoop]: === Iteration 1 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:19,946 INFO L82 PathProgramCache]: Analyzing trace with hash -24174499, now seen corresponding path program 1 times [2018-02-04 17:25:19,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:19,947 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:19,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:19,976 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:19,976 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:20,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:20,050 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:20,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:20,050 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:20,051 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:20,106 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:20,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:20,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:25:20,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:20,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:20,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:25:20,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:20,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:25:20,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 17:25:20,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:20,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-02-04 17:25:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:20,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:20,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:25:20,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:25:20,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:25:20,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:20,363 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 7 states. [2018-02-04 17:25:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:20,490 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-04 17:25:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:25:20,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 17:25:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:20,500 INFO L225 Difference]: With dead ends: 48 [2018-02-04 17:25:20,500 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:25:20,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:25:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:25:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:25:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-02-04 17:25:20,535 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 21 [2018-02-04 17:25:20,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:20,535 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-02-04 17:25:20,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:25:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-02-04 17:25:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:25:20,536 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:20,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:20,537 INFO L371 AbstractCegarLoop]: === Iteration 2 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash -24174498, now seen corresponding path program 1 times [2018-02-04 17:25:20,537 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:20,537 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:20,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:20,538 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:20,538 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:20,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:20,565 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:20,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:20,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:20,567 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:20,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:20,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:25:20,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:20,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 17:25:20,671 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:20,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 17:25:20,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:20,685 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:20,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:25:20,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:20,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:20,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-02-04 17:25:20,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2018-02-04 17:25:20,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:25:20,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-04 17:25:20,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:56 [2018-02-04 17:25:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:20,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:20,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:25:20,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:25:20,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:25:20,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:20,899 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 10 states. [2018-02-04 17:25:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:21,257 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2018-02-04 17:25:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:25:21,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 17:25:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:21,260 INFO L225 Difference]: With dead ends: 100 [2018-02-04 17:25:21,260 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 17:25:21,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:25:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 17:25:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2018-02-04 17:25:21,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 17:25:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2018-02-04 17:25:21,268 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 21 [2018-02-04 17:25:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:21,268 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2018-02-04 17:25:21,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:25:21,268 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2018-02-04 17:25:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:25:21,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:21,269 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:21,269 INFO L371 AbstractCegarLoop]: === Iteration 3 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1035291748, now seen corresponding path program 1 times [2018-02-04 17:25:21,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:21,269 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:21,269 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:21,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:21,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:21,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:21,295 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:21,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:21,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:21,296 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:21,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:21,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:25:21,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:21,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-02-04 17:25:21,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:21,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:25:21,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:21,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:21,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:25:21,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:21,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:25 [2018-02-04 17:25:21,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2018-02-04 17:25:21,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:25:21,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-04 17:25:21,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:33, output treesize:58 [2018-02-04 17:25:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:21,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:21,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:25:21,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:25:21,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:25:21,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:21,510 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand 9 states. [2018-02-04 17:25:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:21,681 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2018-02-04 17:25:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:25:21,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 17:25:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:21,683 INFO L225 Difference]: With dead ends: 99 [2018-02-04 17:25:21,683 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 17:25:21,683 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 17:25:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 17:25:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2018-02-04 17:25:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 17:25:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 17:25:21,687 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 21 [2018-02-04 17:25:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:21,688 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 17:25:21,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:25:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 17:25:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:25:21,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:21,688 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:21,689 INFO L371 AbstractCegarLoop]: === Iteration 4 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash -749409470, now seen corresponding path program 1 times [2018-02-04 17:25:21,689 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:21,689 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:21,689 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:21,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:21,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:21,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:21,703 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:21,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:21,704 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:21,704 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:21,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:21,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:21,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:25:21,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:21,742 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:21,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:25:21,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:21,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:25:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:21,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:21,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:25:21,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:25:21,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:25:21,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:21,769 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 7 states. [2018-02-04 17:25:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:21,837 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-02-04 17:25:21,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:25:21,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-02-04 17:25:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:21,838 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:25:21,838 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 17:25:21,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 17:25:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 17:25:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 17:25:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-04 17:25:21,841 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-04 17:25:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:21,841 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-04 17:25:21,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:25:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-04 17:25:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:25:21,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:21,841 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:21,841 INFO L371 AbstractCegarLoop]: === Iteration 5 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:21,842 INFO L82 PathProgramCache]: Analyzing trace with hash -749409469, now seen corresponding path program 1 times [2018-02-04 17:25:21,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:21,842 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:21,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:21,842 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:21,842 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:21,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:21,854 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:21,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:21,854 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:21,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:21,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:21,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:21,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:25:21,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:21,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:19 [2018-02-04 17:25:21,933 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:21,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:21,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:25:21,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:25:21,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:21,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:21,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:25 [2018-02-04 17:25:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:22,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:22,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:25:22,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:25:22,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:25:22,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:22,029 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 9 states. [2018-02-04 17:25:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:22,268 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-02-04 17:25:22,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:22,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 17:25:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:22,270 INFO L225 Difference]: With dead ends: 78 [2018-02-04 17:25:22,270 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 17:25:22,270 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:25:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 17:25:22,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 63. [2018-02-04 17:25:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 17:25:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2018-02-04 17:25:22,275 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 22 [2018-02-04 17:25:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:22,275 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2018-02-04 17:25:22,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:25:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2018-02-04 17:25:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:25:22,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:22,276 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:22,276 INFO L371 AbstractCegarLoop]: === Iteration 6 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899853, now seen corresponding path program 1 times [2018-02-04 17:25:22,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:22,276 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:22,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,277 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:22,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:22,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:22,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:22,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:25:22,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:25:22,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:25:22,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:25:22,313 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand 6 states. [2018-02-04 17:25:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:22,344 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2018-02-04 17:25:22,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:25:22,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 17:25:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:22,345 INFO L225 Difference]: With dead ends: 62 [2018-02-04 17:25:22,345 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 17:25:22,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 17:25:22,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 17:25:22,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 17:25:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2018-02-04 17:25:22,349 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 23 [2018-02-04 17:25:22,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:22,349 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2018-02-04 17:25:22,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:25:22,349 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2018-02-04 17:25:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:25:22,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:22,350 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:22,350 INFO L371 AbstractCegarLoop]: === Iteration 7 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1756899852, now seen corresponding path program 1 times [2018-02-04 17:25:22,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:22,350 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:22,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:22,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:22,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:22,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:22,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:25:22,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:25:22,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:25:22,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:25:22,391 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand 6 states. [2018-02-04 17:25:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:22,414 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2018-02-04 17:25:22,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:25:22,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 17:25:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:22,416 INFO L225 Difference]: With dead ends: 73 [2018-02-04 17:25:22,416 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 17:25:22,416 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 17:25:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2018-02-04 17:25:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 17:25:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2018-02-04 17:25:22,423 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 23 [2018-02-04 17:25:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:22,423 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2018-02-04 17:25:22,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:25:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-02-04 17:25:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:25:22,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:22,424 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:22,424 INFO L371 AbstractCegarLoop]: === Iteration 8 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1795864658, now seen corresponding path program 1 times [2018-02-04 17:25:22,424 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:22,424 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:22,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,425 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:22,425 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:22,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:22,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:22,501 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:22,502 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:22,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:22,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:22,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2018-02-04 17:25:22,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:25:22,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:25:22,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:25:22,555 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 13 states. [2018-02-04 17:25:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:22,639 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2018-02-04 17:25:22,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:22,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 17:25:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:22,640 INFO L225 Difference]: With dead ends: 132 [2018-02-04 17:25:22,640 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 17:25:22,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:25:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 17:25:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2018-02-04 17:25:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 17:25:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2018-02-04 17:25:22,646 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 27 [2018-02-04 17:25:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:22,646 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2018-02-04 17:25:22,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:25:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2018-02-04 17:25:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 17:25:22,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:22,647 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:22,647 INFO L371 AbstractCegarLoop]: === Iteration 9 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1681454188, now seen corresponding path program 1 times [2018-02-04 17:25:22,647 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:22,647 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:22,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,648 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:22,648 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:22,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:22,659 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:22,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:22,660 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:22,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:22,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:22,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:25:22,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:22,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:22,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:22,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:22,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 17:25:22,699 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:22,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:22,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:25:22,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:22,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:25:22,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:22,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:22,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:22 [2018-02-04 17:25:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:22,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:22,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 17:25:22,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:25:22,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:25:22,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:22,859 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand 10 states. [2018-02-04 17:25:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:23,289 INFO L93 Difference]: Finished difference Result 159 states and 197 transitions. [2018-02-04 17:25:23,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:25:23,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 17:25:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:23,291 INFO L225 Difference]: With dead ends: 159 [2018-02-04 17:25:23,291 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 17:25:23,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:25:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 17:25:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 94. [2018-02-04 17:25:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 17:25:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2018-02-04 17:25:23,297 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 27 [2018-02-04 17:25:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:23,297 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2018-02-04 17:25:23,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:25:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2018-02-04 17:25:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:25:23,298 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:23,298 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:23,298 INFO L371 AbstractCegarLoop]: === Iteration 10 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash -719244418, now seen corresponding path program 1 times [2018-02-04 17:25:23,299 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:23,299 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:23,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,300 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:23,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:23,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:23,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:23,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:25:23,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:25:23,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:25:23,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:25:23,333 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand 5 states. [2018-02-04 17:25:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:23,358 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-04 17:25:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:25:23,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 17:25:23,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:23,359 INFO L225 Difference]: With dead ends: 105 [2018-02-04 17:25:23,359 INFO L226 Difference]: Without dead ends: 101 [2018-02-04 17:25:23,359 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:25:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-04 17:25:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2018-02-04 17:25:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 17:25:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-02-04 17:25:23,363 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 28 [2018-02-04 17:25:23,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:23,363 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-02-04 17:25:23,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:25:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-02-04 17:25:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:25:23,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:23,364 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 17:25:23,364 INFO L371 AbstractCegarLoop]: === Iteration 11 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash 105469355, now seen corresponding path program 1 times [2018-02-04 17:25:23,364 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:23,364 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:23,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,365 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:23,365 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:23,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:23,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:23,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:25:23,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:25:23,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:25:23,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:25:23,391 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 4 states. [2018-02-04 17:25:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:23,400 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-04 17:25:23,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:25:23,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-02-04 17:25:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:23,402 INFO L225 Difference]: With dead ends: 122 [2018-02-04 17:25:23,402 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 17:25:23,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:25:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 17:25:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2018-02-04 17:25:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 17:25:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-04 17:25:23,406 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-04 17:25:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:23,406 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-04 17:25:23,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:25:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-04 17:25:23,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:25:23,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:23,407 INFO L351 BasicCegarLoop]: trace histogram [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-02-04 17:25:23,407 INFO L371 AbstractCegarLoop]: === Iteration 12 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:23,408 INFO L82 PathProgramCache]: Analyzing trace with hash 162727657, now seen corresponding path program 1 times [2018-02-04 17:25:23,408 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:23,408 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:23,408 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,409 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:23,409 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:23,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:25:23,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:23,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:25:23,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:25:23,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:25:23,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:23,453 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 7 states. [2018-02-04 17:25:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:23,519 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2018-02-04 17:25:23,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:25:23,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 17:25:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:23,524 INFO L225 Difference]: With dead ends: 136 [2018-02-04 17:25:23,524 INFO L226 Difference]: Without dead ends: 136 [2018-02-04 17:25:23,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-04 17:25:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2018-02-04 17:25:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-02-04 17:25:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2018-02-04 17:25:23,529 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 28 [2018-02-04 17:25:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:23,529 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2018-02-04 17:25:23,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:25:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2018-02-04 17:25:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 17:25:23,530 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:23,530 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 17:25:23,531 INFO L371 AbstractCegarLoop]: === Iteration 13 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1543275401, now seen corresponding path program 1 times [2018-02-04 17:25:23,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:23,531 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:23,531 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:23,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:23,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:23,551 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:23,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:23,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:23,552 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:23,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:23,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:25:23,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:23,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:25:23,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:23,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:23,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 17:25:23,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:23,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:25:23,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:23,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:23,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:23,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:25:23,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:23,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:23,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:22 [2018-02-04 17:25:23,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2018-02-04 17:25:23,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 17:25:23,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 17:25:23,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:52 [2018-02-04 17:25:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:23,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:23,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 17:25:23,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:25:23,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:25:23,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:25:23,833 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand 10 states. [2018-02-04 17:25:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:24,088 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2018-02-04 17:25:24,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:25:24,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-02-04 17:25:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:24,089 INFO L225 Difference]: With dead ends: 141 [2018-02-04 17:25:24,089 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 17:25:24,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-02-04 17:25:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 17:25:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 108. [2018-02-04 17:25:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 17:25:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2018-02-04 17:25:24,092 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 32 [2018-02-04 17:25:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:24,092 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2018-02-04 17:25:24,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:25:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2018-02-04 17:25:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 17:25:24,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:24,093 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:24,093 INFO L371 AbstractCegarLoop]: === Iteration 14 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2051078643, now seen corresponding path program 1 times [2018-02-04 17:25:24,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:24,094 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:24,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:24,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:24,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:24,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:24,105 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:24,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:24,105 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:24,106 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:24,121 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:24,160 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:24,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 17:25:24,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:24,173 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:24,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 42 [2018-02-04 17:25:24,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-02-04 17:25:24,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:24,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:24,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:24,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:24,192 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:37, output treesize:28 [2018-02-04 17:25:24,225 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc9.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc9.base| 1))) (let ((.cse0 (store .cse1 |main_#t~malloc10.base| 1))) (and (= (store (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc9.base| 0) |main_#t~malloc10.base| 0) |c_#valid|) (= (select .cse1 |main_#t~malloc10.base|) 0) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc9.base|)))))) is different from true [2018-02-04 17:25:24,229 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc9.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc9.base| 1))) (let ((.cse1 (store .cse0 |main_#t~malloc10.base| 1))) (and (= (select .cse0 |main_#t~malloc10.base|) 0) (= |c_#valid| (store (store (store (store .cse1 |main_#t~malloc11.base| 1) |main_#t~malloc9.base| 0) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0)) (= (select .cse1 |main_#t~malloc11.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc9.base|)))))) is different from true [2018-02-04 17:25:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:25:24,234 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:24,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:25:24,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:25:24,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:25:24,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=43, Unknown=3, NotChecked=26, Total=90 [2018-02-04 17:25:24,234 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2018-02-04 17:25:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:24,369 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-02-04 17:25:24,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:24,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-02-04 17:25:24,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:24,370 INFO L225 Difference]: With dead ends: 107 [2018-02-04 17:25:24,370 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 17:25:24,370 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=55, Unknown=3, NotChecked=30, Total=110 [2018-02-04 17:25:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 17:25:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-02-04 17:25:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-04 17:25:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-02-04 17:25:24,373 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 39 [2018-02-04 17:25:24,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:24,373 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-02-04 17:25:24,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:25:24,374 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-02-04 17:25:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:25:24,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:24,375 INFO L351 BasicCegarLoop]: trace histogram [4, 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] [2018-02-04 17:25:24,375 INFO L371 AbstractCegarLoop]: === Iteration 15 === [diffErr2RequiresViolation, diffErr4RequiresViolation, diffErr0RequiresViolation, diffErr6RequiresViolation, diffErr5RequiresViolation, diffErr1RequiresViolation, diffErr3RequiresViolation, diffErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1625144734, now seen corresponding path program 1 times [2018-02-04 17:25:24,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:24,375 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:24,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:24,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:24,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:24,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 17:25:24,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:24,530 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:24,531 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:24,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:24,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:25:24,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:24,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:24,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:25:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:25:24,720 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:24,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-02-04 17:25:24,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 17:25:24,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 17:25:24,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:25:24,721 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 21 states. [2018-02-04 17:25:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:25,161 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2018-02-04 17:25:25,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:25:25,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-02-04 17:25:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:25,162 INFO L225 Difference]: With dead ends: 138 [2018-02-04 17:25:25,162 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:25:25,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2018-02-04 17:25:25,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:25:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:25:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:25:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:25:25,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-02-04 17:25:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:25,163 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:25:25,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 17:25:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:25:25,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:25:25,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:25:25 BoogieIcfgContainer [2018-02-04 17:25:25,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:25:25,167 INFO L168 Benchmark]: Toolchain (without parser) took 5674.22 ms. Allocated memory was 391.1 MB in the beginning and 702.0 MB in the end (delta: 310.9 MB). Free memory was 349.3 MB in the beginning and 538.3 MB in the end (delta: -189.0 MB). Peak memory consumption was 121.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:25,168 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 391.1 MB. Free memory is still 354.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:25:25,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.59 ms. Allocated memory is still 391.1 MB. Free memory was 348.0 MB in the beginning and 337.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:25,168 INFO L168 Benchmark]: Boogie Preprocessor took 25.89 ms. Allocated memory is still 391.1 MB. Free memory was 337.4 MB in the beginning and 336.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:25,168 INFO L168 Benchmark]: RCFGBuilder took 212.47 ms. Allocated memory is still 391.1 MB. Free memory was 336.1 MB in the beginning and 315.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:25,169 INFO L168 Benchmark]: TraceAbstraction took 5287.88 ms. Allocated memory was 391.1 MB in the beginning and 702.0 MB in the end (delta: 310.9 MB). Free memory was 315.3 MB in the beginning and 538.3 MB in the end (delta: -222.9 MB). Peak memory consumption was 88.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:25,170 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.15 ms. Allocated memory is still 391.1 MB. Free memory is still 354.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.59 ms. Allocated memory is still 391.1 MB. Free memory was 348.0 MB in the beginning and 337.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.89 ms. Allocated memory is still 391.1 MB. Free memory was 337.4 MB in the beginning and 336.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 212.47 ms. Allocated memory is still 391.1 MB. Free memory was 336.1 MB in the beginning and 315.3 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5287.88 ms. Allocated memory was 391.1 MB in the beginning and 702.0 MB in the end (delta: 310.9 MB). Free memory was 315.3 MB in the beginning and 538.3 MB in the end (delta: -222.9 MB). Peak memory consumption was 88.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 9 error locations. SAFE Result, 5.2s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 598 SDtfs, 1151 SDslu, 2151 SDs, 0 SdLazy, 1528 SolverSat, 145 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 203 SyntacticMatches, 5 SemanticMatches, 159 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 261 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 678 NumberOfCodeBlocks, 678 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 456 ConstructedInterpolants, 134 QuantifiedInterpolants, 179884 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1453 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 26/69 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-25-25-177.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/diff-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-25-25-177.csv Received shutdown request...