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_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:17:11,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:17:11,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:17:11,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:17:11,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:17:11,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:17:11,774 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:17:11,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:17:11,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:17:11,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:17:11,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:17:11,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:17:11,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:17:11,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:17:11,781 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:17:11,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:17:11,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:17:11,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:17:11,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:17:11,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:17:11,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:17:11,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:17:11,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:17:11,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:17:11,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:17:11,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:17:11,792 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:17:11,793 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:17:11,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:17:11,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:17:11,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:17:11,794 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:17:11,804 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:17:11,804 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:17:11,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:17:11,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:17:11,806 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:17:11,806 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:17:11,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:17:11,806 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:17:11,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:17:11,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:17:11,807 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:17:11,807 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:17:11,807 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:17:11,807 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:17:11,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:17:11,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:17:11,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:17:11,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:17:11,808 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:17:11,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:17:11,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:17:11,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:17:11,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:17:11,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:17:11,850 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:17:11,854 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:17:11,857 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:17:11,857 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:17:11,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-02-02 10:17:12,020 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:17:12,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:17:12,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:17:12,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:17:12,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:17:12,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4288a04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12, skipping insertion in model container [2018-02-02 10:17:12,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,045 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:17:12,082 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:17:12,166 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:17:12,180 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:17:12,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12 WrapperNode [2018-02-02 10:17:12,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:17:12,187 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:17:12,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:17:12,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:17:12,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (1/1) ... [2018-02-02 10:17:12,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:17:12,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:17:12,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:17:12,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:17:12,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (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:17:12,250 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:17:12,250 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:17:12,250 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:17:12,250 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-02-02 10:17:12,250 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 10:17:12,251 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:17:12,251 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-02-02 10:17:12,251 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 10:17:12,252 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:17:12,252 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:17:12,252 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:17:12,252 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:17:12,427 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:17:12,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:17:12 BoogieIcfgContainer [2018-02-02 10:17:12,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:17:12,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:17:12,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:17:12,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:17:12,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:17:12" (1/3) ... [2018-02-02 10:17:12,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b15b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:17:12, skipping insertion in model container [2018-02-02 10:17:12,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:17:12" (2/3) ... [2018-02-02 10:17:12,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b15b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:17:12, skipping insertion in model container [2018-02-02 10:17:12,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:17:12" (3/3) ... [2018-02-02 10:17:12,432 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-02-02 10:17:12,438 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:17:12,443 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 10:17:12,475 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:17:12,476 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:17:12,476 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:17:12,476 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:17:12,476 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:17:12,476 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:17:12,476 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:17:12,476 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:17:12,477 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:17:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-02-02 10:17:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:17:12,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:12,499 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:17:12,499 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-02-02 10:17:12,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:12,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:12,678 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:17:12,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:12,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:17:12,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:12,682 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:17:12,682 INFO L182 omatonBuilderFactory]: Interpolants [75#true, 76#false, 77#(= |#valid| |old(#valid)|)] [2018-02-02 10:17:12,682 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:17:12,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:17:12,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:17:12,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:17:12,697 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-02-02 10:17:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:12,885 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-02 10:17:12,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:17:12,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:17:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:12,897 INFO L225 Difference]: With dead ends: 122 [2018-02-02 10:17:12,897 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:17:12,899 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:17:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:17:12,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-02-02 10:17:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:17:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-02 10:17:12,937 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-02-02 10:17:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:12,938 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-02 10:17:12,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:17:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-02 10:17:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:17:12,939 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:12,939 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:17:12,940 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-02-02 10:17:12,941 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:12,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:13,017 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:17:13,018 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:13,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:17:13,018 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:13,018 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:17:13,018 INFO L182 omatonBuilderFactory]: Interpolants [273#true, 274#false, 275#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 276#(and (= 0 |entry_point_#t~ret9.base|) (= 0 |entry_point_#t~ret9.offset|)), 277#(and (= 0 entry_point_~array~0.offset) (= 0 entry_point_~array~0.base))] [2018-02-02 10:17:13,019 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:17:13,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:17:13,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:17:13,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:17:13,021 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-02-02 10:17:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:13,056 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-02 10:17:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:17:13,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:17:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:13,058 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:17:13,058 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:17:13,059 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:17:13,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:17:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-02-02 10:17:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 10:17:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-02 10:17:13,066 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-02-02 10:17:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:13,067 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-02 10:17:13,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:17:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-02 10:17:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:17:13,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:13,068 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:17:13,068 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-02-02 10:17:13,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:13,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:13,134 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:17:13,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:13,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:17:13,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:13,136 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:17:13,136 INFO L182 omatonBuilderFactory]: Interpolants [424#true, 425#false, 426#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 427#(not (= 0 |ldv_malloc_#res.base|)), 428#(not (= 0 |entry_point_#t~ret9.base|)), 429#(not (= 0 entry_point_~array~0.base))] [2018-02-02 10:17:13,136 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:17:13,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:17:13,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:17:13,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:13,137 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-02-02 10:17:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:13,178 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 10:17:13,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:17:13,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:17:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:13,180 INFO L225 Difference]: With dead ends: 71 [2018-02-02 10:17:13,180 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 10:17:13,180 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:17:13,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 10:17:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 10:17:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 10:17:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 10:17:13,185 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 10:17:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:13,185 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 10:17:13,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:17:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 10:17:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:17:13,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:13,186 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:17:13,186 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:13,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-02-02 10:17:13,188 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:13,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:13,236 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:17:13,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:13,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:17:13,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:13,237 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:17:13,237 INFO L182 omatonBuilderFactory]: Interpolants [576#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 577#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 578#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 579#(= 1 (select |#valid| entry_point_~array~0.base)), 574#true, 575#false] [2018-02-02 10:17:13,237 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:17:13,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:17:13,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:17:13,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:13,238 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-02-02 10:17:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:13,315 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-02-02 10:17:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:17:13,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:17:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:13,316 INFO L225 Difference]: With dead ends: 70 [2018-02-02 10:17:13,316 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 10:17:13,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:17:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 10:17:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 10:17:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:17:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 10:17:13,322 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-02-02 10:17:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:13,322 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 10:17:13,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:17:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 10:17:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:17:13,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:13,323 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:17:13,323 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-02-02 10:17:13,324 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:13,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:13,516 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:17:13,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:13,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:17:13,517 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:13,517 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:17:13,518 INFO L182 omatonBuilderFactory]: Interpolants [722#true, 723#false, 724#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 725#(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))), 726#(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|)), 727#(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|))), 728#(and (<= 40 (select |#length| |entry_point_#t~ret9.base|)) (= 0 |entry_point_#t~ret9.offset|)), 729#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 730#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))] [2018-02-02 10:17:13,518 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:17:13,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:17:13,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:17:13,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:17:13,519 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-02-02 10:17:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:13,734 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-02 10:17:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:17:13,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 10:17:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:13,735 INFO L225 Difference]: With dead ends: 74 [2018-02-02 10:17:13,735 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 10:17:13,735 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:17:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 10:17:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-02-02 10:17:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 10:17:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-02-02 10:17:13,739 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-02-02 10:17:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:13,739 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-02-02 10:17:13,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:17:13,739 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-02-02 10:17:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:17:13,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:13,740 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] [2018-02-02 10:17:13,740 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-02-02 10:17:13,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:13,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:13,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:13,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:17:13,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:13,921 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:17:13,921 INFO L182 omatonBuilderFactory]: Interpolants [896#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 897#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 898#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 888#true, 889#false, 890#(<= entry_point_~len~0 10), 891#(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))), 892#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 893#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 894#(or (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret9.base|)) (= 0 |entry_point_#t~ret9.offset|)) (<= (+ (select |#length| |entry_point_#t~ret9.base|) 1) 0)), 895#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)))] [2018-02-02 10:17:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:13,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:17:13,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:17:13,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:17:13,922 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 11 states. [2018-02-02 10:17:14,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:14,142 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-02 10:17:14,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:17:14,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:17:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:14,143 INFO L225 Difference]: With dead ends: 73 [2018-02-02 10:17:14,144 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 10:17:14,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:17:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 10:17:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-02-02 10:17:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 10:17:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 10:17:14,148 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 23 [2018-02-02 10:17:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:14,148 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 10:17:14,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:17:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 10:17:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:17:14,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:14,149 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:14,149 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash -700547866, now seen corresponding path program 1 times [2018-02-02 10:17:14,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:14,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:14,215 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:17:14,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:14,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:17:14,215 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:14,215 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:17:14,215 INFO L182 omatonBuilderFactory]: Interpolants [1057#true, 1058#false, 1059#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1060#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1061#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 1062#(= 1 (select |#valid| entry_point_~array~0.base)), 1063#(= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)), 1064#(= 1 (select |#valid| alloc_unsafe_17_~array.base))] [2018-02-02 10:17:14,215 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:17:14,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:17:14,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:17:14,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:17:14,216 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 8 states. [2018-02-02 10:17:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:14,304 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-02-02 10:17:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:17:14,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-02 10:17:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:14,305 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:17:14,305 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:17:14,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:17:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:17:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2018-02-02 10:17:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:17:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-02 10:17:14,310 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 30 [2018-02-02 10:17:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:14,310 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-02 10:17:14,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:17:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-02 10:17:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:17:14,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:14,311 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:14,311 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:14,311 INFO L82 PathProgramCache]: Analyzing trace with hash -700547865, now seen corresponding path program 1 times [2018-02-02 10:17:14,312 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:14,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:14,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:17:14,351 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:14,351 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:17:14,352 INFO L182 omatonBuilderFactory]: Interpolants [1239#true, 1240#false, 1241#(<= 10 entry_point_~len~0), 1242#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1243#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 10:17:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:17:14,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:17:14,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:17:14,352 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 5 states. [2018-02-02 10:17:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:14,380 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-02 10:17:14,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:17:14,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-02 10:17:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:14,382 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:17:14,383 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:17:14,383 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:17:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:17:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-02 10:17:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 10:17:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-02 10:17:14,386 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2018-02-02 10:17:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:14,387 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-02 10:17:14,387 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:17:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-02 10:17:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:17:14,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:14,387 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:14,387 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash -382229072, now seen corresponding path program 2 times [2018-02-02 10:17:14,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:14,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:14,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:17:14,430 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:14,430 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:17:14,430 INFO L182 omatonBuilderFactory]: Interpolants [1408#(<= 10 entry_point_~len~0), 1409#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1410#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1411#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1406#true, 1407#false] [2018-02-02 10:17:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:17:14,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:17:14,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:14,430 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 6 states. [2018-02-02 10:17:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:14,468 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-02 10:17:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:17:14,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 10:17:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:14,469 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:17:14,469 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:17:14,470 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:17:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:17:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-02-02 10:17:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:17:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-02-02 10:17:14,473 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 34 [2018-02-02 10:17:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:14,474 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-02-02 10:17:14,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:17:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-02-02 10:17:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:17:14,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:14,475 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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:17:14,475 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 3 times [2018-02-02 10:17:14,476 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:14,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:14,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:17:14,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:14,523 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:17:14,524 INFO L182 omatonBuilderFactory]: Interpolants [1584#true, 1585#false, 1586#(<= 10 entry_point_~len~0), 1587#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1588#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1589#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1590#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-02 10:17:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:17:14,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:17:14,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:17:14,524 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 7 states. [2018-02-02 10:17:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:14,559 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-02-02 10:17:14,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:17:14,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 10:17:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:14,560 INFO L225 Difference]: With dead ends: 89 [2018-02-02 10:17:14,560 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 10:17:14,560 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:17:14,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 10:17:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-02-02 10:17:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:17:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-02 10:17:14,563 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 38 [2018-02-02 10:17:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:14,563 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-02 10:17:14,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:17:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-02 10:17:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 10:17:14,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:14,564 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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:17:14,565 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:14,565 INFO L82 PathProgramCache]: Analyzing trace with hash 997822914, now seen corresponding path program 4 times [2018-02-02 10:17:14,566 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:14,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:14,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:17:14,624 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:14,625 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:17:14,625 INFO L182 omatonBuilderFactory]: Interpolants [1776#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1777#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1778#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1779#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 1780#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 1773#true, 1774#false, 1775#(<= 10 entry_point_~len~0)] [2018-02-02 10:17:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:17:14,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:17:14,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:17:14,626 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 8 states. [2018-02-02 10:17:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:14,698 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-02 10:17:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:17:14,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-02 10:17:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:14,700 INFO L225 Difference]: With dead ends: 93 [2018-02-02 10:17:14,700 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:17:14,700 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:17:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:17:14,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-02-02 10:17:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 10:17:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-02-02 10:17:14,703 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 42 [2018-02-02 10:17:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:14,704 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-02-02 10:17:14,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:17:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-02-02 10:17:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:17:14,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:14,705 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 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:17:14,706 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:14,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1591137547, now seen corresponding path program 5 times [2018-02-02 10:17:14,707 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:14,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:14,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:17:14,784 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:14,784 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:17:14,784 INFO L182 omatonBuilderFactory]: Interpolants [1973#true, 1974#false, 1975#(<= 10 entry_point_~len~0), 1976#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1977#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1978#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1979#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 1980#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 1981#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-02 10:17:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:17:14,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:17:14,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:17:14,785 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 9 states. [2018-02-02 10:17:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:14,856 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-02-02 10:17:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:17:14,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-02-02 10:17:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:14,858 INFO L225 Difference]: With dead ends: 97 [2018-02-02 10:17:14,858 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 10:17:14,858 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:17:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 10:17:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-02-02 10:17:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:17:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-02 10:17:14,861 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 46 [2018-02-02 10:17:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:14,861 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-02 10:17:14,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:17:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-02 10:17:14,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 10:17:14,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:14,862 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 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:17:14,862 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:14,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1071598548, now seen corresponding path program 6 times [2018-02-02 10:17:14,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:14,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:14,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:17:14,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:14,933 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:17:14,933 INFO L182 omatonBuilderFactory]: Interpolants [2192#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2193#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2184#true, 2185#false, 2186#(<= 10 entry_point_~len~0), 2187#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2188#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2189#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2190#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2191#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 10:17:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:14,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:17:14,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:17:14,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:17:14,934 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 10 states. [2018-02-02 10:17:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:15,009 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-02-02 10:17:15,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:17:15,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-02-02 10:17:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:15,010 INFO L225 Difference]: With dead ends: 101 [2018-02-02 10:17:15,010 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 10:17:15,011 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:17:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 10:17:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-02-02 10:17:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:17:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-02-02 10:17:15,014 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 50 [2018-02-02 10:17:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:15,014 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-02-02 10:17:15,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:17:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-02-02 10:17:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 10:17:15,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:15,016 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 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:17:15,016 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash -422758883, now seen corresponding path program 7 times [2018-02-02 10:17:15,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:15,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:15,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:17:15,106 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:15,106 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:17:15,106 INFO L182 omatonBuilderFactory]: Interpolants [2416#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 2406#true, 2407#false, 2408#(<= 10 entry_point_~len~0), 2409#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2410#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2411#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2412#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2413#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2414#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2415#(<= (+ entry_point_~i~2 4) entry_point_~len~0)] [2018-02-02 10:17:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:17:15,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:17:15,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:17:15,107 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 11 states. [2018-02-02 10:17:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:15,167 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2018-02-02 10:17:15,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:17:15,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 10:17:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:15,168 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:17:15,168 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 10:17:15,168 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:17:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 10:17:15,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-02-02 10:17:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 10:17:15,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-02-02 10:17:15,171 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 54 [2018-02-02 10:17:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:15,171 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-02-02 10:17:15,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:17:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-02-02 10:17:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:17:15,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:15,172 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 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:17:15,172 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash 884659174, now seen corresponding path program 8 times [2018-02-02 10:17:15,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:15,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,238 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:15,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:17:15,238 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:15,239 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:17:15,239 INFO L182 omatonBuilderFactory]: Interpolants [2640#false, 2641#(<= 10 entry_point_~len~0), 2642#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2643#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2644#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2645#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2646#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2647#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2648#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2649#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 2650#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 2639#true] [2018-02-02 10:17:15,239 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:17:15,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:17:15,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:17:15,239 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 12 states. [2018-02-02 10:17:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:15,358 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2018-02-02 10:17:15,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:17:15,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-02-02 10:17:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:15,359 INFO L225 Difference]: With dead ends: 109 [2018-02-02 10:17:15,359 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 10:17:15,359 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:17:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 10:17:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-02-02 10:17:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 10:17:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2018-02-02 10:17:15,362 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 58 [2018-02-02 10:17:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:15,363 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2018-02-02 10:17:15,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:17:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2018-02-02 10:17:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 10:17:15,364 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:15,364 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 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:17:15,364 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1940022575, now seen corresponding path program 9 times [2018-02-02 10:17:15,366 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:15,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:15,507 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:15,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:17:15,507 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,508 INFO L182 omatonBuilderFactory]: Interpolants [2883#true, 2884#false, 2885#(<= 10 entry_point_~len~0), 2886#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2887#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2888#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2889#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2890#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2891#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2892#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2893#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 2894#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 2895#(<= (+ entry_point_~i~2 1) entry_point_~len~0)] [2018-02-02 10:17:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:17:15,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:17:15,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:17:15,509 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 13 states. [2018-02-02 10:17:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:15,638 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-02-02 10:17:15,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:17:15,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-02-02 10:17:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:15,639 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:17:15,639 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:17:15,640 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:17:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:17:15,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-02-02 10:17:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 10:17:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2018-02-02 10:17:15,643 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 62 [2018-02-02 10:17:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:15,643 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2018-02-02 10:17:15,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:17:15,643 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2018-02-02 10:17:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:17:15,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:15,644 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:17:15,644 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash -430036488, now seen corresponding path program 10 times [2018-02-02 10:17:15,646 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:15,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:15,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:15,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:17:15,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:15,685 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:17:15,685 INFO L182 omatonBuilderFactory]: Interpolants [3136#true, 3137#false, 3138#(= alloc_unsafe_17_~i~0 0), 3139#(<= (+ alloc_unsafe_17_~j~0 1) 0)] [2018-02-02 10:17:15,686 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:15,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:17:15,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:17:15,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:17:15,686 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 4 states. [2018-02-02 10:17:15,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:15,710 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-02-02 10:17:15,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:17:15,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-02-02 10:17:15,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:15,712 INFO L225 Difference]: With dead ends: 129 [2018-02-02 10:17:15,712 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 10:17:15,712 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:17:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 10:17:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2018-02-02 10:17:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:17:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-02-02 10:17:15,716 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 66 [2018-02-02 10:17:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:15,716 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-02-02 10:17:15,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:17:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-02-02 10:17:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 10:17:15,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:15,717 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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:17:15,717 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:15,717 INFO L82 PathProgramCache]: Analyzing trace with hash 53766629, now seen corresponding path program 1 times [2018-02-02 10:17:15,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:15,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:17:15,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:15,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:17:15,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:15,768 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:17:15,768 INFO L182 omatonBuilderFactory]: Interpolants [3392#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 3393#(and (= 0 |alloc_unsafe_17_#t~ret3.offset|) (= 0 |alloc_unsafe_17_#t~ret3.base|)), 3394#(and (= alloc_unsafe_17_~p~0.offset 0) (= 0 alloc_unsafe_17_~p~0.base)), 3390#true, 3391#false] [2018-02-02 10:17:15,768 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:17:15,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:17:15,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:17:15,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:17:15,769 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 5 states. [2018-02-02 10:17:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:15,779 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-02-02 10:17:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:17:15,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-02 10:17:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:15,780 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:17:15,780 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:17:15,780 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:17:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:17:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 123. [2018-02-02 10:17:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 10:17:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-02-02 10:17:15,783 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 70 [2018-02-02 10:17:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:15,783 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-02-02 10:17:15,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:17:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-02-02 10:17:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:17:15,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:15,784 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:15,784 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash -987158553, now seen corresponding path program 1 times [2018-02-02 10:17:15,784 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:15,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:15,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:15,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:17:15,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:15,941 INFO L182 omatonBuilderFactory]: Interpolants [3664#(= 1 (select |#valid| alloc_unsafe_17_~array.base)), 3665#(= |#valid| |old(#valid)|), 3666#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 3667#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 3657#true, 3658#false, 3659#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 3660#(= (select |#valid| |ldv_malloc_#res.base|) 1), 3661#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 3662#(= (select |#valid| entry_point_~array~0.base) 1), 3663#(= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|))] [2018-02-02 10:17:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:15,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:17:15,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:17:15,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:17:15,942 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 11 states. [2018-02-02 10:17:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:16,172 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2018-02-02 10:17:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:17:16,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-02 10:17:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:16,173 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:17:16,173 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 10:17:16,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:17:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 10:17:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131. [2018-02-02 10:17:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-02 10:17:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-02-02 10:17:16,177 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 72 [2018-02-02 10:17:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:16,177 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-02-02 10:17:16,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:17:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-02-02 10:17:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:17:16,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:16,178 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:16,178 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:16,178 INFO L82 PathProgramCache]: Analyzing trace with hash -987158552, now seen corresponding path program 1 times [2018-02-02 10:17:16,179 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:16,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:17:16,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:16,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:17:16,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:16,437 INFO L182 omatonBuilderFactory]: Interpolants [4000#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4001#(and (= entry_point_~array~0.offset 0) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 44) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= (select |#valid| entry_point_~array~0.base) 1)), 4002#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 40) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4003#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 36) (+ (select |#length| entry_point_~array~0.base) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4004#(and (<= (+ entry_point_~array~0.offset 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4005#(and (= (select |#valid| |alloc_unsafe_17_#in~array.base|) 1) (= 0 |alloc_unsafe_17_#in~array.offset|) (<= 36 (select |#length| |alloc_unsafe_17_#in~array.base|))), 4006#(and (<= 36 (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~i~0 0) (= (select |#valid| alloc_unsafe_17_~array.base) 1) (= alloc_unsafe_17_~array.offset 0)), 4007#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 4008#(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|))), 4009#(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|))))), 4010#(and (<= 36 (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~i~0 0) (= alloc_unsafe_17_~array.offset 0)), 3994#true, 3995#false, 3996#(<= 10 entry_point_~len~0), 3997#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3998#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 3999#(and (<= 10 entry_point_~len~0) (= (select |#valid| |entry_point_#t~ret9.base|) 1) (= 0 |entry_point_#t~ret9.offset|))] [2018-02-02 10:17:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:17:16,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:17:16,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:17:16,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:17:16,438 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 17 states. [2018-02-02 10:17:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:17,019 INFO L93 Difference]: Finished difference Result 183 states and 206 transitions. [2018-02-02 10:17:17,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:17:17,019 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 10:17:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:17,020 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:17:17,020 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:17:17,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:17:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:17:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 141. [2018-02-02 10:17:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 10:17:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 159 transitions. [2018-02-02 10:17:17,023 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 159 transitions. Word has length 72 [2018-02-02 10:17:17,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:17,023 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 159 transitions. [2018-02-02 10:17:17,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:17:17,023 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-02-02 10:17:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:17:17,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:17,023 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:17,024 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:17,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2037934795, now seen corresponding path program 1 times [2018-02-02 10:17:17,024 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:17,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:17,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:17,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:17:17,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:17,088 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:17:17,088 INFO L182 omatonBuilderFactory]: Interpolants [4368#(= 1 (select |#valid| |free_17_#in~array.base|)), 4369#(= 1 (select |#valid| free_17_~array.base)), 4361#true, 4362#false, 4363#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4364#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4365#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 4366#(= 1 (select |#valid| entry_point_~array~0.base)), 4367#(= |#valid| |old(#valid)|)] [2018-02-02 10:17:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:17,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:17:17,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:17:17,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:17:17,088 INFO L87 Difference]: Start difference. First operand 141 states and 159 transitions. Second operand 9 states. [2018-02-02 10:17:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:17,194 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2018-02-02 10:17:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:17:17,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-02-02 10:17:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:17,195 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:17:17,195 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:17:17,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:17:17,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:17:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2018-02-02 10:17:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:17:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2018-02-02 10:17:17,199 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 74 [2018-02-02 10:17:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:17,200 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2018-02-02 10:17:17,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:17:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2018-02-02 10:17:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 10:17:17,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:17,201 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:17,201 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:17,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2037934796, now seen corresponding path program 1 times [2018-02-02 10:17:17,202 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:17,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:17,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:17,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:17:17,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:17,289 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:17:17,289 INFO L182 omatonBuilderFactory]: Interpolants [4688#(<= |alloc_unsafe_17_#in~len| 0), 4682#true, 4683#false, 4684#(<= 10 entry_point_~len~0), 4685#(<= |alloc_unsafe_17_#in~len| alloc_unsafe_17_~len), 4686#(<= |alloc_unsafe_17_#in~len| alloc_unsafe_17_~i~0), 4687#(<= |alloc_unsafe_17_#in~len| (+ alloc_unsafe_17_~j~0 1))] [2018-02-02 10:17:17,290 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:17:17,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:17:17,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:17:17,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:17:17,290 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand 7 states. [2018-02-02 10:17:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:17,336 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2018-02-02 10:17:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:17:17,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-02-02 10:17:17,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:17,337 INFO L225 Difference]: With dead ends: 179 [2018-02-02 10:17:17,337 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:17:17,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:17:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:17:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2018-02-02 10:17:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:17:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2018-02-02 10:17:17,341 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 74 [2018-02-02 10:17:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:17,342 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2018-02-02 10:17:17,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:17:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2018-02-02 10:17:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 10:17:17,342 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:17,342 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:17,342 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1862067708, now seen corresponding path program 1 times [2018-02-02 10:17:17,343 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:17,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:17,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:17,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:17:17,482 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:17:17,482 INFO L182 omatonBuilderFactory]: Interpolants [5024#true, 5025#false, 5026#(= 0 |ldv_malloc_#t~malloc1.offset|), 5027#(= 0 |ldv_malloc_#res.offset|), 5028#(= 0 |entry_point_#t~ret9.offset|), 5029#(= 0 entry_point_~array~0.offset), 5030#(= 0 |alloc_unsafe_17_#in~array.offset|), 5031#(= alloc_unsafe_17_~array.offset 0), 5032#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 5033#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0)) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 5034#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 5035#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (<= 0 alloc_unsafe_17_~j~0) (= alloc_unsafe_17_~array.offset 0))] [2018-02-02 10:17:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:17,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:17:17,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:17:17,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:17:17,483 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 12 states. [2018-02-02 10:17:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:17,611 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2018-02-02 10:17:17,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:17:17,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-02-02 10:17:17,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:17,612 INFO L225 Difference]: With dead ends: 162 [2018-02-02 10:17:17,612 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:17:17,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:17:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:17:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2018-02-02 10:17:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 10:17:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2018-02-02 10:17:17,615 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 79 [2018-02-02 10:17:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:17,615 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2018-02-02 10:17:17,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:17:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2018-02-02 10:17:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 10:17:17,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:17,616 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:17,616 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1889524080, now seen corresponding path program 1 times [2018-02-02 10:17:17,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:17,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:17:17,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:17,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:17:17,661 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:17:17,661 INFO L182 omatonBuilderFactory]: Interpolants [5363#true, 5364#false, 5365#(<= 10 entry_point_~len~0), 5366#(<= 10 |alloc_unsafe_17_#in~len|), 5367#(and (= alloc_unsafe_17_~i~0 0) (<= 10 alloc_unsafe_17_~len)), 5368#(<= (+ alloc_unsafe_17_~i~0 9) alloc_unsafe_17_~len)] [2018-02-02 10:17:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:17:17,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:17:17,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:17:17,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:17,662 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand 6 states. [2018-02-02 10:17:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:17,694 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2018-02-02 10:17:17,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:17:17,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-02-02 10:17:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:17,694 INFO L225 Difference]: With dead ends: 183 [2018-02-02 10:17:17,694 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:17:17,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:17:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:17:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 152. [2018-02-02 10:17:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:17:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-02-02 10:17:17,697 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 80 [2018-02-02 10:17:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:17,697 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-02-02 10:17:17,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:17:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-02-02 10:17:17,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:17:17,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:17,698 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:17,698 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash 449519657, now seen corresponding path program 1 times [2018-02-02 10:17:17,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:17,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:17:17,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:17,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:17:17,845 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:17,845 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:17:17,845 INFO L182 omatonBuilderFactory]: Interpolants [5708#true, 5709#false, 5710#(= 0 |ldv_malloc_#t~malloc1.offset|), 5711#(= 0 |ldv_malloc_#res.offset|), 5712#(= 0 |entry_point_#t~ret9.offset|), 5713#(= entry_point_~array~0.offset 0), 5714#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5715#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5716#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5717#(= |old(#length)| |#length|), 5718#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 5719#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 5720#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 10:17:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:17:17,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:17:17,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:17:17,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:17:17,846 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 13 states. [2018-02-02 10:17:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:18,097 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2018-02-02 10:17:18,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:17:18,098 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-02 10:17:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:18,099 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:17:18,099 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:17:18,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:17:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:17:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2018-02-02 10:17:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 10:17:18,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-02-02 10:17:18,103 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 81 [2018-02-02 10:17:18,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:18,103 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-02-02 10:17:18,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:17:18,103 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-02-02 10:17:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:17:18,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:18,104 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:18,104 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:18,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207497, now seen corresponding path program 1 times [2018-02-02 10:17:18,105 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:18,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:17:19,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:19,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:17:19,110 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:19,110 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:17:19,110 INFO L182 omatonBuilderFactory]: Interpolants [6080#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 6081#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15)))), 6082#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 6083#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 6084#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)))), 6085#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 6086#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 6087#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 6088#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 6089#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)))) (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0)), 6090#(= 0 |free_17_#t~mem8.base|), 6067#true, 6068#false, 6069#(<= entry_point_~len~0 10), 6070#(= 0 |ldv_malloc_#t~malloc1.offset|), 6071#(= 0 |ldv_malloc_#res.offset|), 6072#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 6073#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 6074#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 6075#(and (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= 0 entry_point_~array~0.offset))) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)))), 6076#(or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 6077#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6078#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 6079#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))))] [2018-02-02 10:17:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:17:19,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:17:19,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:17:19,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:17:19,111 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand 24 states. [2018-02-02 10:17:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:19,913 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2018-02-02 10:17:19,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:17:19,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 10:17:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:19,915 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:17:19,915 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 10:17:19,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:17:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 10:17:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2018-02-02 10:17:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 10:17:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2018-02-02 10:17:19,922 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 82 [2018-02-02 10:17:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:19,923 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2018-02-02 10:17:19,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:17:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2018-02-02 10:17:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:17:19,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:19,923 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:19,923 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:19,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207496, now seen corresponding path program 1 times [2018-02-02 10:17:19,924 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:19,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:17:20,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:20,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:17:20,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:20,890 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:17:20,890 INFO L182 omatonBuilderFactory]: Interpolants [6528#(and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 6529#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 6530#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 6531#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 6532#(or (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))))), 6533#(= |free_17_#t~mem8.offset| 0), 6510#true, 6511#false, 6512#(<= entry_point_~len~0 10), 6513#(= 0 |ldv_malloc_#t~malloc1.offset|), 6514#(= 0 |ldv_malloc_#res.offset|), 6515#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 6516#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 6517#(and (or (and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)) (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0)) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset))), 6518#(and (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))))), 6519#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35)))), 6520#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31))) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6521#(or (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (= entry_point_~array~0.offset 0)) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))), 6522#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 6523#(or (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (and (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (= entry_point_~array~0.offset 0))), 6524#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15))) (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)))), 6525#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2))), 6526#(or (and (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 6527#(or (and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3))) (and (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))))] [2018-02-02 10:17:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:17:20,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:17:20,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:17:20,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:17:20,891 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 24 states. [2018-02-02 10:17:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:21,667 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-02-02 10:17:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:17:21,668 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 10:17:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:21,669 INFO L225 Difference]: With dead ends: 196 [2018-02-02 10:17:21,669 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 10:17:21,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=1750, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:17:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 10:17:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 181. [2018-02-02 10:17:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 10:17:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2018-02-02 10:17:21,672 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 82 [2018-02-02 10:17:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:21,673 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2018-02-02 10:17:21,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:17:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2018-02-02 10:17:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:17:21,673 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:21,673 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:21,673 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1081535718, now seen corresponding path program 1 times [2018-02-02 10:17:21,674 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:21,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:21,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:21,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:17:21,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:17:21,701 INFO L182 omatonBuilderFactory]: Interpolants [6960#(not (= 0 |alloc_unsafe_17_#t~ret3.base|)), 6961#(not (= 0 alloc_unsafe_17_~p~0.base)), 6956#true, 6957#false, 6958#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 6959#(not (= 0 |ldv_malloc_#res.base|))] [2018-02-02 10:17:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:21,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:17:21,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:17:21,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:21,701 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand 6 states. [2018-02-02 10:17:21,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:21,719 INFO L93 Difference]: Finished difference Result 170 states and 188 transitions. [2018-02-02 10:17:21,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:17:21,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-02 10:17:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:21,720 INFO L225 Difference]: With dead ends: 170 [2018-02-02 10:17:21,720 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:17:21,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:17:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:17:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2018-02-02 10:17:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:17:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2018-02-02 10:17:21,723 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 83 [2018-02-02 10:17:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:21,723 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2018-02-02 10:17:21,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:17:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2018-02-02 10:17:21,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:17:21,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:21,724 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:21,724 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash -966536980, now seen corresponding path program 1 times [2018-02-02 10:17:21,725 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:21,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:17:22,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:22,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:17:22,062 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:17:22,063 INFO L182 omatonBuilderFactory]: Interpolants [7296#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 7297#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7298#(and (= (select |#valid| |entry_point_#t~ret9.base|) 1) (= 0 |entry_point_#t~ret9.offset|)), 7299#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7300#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7301#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7302#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7303#(and (= (select |#valid| |alloc_unsafe_17_#in~array.base|) 1) (= 0 |alloc_unsafe_17_#in~array.offset|) (<= (* 4 |alloc_unsafe_17_#in~len|) (select |#length| |alloc_unsafe_17_#in~array.base|))), 7304#(and (= (select |#valid| alloc_unsafe_17_~array.base) 1) (<= (* 4 alloc_unsafe_17_~len) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7305#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7306#(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|))), 7307#(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|))))), 7308#(and (<= (* 4 alloc_unsafe_17_~len) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7309#(and (= (select |#valid| alloc_unsafe_17_~array.base) 1) (<= (* 4 alloc_unsafe_17_~len) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0) (<= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0)))), 7310#(and (<= 4 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0))) (= (select |#valid| alloc_unsafe_17_~array.base) 1) (<= (* 4 alloc_unsafe_17_~len) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7311#(and (<= 4 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0))) (= (select |#valid| alloc_unsafe_17_~array.base) 1) (<= (+ (* 4 alloc_unsafe_17_~i~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7312#(and (<= 4 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0))) (<= (+ (* 4 alloc_unsafe_17_~i~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7294#true, 7295#false] [2018-02-02 10:17:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:17:22,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:17:22,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:17:22,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:17:22,063 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand 19 states. [2018-02-02 10:17:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:22,688 INFO L93 Difference]: Finished difference Result 208 states and 229 transitions. [2018-02-02 10:17:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:17:22,689 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-02 10:17:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:22,690 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:17:22,690 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:17:22,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:17:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:17:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 157. [2018-02-02 10:17:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 10:17:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2018-02-02 10:17:22,694 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 85 [2018-02-02 10:17:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:22,695 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2018-02-02 10:17:22,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:17:22,695 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2018-02-02 10:17:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:17:22,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:22,696 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:22,696 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 376505297, now seen corresponding path program 1 times [2018-02-02 10:17:22,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:22,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:22,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:22,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:17:22,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:17:22,829 INFO L182 omatonBuilderFactory]: Interpolants [7712#(= 0 |ldv_malloc_#t~malloc1.offset|), 7713#(= 0 |ldv_malloc_#res.offset|), 7714#(= 0 |entry_point_#t~ret9.offset|), 7715#(= 0 entry_point_~array~0.offset), 7716#(= 0 |alloc_unsafe_17_#in~array.offset|), 7717#(= alloc_unsafe_17_~array.offset 0), 7718#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7719#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0)) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7720#(= |old(#length)| |#length|), 7721#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (= alloc_unsafe_17_~array.offset 0)), 7722#(and (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0) 4) (select |#length| alloc_unsafe_17_~array.base)) (<= 0 alloc_unsafe_17_~j~0) (= alloc_unsafe_17_~array.offset 0)), 7710#true, 7711#false] [2018-02-02 10:17:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:22,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:17:22,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:17:22,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:17:22,829 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand 13 states. [2018-02-02 10:17:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:23,004 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2018-02-02 10:17:23,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:17:23,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-02 10:17:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:23,005 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:17:23,005 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:17:23,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:17:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:17:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-02-02 10:17:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 10:17:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 172 transitions. [2018-02-02 10:17:23,009 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 172 transitions. Word has length 86 [2018-02-02 10:17:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:23,009 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 172 transitions. [2018-02-02 10:17:23,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:17:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 172 transitions. [2018-02-02 10:17:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:17:23,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:23,010 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:23,010 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2078130140, now seen corresponding path program 1 times [2018-02-02 10:17:23,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:23,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:17:23,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:17:23,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:17:23,064 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:23,064 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:17:23,064 INFO L182 omatonBuilderFactory]: Interpolants [8053#true, 8054#false, 8055#(<= 10 entry_point_~len~0), 8056#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 8057#(<= |free_17_#in~len| 0)] [2018-02-02 10:17:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:17:23,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:17:23,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:17:23,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:17:23,065 INFO L87 Difference]: Start difference. First operand 155 states and 172 transitions. Second operand 5 states. [2018-02-02 10:17:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:23,086 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2018-02-02 10:17:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:17:23,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-02-02 10:17:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:23,087 INFO L225 Difference]: With dead ends: 164 [2018-02-02 10:17:23,087 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:17:23,087 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:17:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2018-02-02 10:17:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 10:17:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-02-02 10:17:23,091 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 86 [2018-02-02 10:17:23,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:23,091 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-02-02 10:17:23,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:17:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-02-02 10:17:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:17:23,092 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:23,092 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:23,092 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:23,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1213237701, now seen corresponding path program 1 times [2018-02-02 10:17:23,093 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:23,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:17:23,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:23,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:17:23,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:17:23,369 INFO L182 omatonBuilderFactory]: Interpolants [8369#true, 8370#false, 8371#(= 0 |ldv_malloc_#t~malloc1.offset|), 8372#(= 0 |ldv_malloc_#res.offset|), 8373#(= 0 |entry_point_#t~ret9.offset|), 8374#(= 0 entry_point_~array~0.offset), 8375#(= 0 |alloc_unsafe_17_#in~array.offset|), 8376#(and (= alloc_unsafe_17_~i~0 0) (= alloc_unsafe_17_~array.offset 0)), 8377#(and (= alloc_unsafe_17_~i~0 0) (= 0 |alloc_unsafe_17_#t~ret3.offset|) (= alloc_unsafe_17_~array.offset 0)), 8378#(and (= alloc_unsafe_17_~i~0 0) (= 0 alloc_unsafe_17_~p~0.offset) (= alloc_unsafe_17_~array.offset 0)), 8379#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_unsafe_17_~array.base) (+ (* 4 alloc_unsafe_17_~i~0) alloc_unsafe_17_~array.offset))) (= alloc_unsafe_17_~i~0 0) (= alloc_unsafe_17_~array.offset 0)), 8380#(and (<= alloc_unsafe_17_~i~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_unsafe_17_~array.base) 0)) (= alloc_unsafe_17_~array.offset 0)), 8381#(and (or (not (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0)) 0) (= alloc_unsafe_17_~array.offset 0)), 8382#(and (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))) (= alloc_unsafe_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))), 8383#(= |alloc_unsafe_17_#t~mem6.offset| 0)] [2018-02-02 10:17:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:17:23,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:17:23,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:17:23,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:17:23,370 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 15 states. [2018-02-02 10:17:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:23,563 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2018-02-02 10:17:23,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:17:23,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 10:17:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:23,564 INFO L225 Difference]: With dead ends: 166 [2018-02-02 10:17:23,564 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 10:17:23,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:17:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 10:17:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2018-02-02 10:17:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:17:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 177 transitions. [2018-02-02 10:17:23,568 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 177 transitions. Word has length 87 [2018-02-02 10:17:23,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:23,568 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 177 transitions. [2018-02-02 10:17:23,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:17:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 177 transitions. [2018-02-02 10:17:23,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:17:23,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:23,569 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:23,569 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1213237700, now seen corresponding path program 1 times [2018-02-02 10:17:23,570 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:23,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:23,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:23,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:17:23,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:17:23,914 INFO L182 omatonBuilderFactory]: Interpolants [8736#(= 0 entry_point_~array~0.offset), 8737#(= 0 |alloc_unsafe_17_#in~array.offset|), 8738#(and (= alloc_unsafe_17_~i~0 0) (= alloc_unsafe_17_~array.offset 0)), 8739#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 8740#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8741#(and (= alloc_unsafe_17_~i~0 0) (= 1 (select |#valid| |alloc_unsafe_17_#t~ret3.base|)) (= alloc_unsafe_17_~array.offset 0)), 8742#(and (= 1 (select |#valid| alloc_unsafe_17_~p~0.base)) (= alloc_unsafe_17_~i~0 0) (= alloc_unsafe_17_~array.offset 0)), 8743#(and (= alloc_unsafe_17_~i~0 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ (* 4 alloc_unsafe_17_~i~0) alloc_unsafe_17_~array.offset)))) (= alloc_unsafe_17_~array.offset 0)), 8744#(and (<= alloc_unsafe_17_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) 0))) (= alloc_unsafe_17_~array.offset 0)), 8745#(= |#valid| |old(#valid)|), 8746#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (not (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (<= (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0)) 0) (= alloc_unsafe_17_~array.offset 0)), 8747#(and (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (= alloc_unsafe_17_~array.offset 0)), 8748#(= 1 (select |#valid| |alloc_unsafe_17_#t~mem6.base|)), 8731#true, 8732#false, 8733#(= 0 |ldv_malloc_#t~malloc1.offset|), 8734#(= 0 |ldv_malloc_#res.offset|), 8735#(= 0 |entry_point_#t~ret9.offset|)] [2018-02-02 10:17:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:17:23,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:17:23,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:17:23,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:17:23,917 INFO L87 Difference]: Start difference. First operand 158 states and 177 transitions. Second operand 18 states. [2018-02-02 10:17:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:24,279 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2018-02-02 10:17:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:17:24,280 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 10:17:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:24,281 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:17:24,281 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 10:17:24,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:17:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 10:17:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2018-02-02 10:17:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 10:17:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2018-02-02 10:17:24,285 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 87 [2018-02-02 10:17:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:24,285 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2018-02-02 10:17:24,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:17:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2018-02-02 10:17:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:17:24,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:24,286 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:24,286 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:24,286 INFO L82 PathProgramCache]: Analyzing trace with hash -155427266, now seen corresponding path program 1 times [2018-02-02 10:17:24,287 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:24,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:25,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:25,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:17:25,250 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:25,251 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:17:25,251 INFO L182 omatonBuilderFactory]: Interpolants [9102#true, 9103#false, 9104#(<= entry_point_~len~0 10), 9105#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 9106#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 9107#(and (= 1 (select |#valid| |entry_point_#t~ret9.base|)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 9108#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9109#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 10)) (= 0 entry_point_~array~0.offset)), 9110#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (or (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= entry_point_~len~0 10))) (or (not (= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))))), 9111#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 35))) (= 0 entry_point_~array~0.offset)), 9112#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31)) (and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))) (= 0 entry_point_~array~0.offset)), 9113#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 3) entry_point_~i~2))) (= 0 entry_point_~array~0.offset)), 9114#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (or (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 23)))), 9115#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 5) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)))), 9116#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 6) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 15))) (= 0 entry_point_~array~0.offset)), 9117#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 7) entry_point_~i~2)) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 11)))), 9118#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (or (and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 8) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)))), 9119#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 3)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0)))), 9120#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) 0))), 9121#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 9122#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9123#(= |#valid| |old(#valid)|), 9124#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|) (= 1 (select |#valid| |free_17_#in~array.base|))), 9125#(and (or (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (and (<= (+ (* 4 free_17_~i~1) free_17_~array.offset) 0) (not (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset))))) (= 1 (select |#valid| free_17_~array.base))), 9126#(and (= 0 |free_17_#t~mem8.base|) (= 1 (select |#valid| free_17_~array.base))), 9127#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:17:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:17:25,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:17:25,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:17:25,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:17:25,251 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand 26 states. [2018-02-02 10:17:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:25,955 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2018-02-02 10:17:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:17:25,956 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-02-02 10:17:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:25,957 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:17:25,957 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:17:25,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:17:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:17:25,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2018-02-02 10:17:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:17:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2018-02-02 10:17:25,960 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 188 transitions. Word has length 87 [2018-02-02 10:17:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:25,961 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-02-02 10:17:25,961 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:17:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 188 transitions. [2018-02-02 10:17:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:17:25,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:25,961 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:25,961 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:25,961 INFO L82 PathProgramCache]: Analyzing trace with hash -155427265, now seen corresponding path program 1 times [2018-02-02 10:17:25,962 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:25,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:17:26,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:26,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:17:26,135 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:26,136 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:17:26,136 INFO L182 omatonBuilderFactory]: Interpolants [9506#true, 9507#false, 9508#(= 0 |ldv_malloc_#t~malloc1.offset|), 9509#(= 0 |ldv_malloc_#res.offset|), 9510#(= 0 |entry_point_#t~ret9.offset|), 9511#(= entry_point_~array~0.offset 0), 9512#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9513#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9514#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9515#(= |old(#length)| |#length|), 9516#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 9517#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 9518#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (<= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= free_17_~array.offset 0)), 9519#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 9520#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-02 10:17:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:17:26,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:17:26,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:17:26,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:17:26,137 INFO L87 Difference]: Start difference. First operand 167 states and 188 transitions. Second operand 15 states. [2018-02-02 10:17:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:26,339 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-02-02 10:17:26,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:17:26,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 10:17:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:26,340 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:17:26,340 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:17:26,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:17:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:17:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-02-02 10:17:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 10:17:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-02-02 10:17:26,344 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 186 transitions. Word has length 87 [2018-02-02 10:17:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:26,344 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-02-02 10:17:26,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:17:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 186 transitions. [2018-02-02 10:17:26,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:17:26,345 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:26,345 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:26,345 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -523277901, now seen corresponding path program 1 times [2018-02-02 10:17:26,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:26,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:17:27,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:27,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:17:27,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:27,165 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:17:27,165 INFO L182 omatonBuilderFactory]: Interpolants [9876#true, 9877#false, 9878#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 9879#(= 0 |ldv_malloc_#t~malloc1.offset|), 9880#(= 0 |ldv_malloc_#res.offset|), 9881#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 9882#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9883#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9884#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))))), 9885#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 9886#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 9887#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 9888#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2)), 9889#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2)), 9890#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 9891#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))), 9892#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 9893#(and (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 9894#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)))), 9895#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 9896#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 9897#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 9898#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 9899#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 9900#(= 0 |free_17_#t~mem8.base|)] [2018-02-02 10:17:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:17:27,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:17:27,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:17:27,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:17:27,166 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. Second operand 25 states. [2018-02-02 10:17:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:29,601 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2018-02-02 10:17:29,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:17:29,601 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 10:17:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:29,602 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:17:29,602 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 10:17:29,603 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=582, Invalid=3200, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 10:17:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 10:17:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 168. [2018-02-02 10:17:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:17:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-02-02 10:17:29,606 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 88 [2018-02-02 10:17:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:29,606 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-02-02 10:17:29,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:17:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-02-02 10:17:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:17:29,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:29,607 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:29,607 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:29,607 INFO L82 PathProgramCache]: Analyzing trace with hash -523277902, now seen corresponding path program 1 times [2018-02-02 10:17:29,607 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:29,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:30,507 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:17:30,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:30,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:17:30,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:30,508 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:17:30,508 INFO L182 omatonBuilderFactory]: Interpolants [10322#true, 10323#false, 10324#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10325#(= 0 |ldv_malloc_#t~malloc1.offset|), 10326#(= 0 |ldv_malloc_#res.offset|), 10327#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 10328#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10329#(and (<= 10 entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10330#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)))) 4) 1) entry_point_~i~2)), 10331#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32))))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)))) 4) 2) entry_point_~i~2)), 10332#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)))) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28))))) (= entry_point_~array~0.offset 0)), 10333#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24))) (- entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)))))), 10334#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))) 4) 5) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)))))), 10335#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))) 4) 6) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)))))), 10336#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)))) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 10337#(and (= entry_point_~array~0.offset 0) (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8))))))), 10338#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ entry_point_~array~0.offset 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 10339#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10340#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 10341#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))), 10342#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10343#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 10344#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 10345#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10346#(= |free_17_#t~mem8.offset| 0)] [2018-02-02 10:17:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:17:30,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:17:30,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:17:30,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:17:30,509 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 25 states. [2018-02-02 10:17:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:32,855 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-02-02 10:17:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:17:32,855 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 10:17:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:32,856 INFO L225 Difference]: With dead ends: 177 [2018-02-02 10:17:32,856 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 10:17:32,856 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=610, Invalid=3550, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 10:17:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 10:17:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2018-02-02 10:17:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:17:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 187 transitions. [2018-02-02 10:17:32,858 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 187 transitions. Word has length 88 [2018-02-02 10:17:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:32,858 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 187 transitions. [2018-02-02 10:17:32,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:17:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 187 transitions. [2018-02-02 10:17:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:17:32,859 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:32,859 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:32,859 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:32,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2131021318, now seen corresponding path program 1 times [2018-02-02 10:17:32,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:32,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:17:32,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:32,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:17:32,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:17:32,909 INFO L182 omatonBuilderFactory]: Interpolants [10773#true, 10774#false, 10775#(= alloc_unsafe_17_~i~0 0), 10776#(<= alloc_unsafe_17_~i~0 1), 10777#(<= alloc_unsafe_17_~j~0 0), 10778#(<= (+ alloc_unsafe_17_~j~0 1) 0)] [2018-02-02 10:17:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:17:32,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:17:32,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:17:32,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:32,909 INFO L87 Difference]: Start difference. First operand 168 states and 187 transitions. Second operand 6 states. [2018-02-02 10:17:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:32,947 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2018-02-02 10:17:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:17:32,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-02-02 10:17:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:32,949 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:17:32,949 INFO L226 Difference]: Without dead ends: 173 [2018-02-02 10:17:32,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:17:32,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-02 10:17:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2018-02-02 10:17:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 10:17:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2018-02-02 10:17:32,952 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 92 [2018-02-02 10:17:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:32,952 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2018-02-02 10:17:32,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:17:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2018-02-02 10:17:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 10:17:32,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:32,953 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:32,953 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1619910534, now seen corresponding path program 1 times [2018-02-02 10:17:32,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:32,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:17:33,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:33,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:17:33,004 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:33,005 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:17:33,005 INFO L182 omatonBuilderFactory]: Interpolants [11124#true, 11125#false, 11126#(<= 10 entry_point_~len~0), 11127#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 11128#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 11129#(<= |free_17_#in~len| 1)] [2018-02-02 10:17:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:17:33,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:17:33,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:17:33,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:17:33,005 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand 6 states. [2018-02-02 10:17:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:33,041 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-02-02 10:17:33,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:17:33,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-02-02 10:17:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:33,043 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:17:33,043 INFO L226 Difference]: Without dead ends: 183 [2018-02-02 10:17:33,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:17:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-02 10:17:33,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2018-02-02 10:17:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 10:17:33,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 188 transitions. [2018-02-02 10:17:33,047 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 188 transitions. Word has length 92 [2018-02-02 10:17:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:33,047 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 188 transitions. [2018-02-02 10:17:33,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:17:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 188 transitions. [2018-02-02 10:17:33,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:17:33,048 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:33,048 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:33,049 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:33,049 INFO L82 PathProgramCache]: Analyzing trace with hash 372457076, now seen corresponding path program 2 times [2018-02-02 10:17:33,049 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:33,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:17:33,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:33,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:17:33,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:33,116 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:17:33,116 INFO L182 omatonBuilderFactory]: Interpolants [11488#true, 11489#false, 11490#(<= 10 entry_point_~len~0), 11491#(<= 10 |alloc_unsafe_17_#in~len|), 11492#(and (= alloc_unsafe_17_~i~0 0) (<= 10 alloc_unsafe_17_~len)), 11493#(<= (+ alloc_unsafe_17_~i~0 9) alloc_unsafe_17_~len), 11494#(<= (+ alloc_unsafe_17_~i~0 8) alloc_unsafe_17_~len)] [2018-02-02 10:17:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:17:33,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:17:33,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:17:33,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:17:33,117 INFO L87 Difference]: Start difference. First operand 169 states and 188 transitions. Second operand 7 states. [2018-02-02 10:17:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:33,176 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2018-02-02 10:17:33,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:17:33,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-02-02 10:17:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:33,177 INFO L225 Difference]: With dead ends: 201 [2018-02-02 10:17:33,177 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 10:17:33,177 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:17:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 10:17:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 175. [2018-02-02 10:17:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:17:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 194 transitions. [2018-02-02 10:17:33,182 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 194 transitions. Word has length 93 [2018-02-02 10:17:33,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:33,182 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 194 transitions. [2018-02-02 10:17:33,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:17:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 194 transitions. [2018-02-02 10:17:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:17:33,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:33,183 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:33,183 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:33,183 INFO L82 PathProgramCache]: Analyzing trace with hash 665082788, now seen corresponding path program 1 times [2018-02-02 10:17:33,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:33,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:17:33,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:33,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:17:33,242 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:17:33,242 INFO L182 omatonBuilderFactory]: Interpolants [11877#true, 11878#false, 11879#(= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|), 11880#(= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)), 11881#(= |#valid| |old(#valid)|), 11882#(= 1 (select |#valid| entry_point_~array~0.base)), 11883#(= 1 (select |#valid| |free_17_#in~array.base|)), 11884#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:17:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:17:33,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:17:33,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:17:33,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:17:33,243 INFO L87 Difference]: Start difference. First operand 175 states and 194 transitions. Second operand 8 states. [2018-02-02 10:17:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:33,363 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-02-02 10:17:33,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:17:33,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-02-02 10:17:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:33,364 INFO L225 Difference]: With dead ends: 192 [2018-02-02 10:17:33,364 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 10:17:33,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:17:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 10:17:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2018-02-02 10:17:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:17:33,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2018-02-02 10:17:33,367 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 94 [2018-02-02 10:17:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:33,367 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2018-02-02 10:17:33,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:17:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2018-02-02 10:17:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:17:33,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:33,367 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:33,368 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 665082789, now seen corresponding path program 1 times [2018-02-02 10:17:33,369 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:33,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:17:33,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:33,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:17:33,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:17:33,445 INFO L182 omatonBuilderFactory]: Interpolants [12273#true, 12274#false, 12275#(= 0 |ldv_malloc_#t~malloc1.offset|), 12276#(= 0 |ldv_malloc_#res.offset|), 12277#(= 0 |entry_point_#t~ret9.offset|), 12278#(= 0 entry_point_~array~0.offset), 12279#(or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)), 12280#(or (<= 0 alloc_unsafe_17_~i~0) (not (= |alloc_unsafe_17_#in~array.offset| 0))), 12281#(or (<= 1 alloc_unsafe_17_~i~0) (not (= |alloc_unsafe_17_#in~array.offset| 0))), 12282#(or (not (= |alloc_unsafe_17_#in~array.offset| 0)) (<= 0 alloc_unsafe_17_~j~0)), 12283#(not (= |alloc_unsafe_17_#in~array.offset| 0))] [2018-02-02 10:17:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:17:33,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:17:33,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:17:33,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:17:33,446 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand 11 states. [2018-02-02 10:17:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:33,669 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2018-02-02 10:17:33,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:17:33,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-02 10:17:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:33,670 INFO L225 Difference]: With dead ends: 178 [2018-02-02 10:17:33,670 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:17:33,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:17:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:17:33,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-02-02 10:17:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:17:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-02-02 10:17:33,674 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 94 [2018-02-02 10:17:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:33,674 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-02-02 10:17:33,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:17:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-02-02 10:17:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:17:33,675 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:33,675 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:33,675 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:33,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1475333164, now seen corresponding path program 2 times [2018-02-02 10:17:33,676 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:33,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:17:34,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:34,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:17:34,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:34,637 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:17:34,637 INFO L182 omatonBuilderFactory]: Interpolants [12644#true, 12645#false, 12646#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12647#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 12648#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 12649#(and (not (= 0 |entry_point_#t~ret9.base|)) (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 12650#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 12651#(and (<= 10 entry_point_~len~0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12652#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 12653#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 12654#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 12655#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 12656#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 12657#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2)), 12658#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 12659#(and (= entry_point_~array~0.offset 0) (or (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 12660#(and (or (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 4 entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12661#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)) entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0)))), 12662#(and (= entry_point_~array~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 12663#(and (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)) entry_point_~array~0.base))), 12664#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12665#(and (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4) |free_17_#in~array.base|))), 12666#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 4) free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 12667#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)) (= free_17_~array.offset 0)), 12668#(and (not (= free_17_~array.base |free_17_#t~mem8.base|)) (= 1 (select |#valid| free_17_~array.base))), 12669#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:17:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:17:34,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:17:34,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:17:34,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:17:34,638 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 26 states. [2018-02-02 10:17:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:37,208 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2018-02-02 10:17:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 10:17:37,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2018-02-02 10:17:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:37,209 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:17:37,209 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:17:37,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=635, Invalid=3921, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 10:17:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:17:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2018-02-02 10:17:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 10:17:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 195 transitions. [2018-02-02 10:17:37,213 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 195 transitions. Word has length 93 [2018-02-02 10:17:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:37,214 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 195 transitions. [2018-02-02 10:17:37,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:17:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 195 transitions. [2018-02-02 10:17:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:17:37,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:37,215 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:37,215 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1509312221, now seen corresponding path program 2 times [2018-02-02 10:17:37,215 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:37,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:17:38,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:38,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:17:38,055 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:38,055 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:17:38,055 INFO L182 omatonBuilderFactory]: Interpolants [13120#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13121#(= 0 |ldv_malloc_#t~malloc1.offset|), 13122#(= 0 |ldv_malloc_#res.offset|), 13123#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 13124#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13125#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13126#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 13127#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2)), 13128#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 13129#(and (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 4) entry_point_~i~2)), 13130#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset))) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 13131#(and (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 13132#(and (or (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 13133#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 13134#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 13135#(and (or (<= (+ entry_point_~i~2 1) entry_point_~len~0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 13136#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 13137#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 13138#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 13139#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 13140#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 13141#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13142#(= 0 |free_17_#t~mem8.base|), 13118#true, 13119#false] [2018-02-02 10:17:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:17:38,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:17:38,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:17:38,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:17:38,056 INFO L87 Difference]: Start difference. First operand 177 states and 195 transitions. Second operand 25 states. [2018-02-02 10:17:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:39,928 INFO L93 Difference]: Finished difference Result 190 states and 205 transitions. [2018-02-02 10:17:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:17:39,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 10:17:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:39,930 INFO L225 Difference]: With dead ends: 190 [2018-02-02 10:17:39,930 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 10:17:39,931 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=506, Invalid=3034, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:17:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 10:17:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2018-02-02 10:17:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:17:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 197 transitions. [2018-02-02 10:17:39,934 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 197 transitions. Word has length 94 [2018-02-02 10:17:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:39,934 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 197 transitions. [2018-02-02 10:17:39,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:17:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 197 transitions. [2018-02-02 10:17:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:17:39,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:39,935 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:39,935 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:39,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1509312220, now seen corresponding path program 2 times [2018-02-02 10:17:39,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:39,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:17:40,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:40,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:17:40,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:40,741 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:17:40,741 INFO L182 omatonBuilderFactory]: Interpolants [13582#true, 13583#false, 13584#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13585#(= 0 |ldv_malloc_#t~malloc1.offset|), 13586#(= 0 |ldv_malloc_#res.offset|), 13587#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 13588#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13589#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))), 13590#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 13591#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)))), 13592#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 13593#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)))), 13594#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)))), 13595#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 13596#(and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 13597#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 13598#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 13599#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 13600#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 13601#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 13602#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 13603#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 13604#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)))) (= free_17_~array.offset 0)), 13605#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13606#(= |free_17_#t~mem8.offset| 0)] [2018-02-02 10:17:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:17:40,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:17:40,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:17:40,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:17:40,742 INFO L87 Difference]: Start difference. First operand 178 states and 197 transitions. Second operand 25 states. [2018-02-02 10:17:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:42,762 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2018-02-02 10:17:42,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:17:42,762 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 10:17:42,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:42,763 INFO L225 Difference]: With dead ends: 189 [2018-02-02 10:17:42,763 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 10:17:42,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=534, Invalid=3498, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 10:17:42,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 10:17:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2018-02-02 10:17:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:17:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2018-02-02 10:17:42,767 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 94 [2018-02-02 10:17:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:42,767 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2018-02-02 10:17:42,767 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:17:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2018-02-02 10:17:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 10:17:42,768 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:42,768 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:42,768 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:42,768 INFO L82 PathProgramCache]: Analyzing trace with hash -456007726, now seen corresponding path program 1 times [2018-02-02 10:17:42,769 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:42,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:17:42,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:42,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:17:42,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:42,820 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:17:42,820 INFO L182 omatonBuilderFactory]: Interpolants [14053#true, 14054#false, 14055#(<= 10 entry_point_~len~0), 14056#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 14057#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 14058#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 14059#(<= |free_17_#in~len| 2)] [2018-02-02 10:17:42,821 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:17:42,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:17:42,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:17:42,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:17:42,821 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand 7 states. [2018-02-02 10:17:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:42,846 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions. [2018-02-02 10:17:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:17:42,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-02-02 10:17:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:42,846 INFO L225 Difference]: With dead ends: 206 [2018-02-02 10:17:42,846 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:17:42,847 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:17:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:17:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2018-02-02 10:17:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:17:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2018-02-02 10:17:42,849 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 95 [2018-02-02 10:17:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:42,849 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2018-02-02 10:17:42,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:17:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2018-02-02 10:17:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:17:42,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:42,850 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:42,850 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:42,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1393220425, now seen corresponding path program 2 times [2018-02-02 10:17:42,851 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:42,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:17:43,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:43,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:17:43,257 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:17:43,258 INFO L182 omatonBuilderFactory]: Interpolants [14464#(= alloc_unsafe_17_~array.offset 0), 14465#(and (= 0 |alloc_unsafe_17_#t~ret3.offset|) (= alloc_unsafe_17_~array.offset 0)), 14466#(and (= 0 alloc_unsafe_17_~p~0.offset) (= alloc_unsafe_17_~array.offset 0)), 14467#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_unsafe_17_~array.base) (* 4 alloc_unsafe_17_~i~0))) (= alloc_unsafe_17_~array.offset 0)), 14468#(and (= 0 (select (select |#memory_$Pointer$.offset| alloc_unsafe_17_~array.base) (+ (* 4 alloc_unsafe_17_~i~0) (- 4)))) (= alloc_unsafe_17_~array.offset 0)), 14469#(and (= alloc_unsafe_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))), 14470#(= |alloc_unsafe_17_#t~mem6.offset| 0), 14452#true, 14453#false, 14454#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 14455#(= 0 |ldv_malloc_#t~malloc1.offset|), 14456#(= 0 |ldv_malloc_#res.offset|), 14457#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 14458#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14459#(= entry_point_~array~0.offset 0), 14460#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 14461#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))), 14462#(= 0 |alloc_unsafe_17_#in~array.offset|), 14463#(and (= alloc_unsafe_17_~i~0 0) (= alloc_unsafe_17_~array.offset 0))] [2018-02-02 10:17:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:17:43,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:17:43,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:17:43,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:17:43,259 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand 19 states. [2018-02-02 10:17:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:43,523 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2018-02-02 10:17:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:17:43,523 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-02 10:17:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:43,524 INFO L225 Difference]: With dead ends: 188 [2018-02-02 10:17:43,524 INFO L226 Difference]: Without dead ends: 188 [2018-02-02 10:17:43,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:17:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-02-02 10:17:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2018-02-02 10:17:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:17:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2018-02-02 10:17:43,527 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 100 [2018-02-02 10:17:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:43,527 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2018-02-02 10:17:43,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:17:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2018-02-02 10:17:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:17:43,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:43,527 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:43,527 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:43,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1393220424, now seen corresponding path program 2 times [2018-02-02 10:17:43,528 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:43,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:17:43,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:43,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:17:43,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:17:43,823 INFO L182 omatonBuilderFactory]: Interpolants [14880#(= 0 |alloc_unsafe_17_#in~array.offset|), 14881#(and (= alloc_unsafe_17_~i~0 0) (= alloc_unsafe_17_~array.offset 0)), 14882#(= alloc_unsafe_17_~array.offset 0), 14883#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 14884#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 14885#(and (= 1 (select |#valid| |alloc_unsafe_17_#t~ret3.base|)) (= alloc_unsafe_17_~array.offset 0)), 14886#(and (= 1 (select |#valid| alloc_unsafe_17_~p~0.base)) (= alloc_unsafe_17_~array.offset 0)), 14887#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (* 4 alloc_unsafe_17_~i~0)))) (= alloc_unsafe_17_~array.offset 0)), 14888#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ (* 4 alloc_unsafe_17_~i~0) (- 4))))) (= alloc_unsafe_17_~array.offset 0)), 14889#(= |#valid| |old(#valid)|), 14890#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (= alloc_unsafe_17_~array.offset 0)), 14891#(= 1 (select |#valid| |alloc_unsafe_17_#t~mem6.base|)), 14870#true, 14871#false, 14872#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 14873#(= 0 |ldv_malloc_#t~malloc1.offset|), 14874#(= 0 |ldv_malloc_#res.offset|), 14875#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 14876#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14877#(= entry_point_~array~0.offset 0), 14878#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))), 14879#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0))))] [2018-02-02 10:17:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:17:43,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:17:43,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:17:43,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:17:43,824 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 22 states. [2018-02-02 10:17:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:44,185 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2018-02-02 10:17:44,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:17:44,186 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-02 10:17:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:44,186 INFO L225 Difference]: With dead ends: 194 [2018-02-02 10:17:44,186 INFO L226 Difference]: Without dead ends: 194 [2018-02-02 10:17:44,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=1597, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:17:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-02-02 10:17:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 185. [2018-02-02 10:17:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-02-02 10:17:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 206 transitions. [2018-02-02 10:17:44,189 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 206 transitions. Word has length 100 [2018-02-02 10:17:44,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:44,189 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 206 transitions. [2018-02-02 10:17:44,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:17:44,189 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 206 transitions. [2018-02-02 10:17:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:17:44,189 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:44,189 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:44,189 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1824682022, now seen corresponding path program 1 times [2018-02-02 10:17:44,190 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:44,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:17:44,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:44,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 10:17:44,728 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:17:44,729 INFO L182 omatonBuilderFactory]: Interpolants [15328#(and (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)) (or (not (= alloc_unsafe_17_~array.offset 0)) (and (= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (not (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|)))), 15329#(and (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)) (or (not (= alloc_unsafe_17_~array.offset 0)) (and (= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0))))) (<= 1 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~j~0)))) (<= 0 alloc_unsafe_17_~j~0) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|)))), 15330#(or (= 1 (select (store |#valid| |alloc_unsafe_17_#t~mem6.base| 0) |alloc_unsafe_17_#in~array.base|)) (= 0 (select |old(#valid)| |alloc_unsafe_17_#in~array.base|)) (<= 1 alloc_unsafe_17_~j~0) (not (= |alloc_unsafe_17_#in~array.offset| 0))), 15331#(or (= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)) (= 0 (select |old(#valid)| |alloc_unsafe_17_#in~array.base|)) (<= 1 alloc_unsafe_17_~j~0) (not (= |alloc_unsafe_17_#in~array.offset| 0))), 15332#(or (= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)) (= 0 (select |old(#valid)| |alloc_unsafe_17_#in~array.base|)) (not (= |alloc_unsafe_17_#in~array.offset| 0)) (<= 0 alloc_unsafe_17_~j~0)), 15333#(or (= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)) (= 0 (select |old(#valid)| |alloc_unsafe_17_#in~array.base|)) (not (= |alloc_unsafe_17_#in~array.offset| 0))), 15334#(= 1 (select |#valid| entry_point_~array~0.base)), 15335#(= 1 (select |#valid| |free_17_#in~array.base|)), 15336#(= 1 (select |#valid| free_17_~array.base)), 15314#true, 15315#false, 15316#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 15317#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 15318#(and (= (select |#valid| |entry_point_#t~ret9.base|) 1) (= 0 |entry_point_#t~ret9.offset|)), 15319#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 15320#(= |#valid| |old(#valid)|), 15321#(and (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)) (or (not (= alloc_unsafe_17_~array.offset 0)) (and (or (= |#valid| |old(#valid)|) (not (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0))))) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|)))), 15322#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 15323#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 15324#(and (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)) (or (and (or (= 0 (select |old(#valid)| |alloc_unsafe_17_#t~ret3.base|)) (not (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0))))) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|)) (not (= alloc_unsafe_17_~array.offset 0)))), 15325#(and (or (and (or (= 0 (select |old(#valid)| alloc_unsafe_17_~p~0.base)) (not (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0))))) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|)) (not (= alloc_unsafe_17_~array.offset 0))) (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0))), 15326#(and (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)) (or (and (= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) (+ (* 4 alloc_unsafe_17_~i~0) alloc_unsafe_17_~array.offset)))) (not (= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0))))) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|) (<= 0 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0)))) (not (= alloc_unsafe_17_~array.offset 0)))), 15327#(and (or (not (= alloc_unsafe_17_~array.offset 0)) (and (= 1 (select |#valid| |alloc_unsafe_17_#in~array.base|)) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_unsafe_17_~array.base) 0))) (<= 5 (+ alloc_unsafe_17_~array.offset (* 4 alloc_unsafe_17_~i~0)))) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|))) (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)))] [2018-02-02 10:17:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 10:17:44,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 10:17:44,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 10:17:44,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-02 10:17:44,729 INFO L87 Difference]: Start difference. First operand 185 states and 206 transitions. Second operand 23 states. [2018-02-02 10:17:46,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:46,069 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-02-02 10:17:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:17:46,069 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 100 [2018-02-02 10:17:46,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:46,071 INFO L225 Difference]: With dead ends: 230 [2018-02-02 10:17:46,071 INFO L226 Difference]: Without dead ends: 230 [2018-02-02 10:17:46,071 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=303, Invalid=1767, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:17:46,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-02-02 10:17:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 198. [2018-02-02 10:17:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 10:17:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2018-02-02 10:17:46,075 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 100 [2018-02-02 10:17:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:46,075 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2018-02-02 10:17:46,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 10:17:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2018-02-02 10:17:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:17:46,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:46,077 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:46,077 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1824682021, now seen corresponding path program 1 times [2018-02-02 10:17:46,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:46,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:17:46,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:46,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:17:46,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:17:46,226 INFO L182 omatonBuilderFactory]: Interpolants [15811#true, 15812#false, 15813#(= 0 |ldv_malloc_#t~malloc1.offset|), 15814#(= 0 |ldv_malloc_#res.offset|), 15815#(= 0 |entry_point_#t~ret9.offset|), 15816#(= 0 entry_point_~array~0.offset), 15817#(and (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)) (or (not (= alloc_unsafe_17_~array.offset 0)) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|))), 15818#(and (or (= |alloc_unsafe_17_#in~array.offset| alloc_unsafe_17_~array.offset) (= alloc_unsafe_17_~array.offset 0)) (or (and (<= 0 alloc_unsafe_17_~j~0) (= alloc_unsafe_17_~array.base |alloc_unsafe_17_#in~array.base|)) (not (= alloc_unsafe_17_~array.offset 0)))), 15819#(or (<= 4 (select |#length| |alloc_unsafe_17_#in~array.base|)) (not (= |alloc_unsafe_17_#in~array.offset| 0))), 15820#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 15821#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 15822#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 10:17:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:17:46,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:17:46,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:17:46,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:17:46,227 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand 12 states. [2018-02-02 10:17:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:46,429 INFO L93 Difference]: Finished difference Result 212 states and 228 transitions. [2018-02-02 10:17:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:17:46,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2018-02-02 10:17:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:46,430 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:17:46,431 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:17:46,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:17:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:17:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 198. [2018-02-02 10:17:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-02-02 10:17:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2018-02-02 10:17:46,434 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 100 [2018-02-02 10:17:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:46,435 INFO L432 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2018-02-02 10:17:46,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:17:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2018-02-02 10:17:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:17:46,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:46,435 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:46,436 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1565982954, now seen corresponding path program 3 times [2018-02-02 10:17:46,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:17:46,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:17:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:17:47,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:17:47,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:17:47,138 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:17:47,138 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:17:47,139 INFO L182 omatonBuilderFactory]: Interpolants [16256#(and (= entry_point_~array~0.offset 0) (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 8 entry_point_~array~0.offset)) entry_point_~array~0.base))))), 16257#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)) entry_point_~array~0.base))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 16258#(and (= entry_point_~array~0.offset 0) (or (<= (+ entry_point_~i~2 1) entry_point_~len~0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)) entry_point_~array~0.base)))), 16259#(and (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)) entry_point_~array~0.base))), 16260#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16261#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8) |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 16262#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 8) free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16263#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4))) free_17_~array.base)) (= free_17_~array.offset 0)), 16264#(not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)), 16265#(and (not (= free_17_~array.base |free_17_#t~mem8.base|)) (= 1 (select |#valid| free_17_~array.base))), 16266#(= 1 (select |#valid| free_17_~array.base)), 16241#true, 16242#false, 16243#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 16244#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 16245#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 16246#(and (not (= 0 |entry_point_#t~ret9.base|)) (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret9.offset|)), 16247#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 16248#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) entry_point_~array~0.base))), 16249#(and (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 36)) entry_point_~array~0.offset)) 4) 1) entry_point_~i~2)), 16250#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~2) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 16251#(and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 16252#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 24)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 16253#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) 4) 5) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 16254#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) 4) 6) entry_point_~i~2) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 16255#(and (or (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset)) entry_point_~array~0.base)) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0))] [2018-02-02 10:17:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 219 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:17:47,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:17:47,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:17:47,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:17:47,139 INFO L87 Difference]: Start difference. First operand 198 states and 220 transitions. Second operand 26 states. [2018-02-02 10:17:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:17:49,411 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2018-02-02 10:17:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:17:49,411 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-02 10:17:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:17:49,411 INFO L225 Difference]: With dead ends: 212 [2018-02-02 10:17:49,412 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 10:17:49,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=564, Invalid=3858, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 10:17:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 10:17:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 203. [2018-02-02 10:17:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 10:17:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 226 transitions. [2018-02-02 10:17:49,417 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 226 transitions. Word has length 99 [2018-02-02 10:17:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:17:49,418 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 226 transitions. [2018-02-02 10:17:49,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:17:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 226 transitions. [2018-02-02 10:17:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 10:17:49,419 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:17:49,419 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:17:49,419 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 10:17:49,419 INFO L82 PathProgramCache]: Analyzing trace with hash -730567785, now seen corresponding path program 1 times [2018-02-02 10:17:49,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:17:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:17:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:17:49,479 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 10:17:49,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:17:49 BoogieIcfgContainer [2018-02-02 10:17:49,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:17:49,518 INFO L168 Benchmark]: Toolchain (without parser) took 37497.63 ms. Allocated memory was 403.2 MB in the beginning and 1.3 GB in the end (delta: 879.8 MB). Free memory was 360.1 MB in the beginning and 948.6 MB in the end (delta: -588.6 MB). Peak memory consumption was 291.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:17:49,519 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 365.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:17:49,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.89 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 346.8 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:17:49,520 INFO L168 Benchmark]: Boogie Preprocessor took 23.93 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 344.2 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:17:49,520 INFO L168 Benchmark]: RCFGBuilder took 216.22 ms. Allocated memory is still 403.2 MB. Free memory was 344.2 MB in the beginning and 322.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:17:49,520 INFO L168 Benchmark]: TraceAbstraction took 37089.75 ms. Allocated memory was 403.2 MB in the beginning and 1.3 GB in the end (delta: 879.8 MB). Free memory was 319.5 MB in the beginning and 948.6 MB in the end (delta: -629.2 MB). Peak memory consumption was 250.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:17:49,521 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 403.2 MB. Free memory is still 365.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.89 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 346.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.93 ms. Allocated memory is still 403.2 MB. Free memory was 346.8 MB in the beginning and 344.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 216.22 ms. Allocated memory is still 403.2 MB. Free memory was 344.2 MB in the beginning and 322.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 37089.75 ms. Allocated memory was 403.2 MB in the beginning and 1.3 GB in the end (delta: 879.8 MB). Free memory was 319.5 MB in the beginning and 948.6 MB in the end (delta: -629.2 MB). Peak memory consumption was 250.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*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] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={42:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND FALSE !(!array) [L1469] i=0 VAL [array={42:0}, i=0, len=10] [L1469] COND TRUE i=0 VAL [\old(len)=10, array={42:0}, array={42:0}, i=1, j=0, len=10, p={0:0}] [L1451] EXPR, FCALL array[j] VAL [\old(len)=10, array={42:0}, array={42:0}, array[j]={43:0}, i=1, j=0, len=10, p={0:0}] [L1451] FCALL free(array[j]) VAL [\old(len)=10, array={42:0}, array={42:0}, array[j]={43:0}, i=1, j=0, len=10, p={0:0}] [L1450] j-- VAL [\old(len)=10, array={42:0}, array={42:0}, i=1, j=-1, len=10, p={0:0}] [L1450] COND FALSE !(j>=0) VAL [\old(len)=10, array={42:0}, array={42:0}, i=1, j=-1, len=10, p={0:0}] [L1454] RET return - -3; VAL [\old(len)=10, \result=3, array={42:0}, array={42:0}, i=1, j=-1, len=10, p={0:0}] [L1472] alloc_unsafe_17(array, len) VAL [alloc_unsafe_17(array, len)=3, array={42:0}, i=10, len=10] [L1473] CALL free_17(array, len) VAL [\old(len)=10, array={42:0}] [L1458] int i; [L1459] i=0 VAL [\old(len)=10, array={42:0}, array={42:0}, i=0, len=10] [L1459] COND TRUE i