java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:19:57,654 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:19:57,655 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:19:57,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:19:57,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:19:57,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:19:57,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:19:57,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:19:57,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:19:57,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:19:57,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:19:57,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:19:57,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:19:57,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:19:57,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:19:57,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:19:57,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:19:57,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:19:57,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:19:57,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:19:57,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:19:57,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:19:57,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:19:57,684 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:19:57,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:19:57,686 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:19:57,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:19:57,686 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:19:57,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:19:57,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:19:57,687 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:19:57,688 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:19:57,697 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:19:57,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:19:57,698 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:19:57,698 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:19:57,698 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:19:57,698 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:19:57,699 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:19:57,699 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:19:57,699 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:19:57,699 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:19:57,699 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:19:57,699 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:19:57,699 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:19:57,700 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:19:57,700 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:19:57,700 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:19:57,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:19:57,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:19:57,700 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:19:57,700 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:19:57,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:19:57,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:19:57,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:19:57,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:19:57,738 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:19:57,741 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:19:57,742 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:19:57,742 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:19:57,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-02 10:19:57,904 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:19:57,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:19:57,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:57,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:19:57,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:19:57,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:57" (1/1) ... [2018-02-02 10:19:57,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4538bc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:57, skipping insertion in model container [2018-02-02 10:19:57,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:19:57" (1/1) ... [2018-02-02 10:19:57,921 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:57,954 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:19:58,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:58,059 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:19:58,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58 WrapperNode [2018-02-02 10:19:58,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:19:58,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:19:58,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:19:58,065 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:19:58,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... [2018-02-02 10:19:58,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... [2018-02-02 10:19:58,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... [2018-02-02 10:19:58,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... [2018-02-02 10:19:58,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... [2018-02-02 10:19:58,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... [2018-02-02 10:19:58,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... [2018-02-02 10:19:58,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:19:58,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:19:58,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:19:58,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:19:58,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:19:58,125 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:19:58,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:19:58,126 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:19:58,126 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:19:58,126 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:19:58,126 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:19:58,127 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:19:58,127 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:19:58,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:19:58,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:19:58,231 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:19:58,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:58 BoogieIcfgContainer [2018-02-02 10:19:58,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:19:58,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:19:58,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:19:58,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:19:58,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:19:57" (1/3) ... [2018-02-02 10:19:58,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210ba985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:58, skipping insertion in model container [2018-02-02 10:19:58,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:19:58" (2/3) ... [2018-02-02 10:19:58,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210ba985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:19:58, skipping insertion in model container [2018-02-02 10:19:58,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:19:58" (3/3) ... [2018-02-02 10:19:58,236 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-02-02 10:19:58,242 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:19:58,247 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:19:58,281 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:19:58,281 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:19:58,282 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:19:58,282 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:19:58,282 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:19:58,282 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:19:58,282 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:19:58,282 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:19:58,283 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:19:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-02 10:19:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:19:58,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:58,305 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:58,305 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:58,309 INFO L82 PathProgramCache]: Analyzing trace with hash -144006031, now seen corresponding path program 1 times [2018-02-02 10:19:58,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:58,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:58,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:19:58,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,481 INFO L182 omatonBuilderFactory]: Interpolants [34#true, 35#false, 36#(= |#valid| |old(#valid)|)] [2018-02-02 10:19:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:19:58,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:19:58,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:19:58,492 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-02-02 10:19:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:58,620 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-02 10:19:58,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:19:58,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:19:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:58,630 INFO L225 Difference]: With dead ends: 46 [2018-02-02 10:19:58,630 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 10:19:58,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:19:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 10:19:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-02 10:19:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:19:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-02-02 10:19:58,660 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-02-02 10:19:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:58,660 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-02-02 10:19:58,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:19:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-02-02 10:19:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:19:58,662 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:58,662 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:58,662 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash -716261389, now seen corresponding path program 1 times [2018-02-02 10:19:58,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:58,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:58,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:19:58,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,730 INFO L182 omatonBuilderFactory]: Interpolants [121#true, 122#false, 123#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 124#(not (= 0 |ldv_malloc_#res.base|)), 125#(not (= 0 |entry_point_#t~ret2.base|)), 126#(not (= 0 entry_point_~array~0.base))] [2018-02-02 10:19:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:58,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:58,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:58,732 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2018-02-02 10:19:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:58,781 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-02-02 10:19:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:19:58,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:19:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:58,783 INFO L225 Difference]: With dead ends: 48 [2018-02-02 10:19:58,783 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 10:19:58,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 10:19:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-02-02 10:19:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:19:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-02-02 10:19:58,791 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-02-02 10:19:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:58,791 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-02-02 10:19:58,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-02-02 10:19:58,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:19:58,792 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:58,792 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-02 10:19:58,792 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:58,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1119113233, now seen corresponding path program 1 times [2018-02-02 10:19:58,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:58,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:19:58,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:19:58,856 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,856 INFO L182 omatonBuilderFactory]: Interpolants [215#true, 216#false, 217#(<= 10 entry_point_~len~0), 218#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-02 10:19:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:58,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:19:58,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:19:58,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:19:58,857 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-02-02 10:19:58,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:58,880 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2018-02-02 10:19:58,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:19:58,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-02 10:19:58,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:58,881 INFO L225 Difference]: With dead ends: 52 [2018-02-02 10:19:58,881 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 10:19:58,881 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-02 10:19:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 10:19:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-02-02 10:19:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 10:19:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-02-02 10:19:58,885 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-02-02 10:19:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:58,885 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-02-02 10:19:58,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:19:58,885 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-02-02 10:19:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:19:58,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:58,886 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] [2018-02-02 10:19:58,886 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:58,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1380395530, now seen corresponding path program 1 times [2018-02-02 10:19:58,887 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:58,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:58,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:58,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:19:58,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:58,953 INFO L182 omatonBuilderFactory]: Interpolants [311#true, 312#false, 313#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 314#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 315#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:19:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:58,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:19:58,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:19:58,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:58,954 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 5 states. [2018-02-02 10:19:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:58,967 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-02 10:19:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:19:58,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:19:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:58,968 INFO L225 Difference]: With dead ends: 34 [2018-02-02 10:19:58,968 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 10:19:58,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:19:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 10:19:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 10:19:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 10:19:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-02 10:19:58,972 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-02-02 10:19:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:58,972 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-02 10:19:58,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:19:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-02 10:19:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:19:58,973 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:58,973 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] [2018-02-02 10:19:58,973 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash 679154700, now seen corresponding path program 1 times [2018-02-02 10:19:58,974 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:58,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:59,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:59,039 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:59,039 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-02 10:19:59,039 INFO L182 omatonBuilderFactory]: Interpolants [384#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 385#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 386#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 387#(= 1 (select |#valid| entry_point_~array~0.base)), 388#(= |#valid| |old(#valid)|), 382#true, 383#false] [2018-02-02 10:19:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:59,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:59,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:59,040 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-02-02 10:19:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:59,140 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-02 10:19:59,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:59,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 10:19:59,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:59,141 INFO L225 Difference]: With dead ends: 35 [2018-02-02 10:19:59,141 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 10:19:59,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 10:19:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-02-02 10:19:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 10:19:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-02-02 10:19:59,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-02-02 10:19:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:59,145 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-02-02 10:19:59,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-02-02 10:19:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:19:59,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:59,146 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] [2018-02-02 10:19:59,146 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 679154701, now seen corresponding path program 1 times [2018-02-02 10:19:59,147 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:59,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:59,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:19:59,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,343 INFO L182 omatonBuilderFactory]: Interpolants [464#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 465#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 466#(and (= 0 |entry_point_#t~ret2.offset|) (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret2.base|))), 467#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~0 0)), 468#(and (= entry_point_~i~0 0) (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 469#(= |old(#length)| |#length|), 460#true, 461#false, 462#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 463#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)))] [2018-02-02 10:19:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:19:59,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:19:59,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:19:59,344 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 10 states. [2018-02-02 10:19:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:59,570 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-02-02 10:19:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:19:59,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-02 10:19:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:59,572 INFO L225 Difference]: With dead ends: 38 [2018-02-02 10:19:59,572 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:19:59,572 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:19:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-02 10:19:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:19:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-02-02 10:19:59,576 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2018-02-02 10:19:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:59,576 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-02-02 10:19:59,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:19:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-02-02 10:19:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:19:59,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:59,577 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:59,577 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043850, now seen corresponding path program 1 times [2018-02-02 10:19:59,579 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:59,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:59,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:19:59,699 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,700 INFO L182 omatonBuilderFactory]: Interpolants [560#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 561#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 562#(= 1 (select |#valid| entry_point_~array~0.base)), 563#(= |#valid| |old(#valid)|), 564#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 565#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 557#true, 558#false, 559#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:19:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:19:59,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:19:59,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:19:59,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:59,700 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 9 states. [2018-02-02 10:19:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:59,817 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-02 10:19:59,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:19:59,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-02-02 10:19:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:59,818 INFO L225 Difference]: With dead ends: 47 [2018-02-02 10:19:59,818 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 10:19:59,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:19:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 10:19:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-02-02 10:19:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 10:19:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-02 10:19:59,821 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-02 10:19:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:59,821 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-02 10:19:59,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:19:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-02 10:19:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:19:59,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:59,822 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:59,822 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:19:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043851, now seen corresponding path program 1 times [2018-02-02 10:19:59,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:59,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:00,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:00,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:20:00,083 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:00,083 INFO L182 omatonBuilderFactory]: Interpolants [656#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 657#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 658#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 659#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 660#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 661#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 662#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 663#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 664#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 653#true, 654#false, 655#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10))] [2018-02-02 10:20:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:00,084 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:20:00,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:20:00,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:00,084 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 12 states. [2018-02-02 10:20:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:00,453 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-02 10:20:00,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:20:00,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-02-02 10:20:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:00,454 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:20:00,455 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 10:20:00,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:20:00,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 10:20:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-02-02 10:20:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 10:20:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-02-02 10:20:00,458 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-02-02 10:20:00,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:00,459 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-02-02 10:20:00,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:20:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-02-02 10:20:00,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:20:00,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:00,460 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, 1, 1, 1, 1] [2018-02-02 10:20:00,460 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:00,460 INFO L82 PathProgramCache]: Analyzing trace with hash 622132427, now seen corresponding path program 1 times [2018-02-02 10:20:00,461 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:00,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:20:00,492 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:00,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:20:00,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:00,493 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-02 10:20:00,493 INFO L182 omatonBuilderFactory]: Interpolants [768#(<= 10 entry_point_~len~0), 769#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 770#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 766#true, 767#false] [2018-02-02 10:20:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:20:00,493 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:20:00,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:20:00,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:20:00,493 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-02-02 10:20:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:00,521 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-02 10:20:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:20:00,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-02-02 10:20:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:00,522 INFO L225 Difference]: With dead ends: 42 [2018-02-02 10:20:00,522 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 10:20:00,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:00,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 10:20:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-02 10:20:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:20:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-02-02 10:20:00,525 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-02-02 10:20:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:00,526 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-02-02 10:20:00,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:20:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-02-02 10:20:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:20:00,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:00,527 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:00,527 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1092971799, now seen corresponding path program 1 times [2018-02-02 10:20:00,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:00,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:20:00,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:00,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:20:00,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:20:00,686 INFO L182 omatonBuilderFactory]: Interpolants [852#true, 853#false, 854#(<= entry_point_~len~0 10), 855#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 856#(or (and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0))) (<= 4294967296 |ldv_malloc_#in~size|)), 857#(or (and (or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|))) (= 0 |ldv_malloc_#res.offset|)) (<= 4294967296 |ldv_malloc_#in~size|)), 858#(and (or (<= (+ (select |#length| |entry_point_#t~ret2.base|) 1) 0) (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret2.base|))) (= 0 |entry_point_#t~ret2.offset|)), 859#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base))) (= entry_point_~array~0.offset 0)), 860#(= |old(#length)| |#length|), 861#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 862#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 863#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))] [2018-02-02 10:20:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:20:00,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:20:00,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:20:00,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:00,686 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2018-02-02 10:20:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:00,926 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-02-02 10:20:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:20:00,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-02 10:20:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:00,927 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:20:00,927 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:20:00,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-02 10:20:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:20:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-02-02 10:20:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 10:20:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-02 10:20:00,932 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2018-02-02 10:20:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:00,932 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-02 10:20:00,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:20:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-02 10:20:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 10:20:00,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:00,933 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:00,933 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:00,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1217560473, now seen corresponding path program 2 times [2018-02-02 10:20:00,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:00,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:01,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:01,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 10:20:01,256 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:01,257 INFO L182 omatonBuilderFactory]: Interpolants [992#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 993#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 994#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 995#(= |old(#length)| |#length|), 980#true, 981#false, 982#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 983#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 984#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 2147483648 |ldv_malloc_#in~size|))), 985#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 986#(and (= 0 |entry_point_#t~ret2.offset|) (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 987#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 988#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 989#(and (= (store |old(#length)| |ldv_malloc_#t~malloc1.base| (select |#length| |ldv_malloc_#t~malloc1.base|)) |#length|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 990#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 991#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))] [2018-02-02 10:20:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:01,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 10:20:01,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 10:20:01,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:20:01,258 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 16 states. [2018-02-02 10:20:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:01,640 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-02 10:20:01,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:20:01,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-02-02 10:20:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:01,641 INFO L225 Difference]: With dead ends: 53 [2018-02-02 10:20:01,641 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 10:20:01,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:20:01,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 10:20:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-02-02 10:20:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 10:20:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-02-02 10:20:01,643 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37 [2018-02-02 10:20:01,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:01,644 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-02-02 10:20:01,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 10:20:01,644 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-02-02 10:20:01,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:20:01,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:01,644 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:01,644 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:01,644 INFO L82 PathProgramCache]: Analyzing trace with hash -13048153, now seen corresponding path program 2 times [2018-02-02 10:20:01,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:01,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:20:01,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:01,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:20:01,715 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 10:20:01,715 INFO L182 omatonBuilderFactory]: Interpolants [1111#true, 1112#false, 1113#(<= 10 entry_point_~len~0), 1114#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1115#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1116#(<= (+ entry_point_~i~0 8) entry_point_~len~0)] [2018-02-02 10:20:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:20:01,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:20:01,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:20:01,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:01,716 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-02-02 10:20:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:01,823 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-02-02 10:20:01,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:20:01,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-02-02 10:20:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:01,825 INFO L225 Difference]: With dead ends: 46 [2018-02-02 10:20:01,825 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 10:20:01,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 10:20:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-02 10:20:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:20:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-02-02 10:20:01,828 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 41 [2018-02-02 10:20:01,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:01,828 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-02-02 10:20:01,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:20:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-02-02 10:20:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:20:01,829 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:01,829 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:01,829 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash -455660157, now seen corresponding path program 3 times [2018-02-02 10:20:01,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:01,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:20:01,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:01,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:20:01,870 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:20:01,870 INFO L182 omatonBuilderFactory]: Interpolants [1209#true, 1210#false, 1211#(<= 10 entry_point_~len~0), 1212#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1213#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1214#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 1215#(<= (+ entry_point_~i~0 7) entry_point_~len~0)] [2018-02-02 10:20:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:20:01,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:01,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:01,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:01,871 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 7 states. [2018-02-02 10:20:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:01,943 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 10:20:01,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:20:01,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-02-02 10:20:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:01,944 INFO L225 Difference]: With dead ends: 52 [2018-02-02 10:20:01,944 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 10:20:01,944 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 10:20:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-02-02 10:20:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 10:20:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-02-02 10:20:01,947 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 51 [2018-02-02 10:20:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:01,948 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-02-02 10:20:01,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-02-02 10:20:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 10:20:01,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:01,949 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:01,949 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1516212575, now seen corresponding path program 4 times [2018-02-02 10:20:01,949 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:01,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-02 10:20:02,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:02,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:20:02,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 10:20:02,026 INFO L182 omatonBuilderFactory]: Interpolants [1328#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 1329#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 1322#true, 1323#false, 1324#(<= 10 entry_point_~len~0), 1325#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1326#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1327#(<= (+ entry_point_~i~0 8) entry_point_~len~0)] [2018-02-02 10:20:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-02 10:20:02,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:20:02,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:20:02,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:02,027 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 8 states. [2018-02-02 10:20:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:02,081 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-02-02 10:20:02,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:02,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-02 10:20:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:02,087 INFO L225 Difference]: With dead ends: 58 [2018-02-02 10:20:02,087 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 10:20:02,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 10:20:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-02-02 10:20:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 10:20:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-02-02 10:20:02,091 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 61 [2018-02-02 10:20:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:02,091 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-02-02 10:20:02,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:20:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-02-02 10:20:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:20:02,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:02,092 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:02,092 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash -342764997, now seen corresponding path program 5 times [2018-02-02 10:20:02,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:02,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 10:20:02,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:02,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:20:02,166 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-02-02 10:20:02,167 INFO L182 omatonBuilderFactory]: Interpolants [1456#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 1457#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 1458#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 1450#true, 1451#false, 1452#(<= 10 entry_point_~len~0), 1453#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1454#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1455#(<= (+ entry_point_~i~0 8) entry_point_~len~0)] [2018-02-02 10:20:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 10:20:02,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:20:02,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:20:02,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:20:02,167 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2018-02-02 10:20:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:02,251 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-02-02 10:20:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:20:02,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-02-02 10:20:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:02,252 INFO L225 Difference]: With dead ends: 64 [2018-02-02 10:20:02,252 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 10:20:02,252 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 10:20:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-02 10:20:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 10:20:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-02-02 10:20:02,256 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 71 [2018-02-02 10:20:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:02,256 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-02-02 10:20:02,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:20:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-02-02 10:20:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:20:02,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:02,257 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:02,257 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1199419415, now seen corresponding path program 6 times [2018-02-02 10:20:02,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:02,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-02 10:20:02,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:02,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:20:02,350 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 10:20:02,350 INFO L182 omatonBuilderFactory]: Interpolants [1600#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 1601#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 1602#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 1593#true, 1594#false, 1595#(<= 10 entry_point_~len~0), 1596#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1597#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1598#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 1599#(<= (+ entry_point_~i~0 7) entry_point_~len~0)] [2018-02-02 10:20:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-02-02 10:20:02,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:20:02,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:20:02,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:02,351 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 10 states. [2018-02-02 10:20:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:02,422 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-02-02 10:20:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:02,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2018-02-02 10:20:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:02,422 INFO L225 Difference]: With dead ends: 70 [2018-02-02 10:20:02,423 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 10:20:02,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:20:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 10:20:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-02-02 10:20:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 10:20:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-02-02 10:20:02,426 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 81 [2018-02-02 10:20:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:02,426 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-02-02 10:20:02,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:20:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-02-02 10:20:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 10:20:02,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:02,427 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:02,427 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1552083699, now seen corresponding path program 7 times [2018-02-02 10:20:02,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:02,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-02 10:20:02,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:02,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:20:02,528 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-02-02 10:20:02,528 INFO L182 omatonBuilderFactory]: Interpolants [1760#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 1761#(<= (+ entry_point_~i~0 3) entry_point_~len~0), 1751#true, 1752#false, 1753#(<= 10 entry_point_~len~0), 1754#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1755#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1756#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 1757#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 1758#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 1759#(<= (+ entry_point_~i~0 5) entry_point_~len~0)] [2018-02-02 10:20:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-02 10:20:02,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:20:02,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:20:02,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:02,529 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 11 states. [2018-02-02 10:20:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:02,623 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-02-02 10:20:02,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:20:02,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-02-02 10:20:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:02,624 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:20:02,624 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:20:02,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:20:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-02-02 10:20:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:20:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2018-02-02 10:20:02,627 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 91 [2018-02-02 10:20:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:02,628 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2018-02-02 10:20:02,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:20:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2018-02-02 10:20:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 10:20:02,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:02,629 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:02,629 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:02,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1951482575, now seen corresponding path program 8 times [2018-02-02 10:20:02,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:02,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-02-02 10:20:02,735 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:02,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:20:02,735 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-02-02 10:20:02,736 INFO L182 omatonBuilderFactory]: Interpolants [1924#true, 1925#false, 1926#(<= 10 entry_point_~len~0), 1927#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1928#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 1929#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 1930#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 1931#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 1932#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 1933#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 1934#(<= (+ entry_point_~i~0 3) entry_point_~len~0), 1935#(<= (+ entry_point_~i~0 2) entry_point_~len~0)] [2018-02-02 10:20:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-02-02 10:20:02,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:20:02,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:20:02,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:02,737 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 12 states. [2018-02-02 10:20:02,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:02,834 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-02-02 10:20:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:20:02,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-02-02 10:20:02,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:02,836 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:20:02,836 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:20:02,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:20:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:20:02,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-02 10:20:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:20:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2018-02-02 10:20:02,840 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 101 [2018-02-02 10:20:02,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:02,840 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2018-02-02 10:20:02,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:20:02,840 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2018-02-02 10:20:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 10:20:02,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:02,841 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:02,841 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1340635051, now seen corresponding path program 9 times [2018-02-02 10:20:02,842 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:02,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-02 10:20:02,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:02,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:02,981 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-02-02 10:20:02,982 INFO L182 omatonBuilderFactory]: Interpolants [2112#true, 2113#false, 2114#(<= 10 entry_point_~len~0), 2115#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 2116#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 2117#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 2118#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 2119#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 2120#(<= (+ entry_point_~i~0 5) entry_point_~len~0), 2121#(<= (+ entry_point_~i~0 4) entry_point_~len~0), 2122#(<= (+ entry_point_~i~0 3) entry_point_~len~0), 2123#(<= (+ entry_point_~i~0 2) entry_point_~len~0), 2124#(<= (+ entry_point_~i~0 1) entry_point_~len~0)] [2018-02-02 10:20:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-02 10:20:02,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:20:02,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:20:02,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:20:02,983 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand 13 states. [2018-02-02 10:20:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:03,167 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-02-02 10:20:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:20:03,167 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 111 [2018-02-02 10:20:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:03,168 INFO L225 Difference]: With dead ends: 84 [2018-02-02 10:20:03,168 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 10:20:03,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:20:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 10:20:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 10:20:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 10:20:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-02-02 10:20:03,171 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 111 [2018-02-02 10:20:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:03,172 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-02-02 10:20:03,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:20:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-02-02 10:20:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-02-02 10:20:03,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:03,174 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:03,174 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-02-02 10:20:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1134053767, now seen corresponding path program 10 times [2018-02-02 10:20:03,175 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:20:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:20:03,237 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 10:20:03,272 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 10:20:03,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:20:03 BoogieIcfgContainer [2018-02-02 10:20:03,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:20:03,298 INFO L168 Benchmark]: Toolchain (without parser) took 5393.24 ms. Allocated memory was 403.2 MB in the beginning and 724.0 MB in the end (delta: 320.9 MB). Free memory was 359.9 MB in the beginning and 658.3 MB in the end (delta: -298.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:03,299 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.2 MB. Free memory is still 365.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:20:03,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.37 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 346.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:03,299 INFO L168 Benchmark]: Boogie Preprocessor took 25.76 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:03,299 INFO L168 Benchmark]: RCFGBuilder took 140.58 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 329.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:20:03,300 INFO L168 Benchmark]: TraceAbstraction took 5065.00 ms. Allocated memory was 403.2 MB in the beginning and 724.0 MB in the end (delta: 320.9 MB). Free memory was 329.5 MB in the beginning and 658.3 MB in the end (delta: -328.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:20:03,301 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.14 ms. Allocated memory is still 403.2 MB. Free memory is still 365.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.37 ms. Allocated memory is still 403.2 MB. Free memory was 359.9 MB in the beginning and 346.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.76 ms. Allocated memory is still 403.2 MB. Free memory was 346.7 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 140.58 ms. Allocated memory is still 403.2 MB. Free memory was 344.0 MB in the beginning and 329.5 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5065.00 ms. Allocated memory was 403.2 MB in the beginning and 724.0 MB in the end (delta: 320.9 MB). Free memory was 329.5 MB in the beginning and 658.3 MB in the end (delta: -328.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1453] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={42:0}, i=0, len=10] [L1443] COND FALSE !(!array) VAL [array={42:0}, i=0, len=10] [L1444] COND TRUE i