java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:37:40,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:37:40,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:37:40,429 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:37:40,429 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:37:40,430 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:37:40,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:37:40,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:37:40,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:37:40,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:37:40,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:37:40,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:37:40,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:37:40,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:37:40,438 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:37:40,440 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:37:40,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:37:40,442 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:37:40,443 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:37:40,444 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:37:40,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:37:40,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:37:40,446 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:37:40,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:37:40,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:37:40,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:37:40,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:37:40,450 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:37:40,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:37:40,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:37:40,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:37:40,451 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:37:40,460 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:37:40,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:37:40,462 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:37:40,462 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:37:40,462 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:37:40,462 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:37:40,462 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:37:40,463 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:37:40,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:37:40,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:37:40,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:37:40,463 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:37:40,463 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:37:40,464 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:37:40,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:37:40,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:37:40,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:37:40,464 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:37:40,464 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:37:40,464 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:37:40,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:37:40,465 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:37:40,465 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:37:40,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:37:40,506 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:37:40,509 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:37:40,511 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:37:40,512 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:37:40,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-02 20:37:40,668 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:37:40,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:37:40,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:37:40,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:37:40,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:37:40,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40, skipping insertion in model container [2018-02-02 20:37:40,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,695 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:37:40,733 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:37:40,814 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:37:40,827 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:37:40,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40 WrapperNode [2018-02-02 20:37:40,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:37:40,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:37:40,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:37:40,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:37:40,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (1/1) ... [2018-02-02 20:37:40,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:37:40,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:37:40,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:37:40,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:37:40,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (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 20:37:40,900 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:37:40,900 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:37:40,901 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 20:37:40,901 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 20:37:40,901 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 20:37:40,901 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 20:37:40,901 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:37:40,901 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:37:40,902 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 20:37:40,903 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 20:37:40,903 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 20:37:40,903 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 20:37:40,903 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:37:40,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:37:40,903 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:37:41,143 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:37:41,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:37:41 BoogieIcfgContainer [2018-02-02 20:37:41,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:37:41,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:37:41,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:37:41,146 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:37:41,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:37:40" (1/3) ... [2018-02-02 20:37:41,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:37:41, skipping insertion in model container [2018-02-02 20:37:41,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:40" (2/3) ... [2018-02-02 20:37:41,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:37:41, skipping insertion in model container [2018-02-02 20:37:41,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:37:41" (3/3) ... [2018-02-02 20:37:41,148 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-02 20:37:41,154 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:37:41,159 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 20:37:41,186 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:37:41,186 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:37:41,186 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:37:41,187 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:37:41,187 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:37:41,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:37:41,187 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:37:41,187 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:37:41,188 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:37:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 20:37:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:37:41,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:41,210 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 20:37:41,210 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:41,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-02 20:37:41,269 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:41,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:41,432 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 20:37:41,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:41,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:37:41,435 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:41,435 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 20:37:41,435 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 81#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 82#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 83#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset)), 79#true] [2018-02-02 20:37:41,435 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 20:37:41,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:41,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:41,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:41,508 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-02 20:37:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:41,544 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-02 20:37:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:41,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 20:37:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:41,555 INFO L225 Difference]: With dead ends: 82 [2018-02-02 20:37:41,555 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 20:37:41,556 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 20:37:41,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 20:37:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 20:37:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 20:37:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 20:37:41,600 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-02 20:37:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:41,600 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 20:37:41,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 20:37:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:37:41,602 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:41,602 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 20:37:41,602 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:41,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-02 20:37:41,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:41,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:41,645 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 20:37:41,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:41,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:37:41,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:41,646 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 20:37:41,646 INFO L182 omatonBuilderFactory]: Interpolants [243#true, 244#false, 245#(= |#valid| |old(#valid)|)] [2018-02-02 20:37:41,646 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 20:37:41,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:37:41,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:37:41,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:37:41,649 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-02 20:37:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:41,746 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 20:37:41,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:37:41,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 20:37:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:41,748 INFO L225 Difference]: With dead ends: 112 [2018-02-02 20:37:41,749 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 20:37:41,749 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 20:37:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 20:37:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-02 20:37:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 20:37:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-02 20:37:41,756 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-02 20:37:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:41,757 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-02 20:37:41,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:37:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-02 20:37:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:37:41,758 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:41,758 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 20:37:41,758 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:41,758 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-02 20:37:41,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:41,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:41,810 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 20:37:41,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:41,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:37:41,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:41,811 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 20:37:41,811 INFO L182 omatonBuilderFactory]: Interpolants [433#true, 434#false, 435#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 436#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 437#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 438#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:37:41,811 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 20:37:41,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:41,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:41,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:41,812 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-02 20:37:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:41,884 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-02 20:37:41,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:37:41,885 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 20:37:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:41,885 INFO L225 Difference]: With dead ends: 76 [2018-02-02 20:37:41,886 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 20:37:41,886 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 20:37:41,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 20:37:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-02 20:37:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 20:37:41,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 20:37:41,890 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-02 20:37:41,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:41,890 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 20:37:41,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:41,890 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 20:37:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:37:41,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:41,891 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 20:37:41,891 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:41,891 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-02 20:37:41,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:41,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:42,069 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 20:37:42,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:42,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:37:42,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:42,070 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 20:37:42,070 INFO L182 omatonBuilderFactory]: Interpolants [592#false, 593#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 594#(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))), 595#(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|)), 596#(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|))), 597#(and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 598#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 599#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 591#true] [2018-02-02 20:37:42,070 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 20:37:42,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:37:42,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:37:42,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:37:42,071 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-02 20:37:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:42,260 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 20:37:42,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:37:42,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 20:37:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:42,262 INFO L225 Difference]: With dead ends: 80 [2018-02-02 20:37:42,262 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 20:37:42,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:37:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 20:37:42,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-02 20:37:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 20:37:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-02 20:37:42,265 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-02 20:37:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:42,265 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-02 20:37:42,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:37:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-02 20:37:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:37:42,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:42,266 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 20:37:42,266 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-02 20:37:42,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:42,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:42,308 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 20:37:42,308 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:42,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:37:42,308 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:42,309 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 20:37:42,309 INFO L182 omatonBuilderFactory]: Interpolants [768#false, 769#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 770#(not (= 0 |ldv_malloc_#res.base|)), 771#(not (= 0 |entry_point_#t~ret10.base|)), 772#(not (= 0 entry_point_~array~0.base)), 767#true] [2018-02-02 20:37:42,309 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 20:37:42,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:42,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:42,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:42,310 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-02 20:37:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:42,336 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-02 20:37:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:37:42,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 20:37:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:42,337 INFO L225 Difference]: With dead ends: 77 [2018-02-02 20:37:42,337 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 20:37:42,337 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 20:37:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 20:37:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 20:37:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 20:37:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 20:37:42,342 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-02 20:37:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:42,342 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 20:37:42,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 20:37:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:37:42,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:42,343 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 20:37:42,343 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-02 20:37:42,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:42,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:42,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:42,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:37:42,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:42,545 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 20:37:42,546 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 932#(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))), 933#(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)), 934#(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|)))), 935#(or (and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 936#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 937#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~2 0)), 938#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 939#(and (<= (+ (* 4 entry_point_~i~2) 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-02 20:37:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:42,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:37:42,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:37:42,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:42,546 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 11 states. [2018-02-02 20:37:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:42,836 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-02 20:37:42,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:37:42,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 20:37:42,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:42,837 INFO L225 Difference]: With dead ends: 83 [2018-02-02 20:37:42,837 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 20:37:42,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:37:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 20:37:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 20:37:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 20:37:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 20:37:42,841 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2018-02-02 20:37:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:42,842 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 20:37:42,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:37:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 20:37:42,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:37:42,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:42,842 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:42,842 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:42,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-02 20:37:42,843 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:42,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:43,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:37:43,054 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,054 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 20:37:43,055 INFO L182 omatonBuilderFactory]: Interpolants [1120#(<= entry_point_~len~0 10), 1121#(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))), 1122#(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)), 1123#(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|)))), 1124#(or (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 1125#(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))), 1126#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1127#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1128#(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)), 1129#(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))), 1130#(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))), 1118#true, 1119#false] [2018-02-02 20:37:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:43,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:37:43,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:37:43,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:43,055 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 13 states. [2018-02-02 20:37:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,253 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 20:37:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:37:43,253 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 20:37:43,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,254 INFO L225 Difference]: With dead ends: 80 [2018-02-02 20:37:43,254 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 20:37:43,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:37:43,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 20:37:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-02-02 20:37:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 20:37:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-02 20:37:43,258 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 27 [2018-02-02 20:37:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,259 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-02 20:37:43,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:37:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-02 20:37:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:37:43,259 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,259 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:43,263 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:43,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1676632482, now seen corresponding path program 1 times [2018-02-02 20:37:43,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:37:43,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:43,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:37:43,312 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,313 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 20:37:43,313 INFO L182 omatonBuilderFactory]: Interpolants [1300#true, 1301#false, 1302#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1303#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1304#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 20:37:43,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:37:43,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:43,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:43,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:43,314 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2018-02-02 20:37:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,329 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 20:37:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:43,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 20:37:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,331 INFO L225 Difference]: With dead ends: 79 [2018-02-02 20:37:43,331 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 20:37:43,331 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 20:37:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 20:37:43,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 20:37:43,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 20:37:43,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 20:37:43,336 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-02-02 20:37:43,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,336 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 20:37:43,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:43,336 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 20:37:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:37:43,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,337 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:43,337 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987476, now seen corresponding path program 1 times [2018-02-02 20:37:43,338 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,378 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 20:37:43,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:43,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:37:43,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,379 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 20:37:43,379 INFO L182 omatonBuilderFactory]: Interpolants [1461#true, 1462#false, 1463#(= 1 (select |#valid| entry_point_~array~0.base)), 1464#(= |#valid| |old(#valid)|), 1465#(= 1 (select |#valid| |free_17_#in~array.base|)), 1466#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:37:43,380 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 20:37:43,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:43,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:43,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:43,380 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 6 states. [2018-02-02 20:37:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,468 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-02 20:37:43,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:43,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 20:37:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,469 INFO L225 Difference]: With dead ends: 120 [2018-02-02 20:37:43,469 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:37:43,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:37:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:37:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-02-02 20:37:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 20:37:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-02-02 20:37:43,475 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 35 [2018-02-02 20:37:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,475 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-02-02 20:37:43,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-02-02 20:37:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:37:43,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,476 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:43,476 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:43,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987475, now seen corresponding path program 1 times [2018-02-02 20:37:43,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,505 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 20:37:43,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:37:43,506 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,506 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 20:37:43,506 INFO L182 omatonBuilderFactory]: Interpolants [1696#false, 1697#(<= 10 entry_point_~len~0), 1698#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1699#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1695#true] [2018-02-02 20:37:43,506 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 20:37:43,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:43,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:43,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:43,507 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 5 states. [2018-02-02 20:37:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,527 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-02-02 20:37:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:43,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 20:37:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,528 INFO L225 Difference]: With dead ends: 108 [2018-02-02 20:37:43,528 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 20:37:43,529 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 20:37:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 20:37:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-02 20:37:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 20:37:43,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-02 20:37:43,534 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 35 [2018-02-02 20:37:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,534 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-02 20:37:43,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:43,535 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-02 20:37:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 20:37:43,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,536 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:43,536 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:43,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 2 times [2018-02-02 20:37:43,537 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,603 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 20:37:43,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:37:43,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,604 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 20:37:43,605 INFO L182 omatonBuilderFactory]: Interpolants [1920#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1921#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1916#true, 1917#false, 1918#(<= 10 entry_point_~len~0), 1919#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0))] [2018-02-02 20:37:43,605 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 20:37:43,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:43,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:43,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:43,606 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 6 states. [2018-02-02 20:37:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,647 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-02 20:37:43,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:37:43,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 20:37:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,649 INFO L225 Difference]: With dead ends: 112 [2018-02-02 20:37:43,649 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 20:37:43,649 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 20:37:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 20:37:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-02 20:37:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 20:37:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-02 20:37:43,654 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-02 20:37:43,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,654 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-02 20:37:43,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:43,655 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-02 20:37:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:37:43,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,656 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:43,656 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 3 times [2018-02-02 20:37:43,657 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,703 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 20:37:43,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:37:43,703 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,703 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 20:37:43,704 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(<= 10 entry_point_~len~0), 2151#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2152#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2153#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2154#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-02 20:37:43,704 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 20:37:43,704 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:43,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:43,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:43,704 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 7 states. [2018-02-02 20:37:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,752 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2018-02-02 20:37:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:37:43,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 20:37:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,753 INFO L225 Difference]: With dead ends: 116 [2018-02-02 20:37:43,753 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 20:37:43,753 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 20:37:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 20:37:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 20:37:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 20:37:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-02 20:37:43,756 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 43 [2018-02-02 20:37:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,756 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-02 20:37:43,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-02 20:37:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:37:43,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,757 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:43,757 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1950591474, now seen corresponding path program 4 times [2018-02-02 20:37:43,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,817 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 20:37:43,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:37:43,817 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,817 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 20:37:43,817 INFO L182 omatonBuilderFactory]: Interpolants [2391#true, 2392#false, 2393#(<= 10 entry_point_~len~0), 2394#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2395#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2396#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2397#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2398#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 20:37:43,817 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 20:37:43,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:37:43,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:37:43,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:43,818 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 8 states. [2018-02-02 20:37:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,870 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-02-02 20:37:43,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:43,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 20:37:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,871 INFO L225 Difference]: With dead ends: 120 [2018-02-02 20:37:43,871 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 20:37:43,871 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 20:37:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 20:37:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 20:37:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 20:37:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-02-02 20:37:43,874 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 47 [2018-02-02 20:37:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,875 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-02-02 20:37:43,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:37:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-02-02 20:37:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:37:43,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,876 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:43,876 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash -281679991, now seen corresponding path program 5 times [2018-02-02 20:37:43,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,931 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 20:37:43,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,932 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:37:43,932 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,932 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 20:37:43,932 INFO L182 omatonBuilderFactory]: Interpolants [2645#true, 2646#false, 2647#(<= 10 entry_point_~len~0), 2648#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2649#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2650#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2651#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2652#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2653#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-02 20:37:43,932 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 20:37:43,932 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:37:43,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:37:43,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:37:43,933 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 9 states. [2018-02-02 20:37:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,998 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-02-02 20:37:43,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:37:43,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-02 20:37:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:44,000 INFO L225 Difference]: With dead ends: 124 [2018-02-02 20:37:44,000 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 20:37:44,000 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 20:37:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 20:37:44,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 20:37:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 20:37:44,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2018-02-02 20:37:44,004 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 51 [2018-02-02 20:37:44,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:44,005 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2018-02-02 20:37:44,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:37:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2018-02-02 20:37:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 20:37:44,006 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:44,006 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:44,006 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash 85033376, now seen corresponding path program 6 times [2018-02-02 20:37:44,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:44,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:44,063 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 20:37:44,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:44,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:37:44,063 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:44,064 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 20:37:44,064 INFO L182 omatonBuilderFactory]: Interpolants [2912#(<= 10 entry_point_~len~0), 2913#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2914#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2915#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2916#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2917#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2918#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2919#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2910#true, 2911#false] [2018-02-02 20:37:44,064 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 20:37:44,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:37:44,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:37:44,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:37:44,064 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand 10 states. [2018-02-02 20:37:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:44,132 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-02-02 20:37:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:37:44,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 20:37:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:44,133 INFO L225 Difference]: With dead ends: 128 [2018-02-02 20:37:44,133 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 20:37:44,133 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 20:37:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 20:37:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-02-02 20:37:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:37:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2018-02-02 20:37:44,136 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 55 [2018-02-02 20:37:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:44,137 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2018-02-02 20:37:44,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:37:44,137 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-02-02 20:37:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 20:37:44,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:44,138 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:44,138 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:44,138 INFO L82 PathProgramCache]: Analyzing trace with hash 819214391, now seen corresponding path program 7 times [2018-02-02 20:37:44,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:44,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:44,229 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 20:37:44,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:44,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:37:44,230 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:44,230 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 20:37:44,231 INFO L182 omatonBuilderFactory]: Interpolants [3186#true, 3187#false, 3188#(<= 10 entry_point_~len~0), 3189#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3190#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3191#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3192#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3193#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3194#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3195#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3196#(<= (+ entry_point_~i~2 3) entry_point_~len~0)] [2018-02-02 20:37:44,231 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 20:37:44,231 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:37:44,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:37:44,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:44,231 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 11 states. [2018-02-02 20:37:44,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:44,346 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-02-02 20:37:44,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:37:44,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-02 20:37:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:44,347 INFO L225 Difference]: With dead ends: 132 [2018-02-02 20:37:44,347 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 20:37:44,348 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 20:37:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 20:37:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-02 20:37:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 20:37:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2018-02-02 20:37:44,351 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 59 [2018-02-02 20:37:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:44,351 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2018-02-02 20:37:44,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:37:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2018-02-02 20:37:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 20:37:44,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:44,352 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:44,352 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1197749426, now seen corresponding path program 8 times [2018-02-02 20:37:44,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:44,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:44,474 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 20:37:44,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:44,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:37:44,474 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:44,475 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 20:37:44,475 INFO L182 omatonBuilderFactory]: Interpolants [3473#true, 3474#false, 3475#(<= 10 entry_point_~len~0), 3476#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3477#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3478#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3479#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3480#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3481#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3482#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3483#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3484#(<= (+ entry_point_~i~2 2) entry_point_~len~0)] [2018-02-02 20:37:44,475 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 20:37:44,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:37:44,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:37:44,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:37:44,476 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 12 states. [2018-02-02 20:37:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:44,592 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-02-02 20:37:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:37:44,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 20:37:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:44,594 INFO L225 Difference]: With dead ends: 136 [2018-02-02 20:37:44,594 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 20:37:44,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:37:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 20:37:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-02-02 20:37:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 20:37:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2018-02-02 20:37:44,597 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 63 [2018-02-02 20:37:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:44,598 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2018-02-02 20:37:44,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:37:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2018-02-02 20:37:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:37:44,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:44,598 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, 1, 1, 1, 1, 1] [2018-02-02 20:37:44,598 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash 497416933, now seen corresponding path program 9 times [2018-02-02 20:37:44,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:44,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:44,708 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 20:37:44,708 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:44,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:37:44,708 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:44,708 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 20:37:44,708 INFO L182 omatonBuilderFactory]: Interpolants [3776#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3777#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3778#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3779#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3780#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3781#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3782#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3783#(<= (+ entry_point_~i~2 1) entry_point_~len~0), 3771#true, 3772#false, 3773#(<= 10 entry_point_~len~0), 3774#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3775#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 20:37:44,709 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 20:37:44,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:37:44,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:37:44,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:44,709 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 13 states. [2018-02-02 20:37:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:44,808 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-02-02 20:37:44,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:37:44,811 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-02-02 20:37:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:44,812 INFO L225 Difference]: With dead ends: 138 [2018-02-02 20:37:44,812 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 20:37:44,812 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 20:37:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 20:37:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 20:37:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 20:37:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2018-02-02 20:37:44,816 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 67 [2018-02-02 20:37:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:44,816 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2018-02-02 20:37:44,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:37:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2018-02-02 20:37:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 20:37:44,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:44,817 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] [2018-02-02 20:37:44,817 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1940879620, now seen corresponding path program 10 times [2018-02-02 20:37:44,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:44,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:44,891 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 20:37:44,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:44,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:37:44,892 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:44,892 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 20:37:44,892 INFO L182 omatonBuilderFactory]: Interpolants [4080#(<= 10 entry_point_~len~0), 4081#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 4082#(<= |alloc_17_#in~len| 0), 4078#true, 4079#false] [2018-02-02 20:37:44,892 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 20:37:44,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:44,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:44,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:44,893 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand 5 states. [2018-02-02 20:37:44,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:44,916 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-02 20:37:44,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:44,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-02-02 20:37:44,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:44,917 INFO L225 Difference]: With dead ends: 163 [2018-02-02 20:37:44,917 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 20:37:44,917 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 20:37:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 20:37:44,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2018-02-02 20:37:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 20:37:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-02-02 20:37:44,921 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 71 [2018-02-02 20:37:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:44,921 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-02-02 20:37:44,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-02-02 20:37:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:37:44,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:44,922 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 20:37:44,922 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 114739281, now seen corresponding path program 1 times [2018-02-02 20:37:44,923 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:44,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:45,246 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 20:37:45,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:45,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:37:45,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:45,246 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 20:37:45,247 INFO L182 omatonBuilderFactory]: Interpolants [4385#true, 4386#false, 4387#(<= 10 entry_point_~len~0), 4388#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4389#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4390#(and (<= 10 entry_point_~len~0) (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 4391#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4392#(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)), 4393#(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)), 4394#(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)), 4395#(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)), 4396#(and (<= 36 (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 4397#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base))), 4398#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 4399#(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|))), 4400#(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|))))), 4401#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base)))] [2018-02-02 20:37:45,247 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 20:37:45,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:37:45,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:37:45,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:37:45,247 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand 17 states. [2018-02-02 20:37:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:45,822 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2018-02-02 20:37:45,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:37:45,822 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 20:37:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:45,823 INFO L225 Difference]: With dead ends: 207 [2018-02-02 20:37:45,823 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 20:37:45,823 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 20:37:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 20:37:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 151. [2018-02-02 20:37:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-02-02 20:37:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2018-02-02 20:37:45,826 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 72 [2018-02-02 20:37:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:45,827 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2018-02-02 20:37:45,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:37:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2018-02-02 20:37:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:37:45,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:45,827 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 20:37:45,827 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash 114739280, now seen corresponding path program 1 times [2018-02-02 20:37:45,828 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:45,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:37:45,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:45,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:37:45,939 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:45,939 INFO L182 omatonBuilderFactory]: Interpolants [4786#true, 4787#false, 4788#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4789#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4790#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 4791#(= 1 (select |#valid| entry_point_~array~0.base)), 4792#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 4793#(= 1 (select |#valid| alloc_17_~array.base)), 4794#(= |#valid| |old(#valid)|), 4795#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 4796#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 20:37:45,939 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 20:37:45,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:37:45,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:37:45,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:45,940 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 11 states. [2018-02-02 20:37:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:46,164 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2018-02-02 20:37:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:37:46,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-02 20:37:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:46,165 INFO L225 Difference]: With dead ends: 193 [2018-02-02 20:37:46,165 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 20:37:46,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:37:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 20:37:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 146. [2018-02-02 20:37:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-02-02 20:37:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2018-02-02 20:37:46,170 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 72 [2018-02-02 20:37:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:46,171 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2018-02-02 20:37:46,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:37:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2018-02-02 20:37:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:37:46,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:46,172 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] [2018-02-02 20:37:46,172 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:46,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1497729290, now seen corresponding path program 1 times [2018-02-02 20:37:46,173 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:46,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:46,213 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 20:37:46,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:46,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:37:46,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:46,214 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 20:37:46,214 INFO L182 omatonBuilderFactory]: Interpolants [5152#(= alloc_17_~i~0 0), 5153#(<= (+ alloc_17_~j~0 1) 0), 5150#true, 5151#false] [2018-02-02 20:37:46,214 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 20:37:46,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:37:46,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:37:46,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:37:46,215 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand 4 states. [2018-02-02 20:37:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:46,253 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-02 20:37:46,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:46,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 20:37:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:46,256 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:37:46,256 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 20:37:46,257 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 20:37:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 20:37:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-02-02 20:37:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 20:37:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions. [2018-02-02 20:37:46,261 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 73 [2018-02-02 20:37:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:46,261 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 166 transitions. [2018-02-02 20:37:46,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:37:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions. [2018-02-02 20:37:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:37:46,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:46,262 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 20:37:46,262 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash 950466152, now seen corresponding path program 1 times [2018-02-02 20:37:46,263 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:46,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:46,421 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 20:37:46,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:46,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:37:46,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:46,422 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 20:37:46,422 INFO L182 omatonBuilderFactory]: Interpolants [5472#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 5460#true, 5461#false, 5462#(= 0 |ldv_malloc_#t~malloc1.offset|), 5463#(= 0 |ldv_malloc_#res.offset|), 5464#(= 0 |entry_point_#t~ret10.offset|), 5465#(= entry_point_~array~0.offset 0), 5466#(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)), 5467#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5468#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5469#(= |old(#length)| |#length|), 5470#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 5471#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 20:37:46,422 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 20:37:46,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:37:46,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:37:46,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:46,423 INFO L87 Difference]: Start difference. First operand 149 states and 166 transitions. Second operand 13 states. [2018-02-02 20:37:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:46,610 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-02-02 20:37:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:37:46,611 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-02 20:37:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:46,611 INFO L225 Difference]: With dead ends: 169 [2018-02-02 20:37:46,611 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 20:37:46,612 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 20:37:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 20:37:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2018-02-02 20:37:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-02-02 20:37:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-02-02 20:37:46,615 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 81 [2018-02-02 20:37:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:46,615 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-02-02 20:37:46,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:37:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-02-02 20:37:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:37:46,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:46,616 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 20:37:46,616 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:46,616 INFO L82 PathProgramCache]: Analyzing trace with hash -600320339, now seen corresponding path program 1 times [2018-02-02 20:37:46,617 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:46,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:47,454 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 20:37:47,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:47,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:37:47,455 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:47,455 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 20:37:47,456 INFO L182 omatonBuilderFactory]: Interpolants [5824#(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))), 5825#(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)))), 5826#(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)))), 5827#(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))), 5828#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 5829#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 5830#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 5831#(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))))), 5832#(= 0 |free_17_#t~mem9.offset|), 5809#true, 5810#false, 5811#(<= entry_point_~len~0 10), 5812#(= 0 |ldv_malloc_#t~malloc1.offset|), 5813#(= 0 |ldv_malloc_#res.offset|), 5814#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 5815#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 5816#(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))), 5817#(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))))))), 5818#(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)))), 5819#(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)))), 5820#(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))), 5821#(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)))), 5822#(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))), 5823#(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))))] [2018-02-02 20:37:47,456 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 20:37:47,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:37:47,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:37:47,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:37:47,456 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 24 states. [2018-02-02 20:37:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:48,346 INFO L93 Difference]: Finished difference Result 192 states and 214 transitions. [2018-02-02 20:37:48,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:37:48,347 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 20:37:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:48,348 INFO L225 Difference]: With dead ends: 192 [2018-02-02 20:37:48,348 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 20:37:48,349 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 20:37:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 20:37:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 176. [2018-02-02 20:37:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:37:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2018-02-02 20:37:48,354 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 82 [2018-02-02 20:37:48,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:48,354 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2018-02-02 20:37:48,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:37:48,355 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2018-02-02 20:37:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:37:48,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:48,356 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 20:37:48,356 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash -600320338, now seen corresponding path program 1 times [2018-02-02 20:37:48,358 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:48,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:49,341 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 20:37:49,342 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:49,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:37:49,342 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:49,342 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 20:37:49,342 INFO L182 omatonBuilderFactory]: Interpolants [6246#true, 6247#false, 6248#(<= entry_point_~len~0 10), 6249#(= 0 |ldv_malloc_#t~malloc1.offset|), 6250#(= 0 |ldv_malloc_#res.offset|), 6251#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 6252#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 6253#(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))), 6254#(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)))), 6255#(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)))), 6256#(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)))), 6257#(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))), 6258#(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)))), 6259#(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))), 6260#(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)))), 6261#(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)))), 6262#(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)))), 6263#(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)))), 6264#(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))), 6265#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 6266#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 6267#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 6268#(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)), 6269#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:37:49,342 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 20:37:49,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:37:49,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:37:49,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:37:49,343 INFO L87 Difference]: Start difference. First operand 176 states and 205 transitions. Second operand 24 states. [2018-02-02 20:37:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:50,069 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2018-02-02 20:37:50,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:37:50,070 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 20:37:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:50,071 INFO L225 Difference]: With dead ends: 191 [2018-02-02 20:37:50,071 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 20:37:50,071 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 20:37:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 20:37:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-02-02 20:37:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:37:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2018-02-02 20:37:50,076 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 82 [2018-02-02 20:37:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:50,076 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2018-02-02 20:37:50,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:37:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2018-02-02 20:37:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:37:50,077 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:50,077 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 20:37:50,077 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1232614021, now seen corresponding path program 1 times [2018-02-02 20:37:50,078 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:50,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:50,132 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 20:37:50,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:50,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:37:50,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:50,133 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 20:37:50,133 INFO L182 omatonBuilderFactory]: Interpolants [6678#true, 6679#false, 6680#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 6681#(not (= 0 |ldv_malloc_#res.base|)), 6682#(not (= 0 |alloc_17_#t~ret3.base|)), 6683#(not (= 0 alloc_17_~p~0.base))] [2018-02-02 20:37:50,133 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 20:37:50,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:50,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:50,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:50,134 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand 6 states. [2018-02-02 20:37:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:50,169 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2018-02-02 20:37:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:37:50,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-02 20:37:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:50,169 INFO L225 Difference]: With dead ends: 155 [2018-02-02 20:37:50,169 INFO L226 Difference]: Without dead ends: 155 [2018-02-02 20:37:50,170 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 20:37:50,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-02-02 20:37:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-02-02 20:37:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 20:37:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-02-02 20:37:50,174 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 83 [2018-02-02 20:37:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:50,174 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-02-02 20:37:50,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-02-02 20:37:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:37:50,175 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:50,175 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, 1, 1, 1, 1] [2018-02-02 20:37:50,175 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1239415694, now seen corresponding path program 1 times [2018-02-02 20:37:50,176 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:50,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:50,228 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 20:37:50,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:50,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:37:50,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:50,229 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 20:37:50,229 INFO L182 omatonBuilderFactory]: Interpolants [6996#true, 6997#false, 6998#(= alloc_17_~array.base |alloc_17_#in~array.base|), 6999#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 7000#(= 1 (select |#valid| entry_point_~array~0.base)), 7001#(= 1 (select |#valid| |free_17_#in~array.base|)), 7002#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:37:50,229 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 20:37:50,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:50,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:50,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:50,230 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 7 states. [2018-02-02 20:37:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:50,340 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2018-02-02 20:37:50,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:37:50,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-02-02 20:37:50,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:50,342 INFO L225 Difference]: With dead ends: 171 [2018-02-02 20:37:50,343 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 20:37:50,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:37:50,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 20:37:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2018-02-02 20:37:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 20:37:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-02-02 20:37:50,348 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 84 [2018-02-02 20:37:50,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:50,349 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-02-02 20:37:50,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-02-02 20:37:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:37:50,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:50,349 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, 1, 1, 1, 1] [2018-02-02 20:37:50,350 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:50,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1239415693, now seen corresponding path program 1 times [2018-02-02 20:37:50,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:50,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:50,411 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 20:37:50,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:50,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:37:50,412 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:50,412 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 20:37:50,412 INFO L182 omatonBuilderFactory]: Interpolants [7337#true, 7338#false, 7339#(<= 10 entry_point_~len~0), 7340#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 7341#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 7342#(<= |alloc_17_#in~len| 1)] [2018-02-02 20:37:50,412 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 20:37:50,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:50,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:50,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:50,413 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 6 states. [2018-02-02 20:37:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:50,450 INFO L93 Difference]: Finished difference Result 194 states and 216 transitions. [2018-02-02 20:37:50,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:37:50,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-02-02 20:37:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:50,452 INFO L225 Difference]: With dead ends: 194 [2018-02-02 20:37:50,452 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 20:37:50,452 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 20:37:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 20:37:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 162. [2018-02-02 20:37:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-02-02 20:37:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 180 transitions. [2018-02-02 20:37:50,456 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 180 transitions. Word has length 84 [2018-02-02 20:37:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:50,456 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 180 transitions. [2018-02-02 20:37:50,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 180 transitions. [2018-02-02 20:37:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:37:50,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:50,457 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 20:37:50,457 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 385284538, now seen corresponding path program 1 times [2018-02-02 20:37:50,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:50,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:50,782 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 20:37:50,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:50,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:37:50,783 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:50,783 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 20:37:50,783 INFO L182 omatonBuilderFactory]: Interpolants [7712#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7713#(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|))), 7714#(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|))))), 7715#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7716#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (<= 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= alloc_17_~array.offset 0)), 7717#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7718#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7719#(and (<= 4 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (<= (+ (* 4 alloc_17_~i~0) 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7701#true, 7702#false, 7703#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 7704#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7705#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 7706#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7707#(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)), 7708#(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)), 7709#(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)), 7710#(and (<= (* 4 |alloc_17_#in~len|) (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 7711#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0))] [2018-02-02 20:37:50,784 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 20:37:50,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:37:50,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:37:50,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:37:50,784 INFO L87 Difference]: Start difference. First operand 162 states and 180 transitions. Second operand 19 states. [2018-02-02 20:37:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:51,365 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2018-02-02 20:37:51,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:37:51,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-02 20:37:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:51,366 INFO L225 Difference]: With dead ends: 200 [2018-02-02 20:37:51,366 INFO L226 Difference]: Without dead ends: 200 [2018-02-02 20:37:51,366 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 20:37:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-02-02 20:37:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 161. [2018-02-02 20:37:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-02-02 20:37:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 179 transitions. [2018-02-02 20:37:51,369 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 179 transitions. Word has length 85 [2018-02-02 20:37:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:51,370 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 179 transitions. [2018-02-02 20:37:51,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:37:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 179 transitions. [2018-02-02 20:37:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:37:51,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:51,370 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 20:37:51,370 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:51,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1700760915, now seen corresponding path program 1 times [2018-02-02 20:37:51,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:51,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:51,500 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 20:37:51,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:51,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:37:51,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:51,500 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 20:37:51,500 INFO L182 omatonBuilderFactory]: Interpolants [8113#true, 8114#false, 8115#(= 0 |ldv_malloc_#t~malloc1.offset|), 8116#(= 0 |ldv_malloc_#res.offset|), 8117#(= 0 |entry_point_#t~ret10.offset|), 8118#(= 0 entry_point_~array~0.offset), 8119#(= 0 |alloc_17_#in~array.offset|), 8120#(= alloc_17_~array.offset 0), 8121#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8122#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8123#(= |old(#length)| |#length|), 8124#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8125#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (<= 0 alloc_17_~j~0) (= alloc_17_~array.offset 0))] [2018-02-02 20:37:51,500 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 20:37:51,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:37:51,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:37:51,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:51,501 INFO L87 Difference]: Start difference. First operand 161 states and 179 transitions. Second operand 13 states. [2018-02-02 20:37:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:51,668 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2018-02-02 20:37:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:37:51,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-02 20:37:51,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:51,669 INFO L225 Difference]: With dead ends: 161 [2018-02-02 20:37:51,669 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 20:37:51,670 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 20:37:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 20:37:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-02-02 20:37:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 20:37:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2018-02-02 20:37:51,673 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 86 [2018-02-02 20:37:51,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:51,673 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2018-02-02 20:37:51,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:37:51,674 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2018-02-02 20:37:51,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:37:51,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:51,674 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 20:37:51,675 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1741617760, now seen corresponding path program 1 times [2018-02-02 20:37:51,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:51,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:51,735 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 20:37:51,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:51,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:37:51,736 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:51,736 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 20:37:51,736 INFO L182 omatonBuilderFactory]: Interpolants [8465#true, 8466#false, 8467#(<= 10 entry_point_~len~0), 8468#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 8469#(<= |free_17_#in~len| 0)] [2018-02-02 20:37:51,736 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 20:37:51,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:51,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:51,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:51,737 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 5 states. [2018-02-02 20:37:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:51,760 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-02-02 20:37:51,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:51,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-02-02 20:37:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:51,761 INFO L225 Difference]: With dead ends: 168 [2018-02-02 20:37:51,761 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 20:37:51,761 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 20:37:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 20:37:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-02-02 20:37:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 20:37:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-02-02 20:37:51,764 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 86 [2018-02-02 20:37:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:51,765 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-02-02 20:37:51,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-02-02 20:37:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:37:51,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:51,765 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 20:37:51,765 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1183980822, now seen corresponding path program 1 times [2018-02-02 20:37:51,766 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:51,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:52,032 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 20:37:52,033 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:52,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:37:52,033 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:52,033 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 20:37:52,033 INFO L182 omatonBuilderFactory]: Interpolants [8800#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 8801#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 8802#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 8803#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 8804#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 8805#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 8806#(= 0 |alloc_17_#t~mem6.offset|), 8792#true, 8793#false, 8794#(= 0 |ldv_malloc_#t~malloc1.offset|), 8795#(= 0 |ldv_malloc_#res.offset|), 8796#(= 0 |entry_point_#t~ret10.offset|), 8797#(= 0 entry_point_~array~0.offset), 8798#(= 0 |alloc_17_#in~array.offset|), 8799#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0))] [2018-02-02 20:37:52,034 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 20:37:52,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:37:52,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:37:52,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:37:52,034 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 15 states. [2018-02-02 20:37:52,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:52,314 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2018-02-02 20:37:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:37:52,314 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 20:37:52,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:52,315 INFO L225 Difference]: With dead ends: 176 [2018-02-02 20:37:52,315 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:37:52,315 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 20:37:52,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:37:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2018-02-02 20:37:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:37:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-02-02 20:37:52,319 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 87 [2018-02-02 20:37:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:52,319 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-02-02 20:37:52,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:37:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-02-02 20:37:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:37:52,320 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:52,320 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 20:37:52,320 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1183980821, now seen corresponding path program 1 times [2018-02-02 20:37:52,321 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:52,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:52,638 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 20:37:52,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:52,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:37:52,640 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:52,640 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 20:37:52,640 INFO L182 omatonBuilderFactory]: Interpolants [9184#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 9185#(= |#valid| |old(#valid)|), 9186#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= alloc_17_~j~0 0)), 9187#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 9188#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 9171#true, 9172#false, 9173#(= 0 |ldv_malloc_#t~malloc1.offset|), 9174#(= 0 |ldv_malloc_#res.offset|), 9175#(= 0 |entry_point_#t~ret10.offset|), 9176#(= 0 entry_point_~array~0.offset), 9177#(= 0 |alloc_17_#in~array.offset|), 9178#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9179#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 9180#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 9181#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 9182#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 9183#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))))] [2018-02-02 20:37:52,641 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 20:37:52,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:37:52,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:37:52,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:37:52,641 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 18 states. [2018-02-02 20:37:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:53,004 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2018-02-02 20:37:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:37:53,004 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 20:37:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:53,005 INFO L225 Difference]: With dead ends: 176 [2018-02-02 20:37:53,005 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:37:53,006 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 20:37:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:37:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2018-02-02 20:37:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 20:37:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 188 transitions. [2018-02-02 20:37:53,009 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 188 transitions. Word has length 87 [2018-02-02 20:37:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:53,009 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 188 transitions. [2018-02-02 20:37:53,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:37:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 188 transitions. [2018-02-02 20:37:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:37:53,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:53,010 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 20:37:53,010 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:53,012 INFO L82 PathProgramCache]: Analyzing trace with hash -2053772611, now seen corresponding path program 1 times [2018-02-02 20:37:53,012 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:53,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:53,940 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 20:37:53,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:53,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:37:53,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:53,940 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 20:37:53,941 INFO L182 omatonBuilderFactory]: Interpolants [9558#true, 9559#false, 9560#(<= entry_point_~len~0 10), 9561#(= 0 |ldv_malloc_#t~malloc1.offset|), 9562#(= 0 |ldv_malloc_#res.offset|), 9563#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 9564#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9565#(and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 10)) (= 0 entry_point_~array~0.offset)), 9566#(and (= 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))) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2))))))), 9567#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 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)))), 9568#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (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))) (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 31)))), 9569#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 27)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 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)))), 9570#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (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)))), 9571#(and (= 0 entry_point_~array~0.offset) (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 19)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 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)))), 9572#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 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)))), 9573#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 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)))), 9574#(and (or (<= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset 7)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (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)))) (= 0 entry_point_~array~0.offset)), 9575#(and (= 0 entry_point_~array~0.offset) (or (and (= 1 (select |#valid| entry_point_~array~0.base)) (= 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 3)))), 9576#(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))), 9577#(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)), 9578#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9579#(= |#valid| |old(#valid)|), 9580#(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|))), 9581#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))) (= 1 (select |#valid| free_17_~array.base))), 9582#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 9583#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:37:53,941 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 20:37:53,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:37:53,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:37:53,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:37:53,941 INFO L87 Difference]: Start difference. First operand 167 states and 188 transitions. Second operand 26 states. [2018-02-02 20:37:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:54,873 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-02-02 20:37:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:37:54,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-02-02 20:37:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:54,874 INFO L225 Difference]: With dead ends: 191 [2018-02-02 20:37:54,874 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 20:37:54,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=1887, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:37:54,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 20:37:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175. [2018-02-02 20:37:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 20:37:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-02-02 20:37:54,876 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 87 [2018-02-02 20:37:54,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:54,877 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-02-02 20:37:54,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:37:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-02-02 20:37:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 20:37:54,877 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:54,877 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 20:37:54,877 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:54,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2053772610, now seen corresponding path program 1 times [2018-02-02 20:37:54,878 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:54,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:55,013 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 20:37:55,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:55,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:37:55,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:55,013 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 20:37:55,013 INFO L182 omatonBuilderFactory]: Interpolants [9994#true, 9995#false, 9996#(= 0 |ldv_malloc_#t~malloc1.offset|), 9997#(= 0 |ldv_malloc_#res.offset|), 9998#(= 0 |entry_point_#t~ret10.offset|), 9999#(= entry_point_~array~0.offset 0), 10000#(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)), 10001#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10002#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 10003#(= |old(#length)| |#length|), 10004#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 10005#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 10006#(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)), 10007#(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)), 10008#(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 20:37:55,014 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 20:37:55,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:37:55,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:37:55,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:37:55,014 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 15 states. [2018-02-02 20:37:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:55,225 INFO L93 Difference]: Finished difference Result 182 states and 200 transitions. [2018-02-02 20:37:55,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:37:55,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 20:37:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:55,226 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:37:55,226 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:37:55,226 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 20:37:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:37:55,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2018-02-02 20:37:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 20:37:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2018-02-02 20:37:55,228 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 87 [2018-02-02 20:37:55,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:55,228 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2018-02-02 20:37:55,228 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:37:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2018-02-02 20:37:55,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:37:55,229 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:55,229 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 20:37:55,229 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:55,229 INFO L82 PathProgramCache]: Analyzing trace with hash 757558551, now seen corresponding path program 1 times [2018-02-02 20:37:55,230 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:55,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:56,082 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 20:37:56,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:56,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:37:56,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:56,082 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 20:37:56,083 INFO L182 omatonBuilderFactory]: Interpolants [10380#true, 10381#false, 10382#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10383#(= 0 |ldv_malloc_#t~malloc1.offset|), 10384#(= 0 |ldv_malloc_#res.offset|), 10385#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10386#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10387#(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)), 10388#(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)), 10389#(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)), 10390#(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)), 10391#(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$.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)))))), 10392#(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)))))), 10393#(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)))))), 10394#(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)), 10395#(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))))))), 10396#(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))), 10397#(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)), 10398#(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))), 10399#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))), 10400#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10401#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 10402#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 10403#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10404#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 20:37:56,083 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 20:37:56,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:37:56,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:37:56,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:37:56,083 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand 25 states. [2018-02-02 20:37:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:58,330 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-02-02 20:37:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 20:37:58,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 20:37:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:58,331 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:37:58,331 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 20:37:58,331 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=610, Invalid=3550, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:37:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 20:37:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 176. [2018-02-02 20:37:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:37:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-02-02 20:37:58,333 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 88 [2018-02-02 20:37:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:58,333 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-02-02 20:37:58,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:37:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-02-02 20:37:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:37:58,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:58,334 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 20:37:58,334 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:37:58,334 INFO L82 PathProgramCache]: Analyzing trace with hash 757558552, now seen corresponding path program 1 times [2018-02-02 20:37:58,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:58,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:59,175 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 20:37:59,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:59,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:37:59,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:59,176 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 20:37:59,176 INFO L182 omatonBuilderFactory]: Interpolants [10848#true, 10849#false, 10850#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10851#(= 0 |ldv_malloc_#t~malloc1.offset|), 10852#(= 0 |ldv_malloc_#res.offset|), 10853#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10854#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10855#(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)), 10856#(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_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (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)), 10857#(and (= 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) 32)) entry_point_~array~0.offset))) (<= (+ (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)), 10858#(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) 28)) 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) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 10859#(and (<= (+ (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) (= 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) 24)) entry_point_~array~0.offset)))), 10860#(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) (= 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) 20)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 10861#(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) 16)) entry_point_~array~0.offset))) (<= (+ (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)), 10862#(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) (= 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_~array~0.offset 0)), 10863#(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_~len~0) (+ (* 4 entry_point_~i~2) 8)) entry_point_~array~0.offset)))), 10864#(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$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 4 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 10865#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 10866#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset))))), 10867#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 10868#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 10869#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 10870#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 10871#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10872#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:37:59,176 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 20:37:59,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:37:59,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:37:59,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:37:59,177 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand 25 states. [2018-02-02 20:38:01,265 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 111 DAG size of output 78 [2018-02-02 20:38:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:01,636 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2018-02-02 20:38:01,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:38:01,637 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 20:38:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:01,637 INFO L225 Difference]: With dead ends: 185 [2018-02-02 20:38:01,637 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 20:38:01,638 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=582, Invalid=3200, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:38:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 20:38:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2018-02-02 20:38:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:38:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2018-02-02 20:38:01,642 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 88 [2018-02-02 20:38:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:01,642 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2018-02-02 20:38:01,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2018-02-02 20:38:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:38:01,643 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:01,643 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] [2018-02-02 20:38:01,643 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:01,643 INFO L82 PathProgramCache]: Analyzing trace with hash 360764299, now seen corresponding path program 1 times [2018-02-02 20:38:01,644 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:01,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 20:38:02,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:02,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:38:02,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:02,009 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 20:38:02,009 INFO L182 omatonBuilderFactory]: Interpolants [11309#true, 11310#false, 11311#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 11312#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11313#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 11314#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 11315#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 11316#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 11317#(= |#valid| |old(#valid)|), 11318#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 11319#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11320#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 11321#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 11322#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 11323#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 11324#(and (= alloc_17_~array.offset 0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= 1 (select |#valid| alloc_17_~array.base)))) (<= alloc_17_~j~0 0)), 11325#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))), 11326#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 11327#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 20:38:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-02-02 20:38:02,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:38:02,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:38:02,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:38:02,010 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand 19 states. [2018-02-02 20:38:02,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:02,344 INFO L93 Difference]: Finished difference Result 187 states and 208 transitions. [2018-02-02 20:38:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:38:02,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-02 20:38:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:02,345 INFO L225 Difference]: With dead ends: 187 [2018-02-02 20:38:02,345 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 20:38:02,345 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:38:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 20:38:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2018-02-02 20:38:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:38:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2018-02-02 20:38:02,349 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 89 [2018-02-02 20:38:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:02,349 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2018-02-02 20:38:02,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:38:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2018-02-02 20:38:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 20:38:02,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:02,350 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 20:38:02,350 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:02,350 INFO L82 PathProgramCache]: Analyzing trace with hash -254194742, now seen corresponding path program 1 times [2018-02-02 20:38:02,351 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:02,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:02,405 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 20:38:02,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:02,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:38:02,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:02,405 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 20:38:02,406 INFO L182 omatonBuilderFactory]: Interpolants [11712#false, 11713#(<= 10 entry_point_~len~0), 11714#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 11715#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 11716#(<= |free_17_#in~len| 1), 11711#true] [2018-02-02 20:38:02,406 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 20:38:02,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:02,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:02,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:02,406 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand 6 states. [2018-02-02 20:38:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:02,443 INFO L93 Difference]: Finished difference Result 199 states and 219 transitions. [2018-02-02 20:38:02,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:02,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-02-02 20:38:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:02,444 INFO L225 Difference]: With dead ends: 199 [2018-02-02 20:38:02,444 INFO L226 Difference]: Without dead ends: 195 [2018-02-02 20:38:02,444 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 20:38:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-02 20:38:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 181. [2018-02-02 20:38:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-02 20:38:02,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-02-02 20:38:02,448 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 92 [2018-02-02 20:38:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:02,448 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-02-02 20:38:02,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:02,449 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-02-02 20:38:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:02,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:02,449 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 20:38:02,450 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1924314338, now seen corresponding path program 1 times [2018-02-02 20:38:02,450 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:02,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:02,514 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 20:38:02,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:02,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:38:02,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:02,515 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 20:38:02,515 INFO L182 omatonBuilderFactory]: Interpolants [12099#true, 12100#false, 12101#(= alloc_17_~array.base |alloc_17_#in~array.base|), 12102#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 12103#(= |#valid| |old(#valid)|), 12104#(= 1 (select |#valid| entry_point_~array~0.base)), 12105#(= 1 (select |#valid| |free_17_#in~array.base|)), 12106#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:38:02,515 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 20:38:02,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:38:02,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:38:02,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:02,515 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 8 states. [2018-02-02 20:38:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:02,606 INFO L93 Difference]: Finished difference Result 184 states and 204 transitions. [2018-02-02 20:38:02,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:38:02,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-02-02 20:38:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:02,607 INFO L225 Difference]: With dead ends: 184 [2018-02-02 20:38:02,607 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 20:38:02,608 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 20:38:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2018-02-02 20:38:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:38:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 190 transitions. [2018-02-02 20:38:02,610 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 190 transitions. Word has length 94 [2018-02-02 20:38:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:02,610 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 190 transitions. [2018-02-02 20:38:02,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:38:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 190 transitions. [2018-02-02 20:38:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:02,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:02,611 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 20:38:02,611 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1924314337, now seen corresponding path program 1 times [2018-02-02 20:38:02,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:02,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:02,962 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 20:38:02,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:02,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:38:02,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:02,962 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 20:38:02,962 INFO L182 omatonBuilderFactory]: Interpolants [12480#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 12481#(not (= |alloc_17_#in~array.offset| 0)), 12471#true, 12472#false, 12473#(= 0 |ldv_malloc_#t~malloc1.offset|), 12474#(= 0 |ldv_malloc_#res.offset|), 12475#(= 0 |entry_point_#t~ret10.offset|), 12476#(= 0 entry_point_~array~0.offset), 12477#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 12478#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 12479#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0))] [2018-02-02 20:38:02,962 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 20:38:02,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:38:02,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:38:02,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:38:02,963 INFO L87 Difference]: Start difference. First operand 170 states and 190 transitions. Second operand 11 states. [2018-02-02 20:38:03,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:03,092 INFO L93 Difference]: Finished difference Result 175 states and 195 transitions. [2018-02-02 20:38:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:38:03,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-02 20:38:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:03,093 INFO L225 Difference]: With dead ends: 175 [2018-02-02 20:38:03,093 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:38:03,093 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:38:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 20:38:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 20:38:03,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2018-02-02 20:38:03,095 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 94 [2018-02-02 20:38:03,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:03,095 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2018-02-02 20:38:03,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:38:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2018-02-02 20:38:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 20:38:03,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:03,096 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 20:38:03,096 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash 500549267, now seen corresponding path program 2 times [2018-02-02 20:38:03,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:03,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:03,817 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 34 DAG size of output 28 [2018-02-02 20:38:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:04,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:04,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:38:04,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:04,196 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 20:38:04,196 INFO L182 omatonBuilderFactory]: Interpolants [12864#(= 1 (select |#valid| free_17_~array.base)), 12839#true, 12840#false, 12841#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12842#(= 0 |ldv_malloc_#t~malloc1.offset|), 12843#(= 0 |ldv_malloc_#res.offset|), 12844#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 12845#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12846#(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)), 12847#(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)))))), 12848#(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)), 12849#(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)), 12850#(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)))))), 12851#(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)), 12852#(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)), 12853#(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)), 12854#(and (or (< (+ entry_point_~i~2 1) 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) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 8)))))) (= entry_point_~array~0.offset 0)), 12855#(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)), 12856#(and (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 12857#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 12858#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 12859#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12860#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12861#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 12862#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12863#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base)))] [2018-02-02 20:38:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 1 proven. 210 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:04,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:38:04,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:38:04,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:04,197 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand 26 states. [2018-02-02 20:38:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:06,527 INFO L93 Difference]: Finished difference Result 186 states and 203 transitions. [2018-02-02 20:38:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:38:06,528 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2018-02-02 20:38:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:06,528 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:38:06,528 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 20:38:06,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=625, Invalid=3797, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 20:38:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 20:38:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 177. [2018-02-02 20:38:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 20:38:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2018-02-02 20:38:06,531 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 93 [2018-02-02 20:38:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:06,531 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2018-02-02 20:38:06,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:38:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2018-02-02 20:38:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:06,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:06,532 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:06,532 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1474927420, now seen corresponding path program 1 times [2018-02-02 20:38:06,532 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:06,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:38:06,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:06,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:38:06,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:06,583 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 20:38:06,583 INFO L182 omatonBuilderFactory]: Interpolants [13312#false, 13313#(= alloc_17_~i~0 0), 13314#(<= alloc_17_~i~0 1), 13315#(<= alloc_17_~j~0 0), 13316#(<= (+ alloc_17_~j~0 1) 0), 13311#true] [2018-02-02 20:38:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:38:06,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:06,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:06,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:06,584 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand 6 states. [2018-02-02 20:38:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:06,631 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2018-02-02 20:38:06,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:38:06,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-02 20:38:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:06,633 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:38:06,633 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:38:06,633 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 20:38:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:38:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2018-02-02 20:38:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 20:38:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 190 transitions. [2018-02-02 20:38:06,636 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 190 transitions. Word has length 94 [2018-02-02 20:38:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:06,636 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 190 transitions. [2018-02-02 20:38:06,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 190 transitions. [2018-02-02 20:38:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:06,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:06,637 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 20:38:06,637 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:06,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1662841855, now seen corresponding path program 2 times [2018-02-02 20:38:06,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:06,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:07,510 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 20:38:07,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:07,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:38:07,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:07,511 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 20:38:07,512 INFO L182 omatonBuilderFactory]: Interpolants [13696#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 13697#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 13698#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 13699#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 13700#(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)), 13701#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13702#(= 0 |free_17_#t~mem9.offset|), 13678#true, 13679#false, 13680#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13681#(= 0 |ldv_malloc_#t~malloc1.offset|), 13682#(= 0 |ldv_malloc_#res.offset|), 13683#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 13684#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13685#(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)))), 13686#(and (= 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) (= 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) 36)))))), 13687#(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_~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)), 13688#(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) 28))))) (= 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) 28)))) 4) 3) entry_point_~i~2)), 13689#(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) 24)))) 4) 4) 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) 24)))))), 13690#(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) (+ (* 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) 20)))))), 13691#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))) 4) 6) 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) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))), 13692#(and (= 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) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 13693#(and (or (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 8))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 13694#(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) (+ entry_point_~array~0.offset 8))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 13695#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (<= (+ entry_point_~i~2 1) entry_point_~len~0)))] [2018-02-02 20:38:07,512 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 20:38:07,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:38:07,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:38:07,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:07,513 INFO L87 Difference]: Start difference. First operand 173 states and 190 transitions. Second operand 25 states. [2018-02-02 20:38:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:09,535 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-02-02 20:38:09,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:38:09,535 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 20:38:09,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:09,536 INFO L225 Difference]: With dead ends: 186 [2018-02-02 20:38:09,536 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 20:38:09,538 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 805 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=539, Invalid=3493, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 20:38:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 20:38:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2018-02-02 20:38:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:38:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 192 transitions. [2018-02-02 20:38:09,541 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 192 transitions. Word has length 94 [2018-02-02 20:38:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:09,541 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 192 transitions. [2018-02-02 20:38:09,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 192 transitions. [2018-02-02 20:38:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:09,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:09,542 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 20:38:09,542 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1662841854, now seen corresponding path program 2 times [2018-02-02 20:38:09,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:09,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:10,214 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 20:38:10,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:10,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:38:10,214 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:10,214 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 20:38:10,215 INFO L182 omatonBuilderFactory]: Interpolants [14144#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 14145#(= 0 |ldv_malloc_#t~malloc1.offset|), 14146#(= 0 |ldv_malloc_#res.offset|), 14147#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 14148#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14149#(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)), 14150#(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)), 14151#(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$.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)))), 14152#(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$.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)), 14153#(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$.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)))), 14154#(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) (= 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))) (= entry_point_~array~0.offset 0)), 14155#(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)), 14156#(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) 12)) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 14157#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 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))))), 14158#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 14159#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset))))), 14160#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 14161#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 14162#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 14163#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 14164#(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)), 14165#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 14166#(= |free_17_#t~mem9.base| 0), 14142#true, 14143#false] [2018-02-02 20:38:10,215 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 20:38:10,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:38:10,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:38:10,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:10,215 INFO L87 Difference]: Start difference. First operand 174 states and 192 transitions. Second operand 25 states. [2018-02-02 20:38:12,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:12,173 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-02 20:38:12,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 20:38:12,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 20:38:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:12,174 INFO L225 Difference]: With dead ends: 185 [2018-02-02 20:38:12,175 INFO L226 Difference]: Without dead ends: 185 [2018-02-02 20:38:12,176 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=501, Invalid=3039, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 20:38:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-02 20:38:12,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 174. [2018-02-02 20:38:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:38:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 191 transitions. [2018-02-02 20:38:12,179 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 191 transitions. Word has length 94 [2018-02-02 20:38:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:12,179 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 191 transitions. [2018-02-02 20:38:12,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 191 transitions. [2018-02-02 20:38:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:38:12,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:12,180 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 20:38:12,180 INFO L371 AbstractCegarLoop]: === Iteration 46 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash -8536178, now seen corresponding path program 1 times [2018-02-02 20:38:12,181 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:12,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:12,238 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 20:38:12,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:12,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:38:12,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:12,239 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 20:38:12,239 INFO L182 omatonBuilderFactory]: Interpolants [14597#true, 14598#false, 14599#(<= 10 entry_point_~len~0), 14600#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 14601#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 14602#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 14603#(<= |free_17_#in~len| 2)] [2018-02-02 20:38:12,239 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 20:38:12,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:12,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:12,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:12,240 INFO L87 Difference]: Start difference. First operand 174 states and 191 transitions. Second operand 7 states. [2018-02-02 20:38:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:12,273 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2018-02-02 20:38:12,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:12,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-02-02 20:38:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:12,275 INFO L225 Difference]: With dead ends: 201 [2018-02-02 20:38:12,275 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 20:38:12,275 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 20:38:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 20:38:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 180. [2018-02-02 20:38:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 20:38:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 200 transitions. [2018-02-02 20:38:12,278 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 200 transitions. Word has length 95 [2018-02-02 20:38:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:12,278 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 200 transitions. [2018-02-02 20:38:12,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 200 transitions. [2018-02-02 20:38:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:38:12,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:12,279 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, 1, 1, 1, 1] [2018-02-02 20:38:12,279 INFO L371 AbstractCegarLoop]: === Iteration 47 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2117886044, now seen corresponding path program 2 times [2018-02-02 20:38:12,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:12,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:12,334 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 20:38:12,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:12,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:38:12,334 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:12,334 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 20:38:12,335 INFO L182 omatonBuilderFactory]: Interpolants [14992#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 14993#(<= |alloc_17_#in~len| 2), 14987#true, 14988#false, 14989#(<= 10 entry_point_~len~0), 14990#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 14991#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1))] [2018-02-02 20:38:12,335 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 20:38:12,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:12,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:12,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:12,335 INFO L87 Difference]: Start difference. First operand 180 states and 200 transitions. Second operand 7 states. [2018-02-02 20:38:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:12,366 INFO L93 Difference]: Finished difference Result 215 states and 238 transitions. [2018-02-02 20:38:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:12,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-02-02 20:38:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:12,367 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:38:12,367 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 20:38:12,367 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 20:38:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 20:38:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 186. [2018-02-02 20:38:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:38:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2018-02-02 20:38:12,369 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 97 [2018-02-02 20:38:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:12,370 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2018-02-02 20:38:12,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2018-02-02 20:38:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:38:12,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:12,370 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 20:38:12,370 INFO L371 AbstractCegarLoop]: === Iteration 48 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:12,370 INFO L82 PathProgramCache]: Analyzing trace with hash -711355807, now seen corresponding path program 2 times [2018-02-02 20:38:12,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:12,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:12,746 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 20:38:12,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:12,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:38:12,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:12,747 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 20:38:12,747 INFO L182 omatonBuilderFactory]: Interpolants [15397#true, 15398#false, 15399#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15400#(= 0 |ldv_malloc_#t~malloc1.offset|), 15401#(= 0 |ldv_malloc_#res.offset|), 15402#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15403#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15404#(= entry_point_~array~0.offset 0), 15405#(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)))), 15406#(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)))), 15407#(= 0 |alloc_17_#in~array.offset|), 15408#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15409#(= alloc_17_~array.offset 0), 15410#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 15411#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 15412#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (* 4 alloc_17_~i~0)))), 15413#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 15414#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 15415#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-02 20:38:12,747 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 20:38:12,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:38:12,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:38:12,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:38:12,748 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand 19 states. [2018-02-02 20:38:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:12,957 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2018-02-02 20:38:12,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:38:12,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-02 20:38:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:12,958 INFO L225 Difference]: With dead ends: 192 [2018-02-02 20:38:12,958 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 20:38:12,958 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 20:38:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 20:38:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2018-02-02 20:38:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 20:38:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 209 transitions. [2018-02-02 20:38:12,961 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 209 transitions. Word has length 100 [2018-02-02 20:38:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:12,962 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 209 transitions. [2018-02-02 20:38:12,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:38:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 209 transitions. [2018-02-02 20:38:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:38:12,963 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:12,963 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 20:38:12,963 INFO L371 AbstractCegarLoop]: === Iteration 49 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:12,963 INFO L82 PathProgramCache]: Analyzing trace with hash -711355806, now seen corresponding path program 2 times [2018-02-02 20:38:12,964 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:12,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:13,325 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 20:38:13,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:13,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:38:13,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:13,325 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 20:38:13,325 INFO L182 omatonBuilderFactory]: Interpolants [15840#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 15841#(= |#valid| |old(#valid)|), 15842#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 15843#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 15822#true, 15823#false, 15824#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15825#(= 0 |ldv_malloc_#t~malloc1.offset|), 15826#(= 0 |ldv_malloc_#res.offset|), 15827#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15828#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15829#(= entry_point_~array~0.offset 0), 15830#(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)))), 15831#(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)))), 15832#(= 0 |alloc_17_#in~array.offset|), 15833#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15834#(= alloc_17_~array.offset 0), 15835#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 15836#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 15837#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 15838#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 15839#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0)))))] [2018-02-02 20:38:13,326 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 20:38:13,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:38:13,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:38:13,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:38:13,326 INFO L87 Difference]: Start difference. First operand 188 states and 209 transitions. Second operand 22 states. [2018-02-02 20:38:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:13,665 INFO L93 Difference]: Finished difference Result 193 states and 210 transitions. [2018-02-02 20:38:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:38:13,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-02 20:38:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:13,666 INFO L225 Difference]: With dead ends: 193 [2018-02-02 20:38:13,667 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 20:38:13,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:38:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 20:38:13,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2018-02-02 20:38:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-02-02 20:38:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 208 transitions. [2018-02-02 20:38:13,669 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 208 transitions. Word has length 100 [2018-02-02 20:38:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:13,669 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 208 transitions. [2018-02-02 20:38:13,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:38:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 208 transitions. [2018-02-02 20:38:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:38:13,670 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:13,670 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 20:38:13,670 INFO L371 AbstractCegarLoop]: === Iteration 50 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:13,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2012932585, now seen corresponding path program 3 times [2018-02-02 20:38:13,671 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:13,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:14,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:14,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:38:14,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:14,564 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 20:38:14,564 INFO L182 omatonBuilderFactory]: Interpolants [16264#true, 16265#false, 16266#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 16267#(= 0 |ldv_malloc_#t~malloc1.offset|), 16268#(= 0 |ldv_malloc_#res.offset|), 16269#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 16270#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16271#(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)), 16272#(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)), 16273#(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)), 16274#(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$.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)), 16275#(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$.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)))), 16276#(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) (= 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))) (= entry_point_~array~0.offset 0)), 16277#(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)), 16278#(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)), 16279#(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)), 16280#(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))), 16281#(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)), 16282#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 16283#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16284#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 16285#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 16286#(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)), 16287#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 16288#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 16289#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:38:14,564 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 2 proven. 217 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:14,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:38:14,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:38:14,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:14,564 INFO L87 Difference]: Start difference. First operand 188 states and 208 transitions. Second operand 26 states. [2018-02-02 20:38:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:16,563 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2018-02-02 20:38:16,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 20:38:16,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-02 20:38:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:16,563 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:38:16,564 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:38:16,564 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=554, Invalid=3736, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 20:38:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:38:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2018-02-02 20:38:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:38:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2018-02-02 20:38:16,566 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 99 [2018-02-02 20:38:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:16,566 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2018-02-02 20:38:16,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:38:16,566 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2018-02-02 20:38:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:38:16,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:16,567 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 20:38:16,567 INFO L371 AbstractCegarLoop]: === Iteration 51 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:16,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1962001838, now seen corresponding path program 1 times [2018-02-02 20:38:16,568 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:16,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:16,717 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 20:38:16,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:16,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:16,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:16,717 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 20:38:16,718 INFO L182 omatonBuilderFactory]: Interpolants [16768#(= 0 |ldv_malloc_#t~malloc1.offset|), 16769#(= 0 |ldv_malloc_#res.offset|), 16770#(= 0 |entry_point_#t~ret10.offset|), 16771#(= 0 entry_point_~array~0.offset), 16772#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16773#(and (or (<= 0 alloc_17_~j~0) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16774#(and (or (not (= alloc_17_~array.offset 0)) (<= (+ alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 16775#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 16776#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 16777#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 16778#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16766#true, 16767#false] [2018-02-02 20:38:16,718 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 20:38:16,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:16,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:16,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:16,719 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand 13 states. [2018-02-02 20:38:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:16,835 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2018-02-02 20:38:16,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:38:16,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-02-02 20:38:16,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:16,836 INFO L225 Difference]: With dead ends: 202 [2018-02-02 20:38:16,836 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 20:38:16,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 20:38:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2018-02-02 20:38:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 20:38:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-02-02 20:38:16,839 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 101 [2018-02-02 20:38:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:16,839 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-02-02 20:38:16,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-02-02 20:38:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:38:16,840 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:16,840 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 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 20:38:16,840 INFO L371 AbstractCegarLoop]: === Iteration 52 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2023599253, now seen corresponding path program 3 times [2018-02-02 20:38:16,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:16,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:38:17,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:17,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:38:17,582 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:17,582 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 20:38:17,583 INFO L182 omatonBuilderFactory]: Interpolants [17180#true, 17181#false, 17182#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17183#(= 0 |ldv_malloc_#t~malloc1.offset|), 17184#(= 0 |ldv_malloc_#res.offset|), 17185#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17186#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17187#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~2)))) (<= 40 (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17188#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))) 4) 1) 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) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 32)) 4))))), 17189#(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) 28)) 4)))) (= 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) 28)) 4))) 4) 2) entry_point_~i~2)), 17190#(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) 24)) 4)))) (= 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) 24)) 4))) 4) 3) entry_point_~i~2)), 17191#(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_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4)))) (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 20)) 4))) 4) 4) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 17192#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)) 4))) 4) 5) 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) 16)) 4)))) (= entry_point_~array~0.offset 0)), 17193#(and (or (= 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)) 4)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17194#(and (or (= 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 (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17195#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ (* 4 entry_point_~i~2) 8) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 17196#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 17197#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ 8 4)))) (= entry_point_~array~0.offset 0)), 17198#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 17199#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ 8 4)))), 17200#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ 8 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 17201#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 4)) 4)))), 17202#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))), 17203#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17204#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 20:38:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:38:17,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:38:17,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:38:17,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:17,583 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 25 states. [2018-02-02 20:38:19,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:19,357 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-02-02 20:38:19,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:38:19,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 20:38:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:19,358 INFO L225 Difference]: With dead ends: 206 [2018-02-02 20:38:19,358 INFO L226 Difference]: Without dead ends: 206 [2018-02-02 20:38:19,358 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=477, Invalid=3429, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 20:38:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-02-02 20:38:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2018-02-02 20:38:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:38:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2018-02-02 20:38:19,360 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 100 [2018-02-02 20:38:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:19,360 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2018-02-02 20:38:19,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:19,360 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2018-02-02 20:38:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:38:19,361 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:19,361 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 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 20:38:19,361 INFO L371 AbstractCegarLoop]: === Iteration 53 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2023599252, now seen corresponding path program 3 times [2018-02-02 20:38:19,361 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:19,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:38:20,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:20,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:38:20,141 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:20,141 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 20:38:20,141 INFO L182 omatonBuilderFactory]: Interpolants [17682#true, 17683#false, 17684#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17685#(= 0 |ldv_malloc_#t~malloc1.offset|), 17686#(= 0 |ldv_malloc_#res.offset|), 17687#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17688#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17689#(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)), 17690#(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) 36))))) (= 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)), 17691#(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) 32))))) (= 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) 32)))) 4) 2) entry_point_~i~2)), 17692#(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$.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) 28))))) (= entry_point_~array~0.offset 0)), 17693#(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) 24))))) (= 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) 24)))) 4) 4) entry_point_~i~2)), 17694#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))) 4) 5) 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) 20)))))), 17695#(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) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= 0 entry_point_~array~0.offset)), 17696#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 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) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (= 0 entry_point_~array~0.offset) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))), 17697#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 17698#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 17699#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 17700#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 17701#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 17702#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 17703#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 17704#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 17705#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17706#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:38:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 3 proven. 208 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:38:20,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:38:20,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:38:20,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:20,142 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand 25 states. [2018-02-02 20:38:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:21,844 INFO L93 Difference]: Finished difference Result 205 states and 222 transitions. [2018-02-02 20:38:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:38:21,845 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 20:38:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:21,845 INFO L225 Difference]: With dead ends: 205 [2018-02-02 20:38:21,845 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 20:38:21,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=434, Invalid=2872, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:38:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 20:38:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2018-02-02 20:38:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 20:38:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 214 transitions. [2018-02-02 20:38:21,848 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 214 transitions. Word has length 100 [2018-02-02 20:38:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:21,848 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 214 transitions. [2018-02-02 20:38:21,848 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 214 transitions. [2018-02-02 20:38:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:38:21,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:21,848 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, 1, 1] [2018-02-02 20:38:21,848 INFO L371 AbstractCegarLoop]: === Iteration 54 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:21,848 INFO L82 PathProgramCache]: Analyzing trace with hash -713129662, now seen corresponding path program 2 times [2018-02-02 20:38:21,849 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:21,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:38:22,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:22,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:38:22,324 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:22,324 INFO L182 omatonBuilderFactory]: Interpolants [18176#(= 0 |ldv_malloc_#t~malloc1.offset|), 18177#(= 0 |ldv_malloc_#res.offset|), 18178#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 18179#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 18180#(= entry_point_~array~0.offset 0), 18181#(and (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) 4)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 18182#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~2))) (= entry_point_~array~0.offset 0)), 18183#(= 0 |alloc_17_#in~array.offset|), 18184#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 18185#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18186#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18187#(= |#valid| |old(#valid)|), 18188#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 18189#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 18190#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 18191#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 18192#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 18193#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4)))))), 18194#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 18195#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 18196#(= 1 (select |#valid| alloc_17_~array.base)), 18173#true, 18174#false, 18175#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10))] [2018-02-02 20:38:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 48 proven. 92 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:38:22,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:38:22,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:38:22,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:38:22,325 INFO L87 Difference]: Start difference. First operand 194 states and 214 transitions. Second operand 24 states. [2018-02-02 20:38:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:22,769 INFO L93 Difference]: Finished difference Result 210 states and 229 transitions. [2018-02-02 20:38:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:38:22,770 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-02 20:38:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:22,770 INFO L225 Difference]: With dead ends: 210 [2018-02-02 20:38:22,770 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 20:38:22,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:38:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 20:38:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 196. [2018-02-02 20:38:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 20:38:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-02-02 20:38:22,772 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 102 [2018-02-02 20:38:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:22,772 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-02-02 20:38:22,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:38:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-02-02 20:38:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:38:22,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:22,773 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, 1] [2018-02-02 20:38:22,773 INFO L371 AbstractCegarLoop]: === Iteration 55 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 692514855, now seen corresponding path program 1 times [2018-02-02 20:38:22,774 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:22,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:38:23,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:23,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:38:23,281 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:23,281 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 20:38:23,281 INFO L182 omatonBuilderFactory]: Interpolants [18656#(and (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (and (= 0 alloc_17_~p~0.offset) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 18657#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))) (or (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (< 0 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))))), 18658#(or (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 5 (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0)))) (and (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18659#(or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18660#(or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18661#(or (and (= 0 (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (<= 1 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))))), 18662#(or (<= 1 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18663#(or (<= 0 alloc_17_~j~0) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18664#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) 0)) (not (= |alloc_17_#in~array.offset| 0))), 18665#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 18666#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 18667#(and (or (= 0 (select (select |#memory_$Pointer$.offset| 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)), 18668#(= 0 |free_17_#t~mem9.offset|), 18648#true, 18649#false, 18650#(= 0 |ldv_malloc_#t~malloc1.offset|), 18651#(= 0 |ldv_malloc_#res.offset|), 18652#(= 0 |entry_point_#t~ret10.offset|), 18653#(= 0 entry_point_~array~0.offset), 18654#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 18655#(and (or (= alloc_17_~array.offset 0) (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (and (= 0 |alloc_17_#t~ret3.offset|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 0))))] [2018-02-02 20:38:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 20:38:23,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:38:23,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:38:23,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:38:23,282 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 21 states. [2018-02-02 20:38:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:23,662 INFO L93 Difference]: Finished difference Result 233 states and 258 transitions. [2018-02-02 20:38:23,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:38:23,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 102 [2018-02-02 20:38:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:23,663 INFO L225 Difference]: With dead ends: 233 [2018-02-02 20:38:23,663 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 20:38:23,663 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:38:23,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 20:38:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2018-02-02 20:38:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 20:38:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 254 transitions. [2018-02-02 20:38:23,665 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 254 transitions. Word has length 102 [2018-02-02 20:38:23,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:23,665 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 254 transitions. [2018-02-02 20:38:23,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:38:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 254 transitions. [2018-02-02 20:38:23,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 20:38:23,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:23,665 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, 1] [2018-02-02 20:38:23,666 INFO L371 AbstractCegarLoop]: === Iteration 56 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:23,666 INFO L82 PathProgramCache]: Analyzing trace with hash 692514856, now seen corresponding path program 1 times [2018-02-02 20:38:23,666 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:23,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:23,912 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 20:38:23,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:23,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:38:23,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:23,912 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 20:38:23,913 INFO L182 omatonBuilderFactory]: Interpolants [19143#true, 19144#false, 19145#(= 0 |ldv_malloc_#t~malloc1.offset|), 19146#(= 0 |ldv_malloc_#res.offset|), 19147#(= 0 |entry_point_#t~ret10.offset|), 19148#(= 0 entry_point_~array~0.offset), 19149#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19150#(and (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19151#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 19152#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 19153#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 19154#(or (not (= |alloc_17_#in~array.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0))), 19155#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 19156#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 19157#(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)), 19158#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:38:23,913 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 20:38:23,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:38:23,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:38:23,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:23,913 INFO L87 Difference]: Start difference. First operand 224 states and 254 transitions. Second operand 16 states. [2018-02-02 20:38:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:24,108 INFO L93 Difference]: Finished difference Result 260 states and 294 transitions. [2018-02-02 20:38:24,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:38:24,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-02-02 20:38:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:24,108 INFO L225 Difference]: With dead ends: 260 [2018-02-02 20:38:24,108 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 20:38:24,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:38:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 20:38:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2018-02-02 20:38:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 20:38:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 290 transitions. [2018-02-02 20:38:24,111 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 290 transitions. Word has length 102 [2018-02-02 20:38:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:24,111 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 290 transitions. [2018-02-02 20:38:24,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:38:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 290 transitions. [2018-02-02 20:38:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:38:24,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:24,111 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:24,111 INFO L371 AbstractCegarLoop]: === Iteration 57 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:24,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1692886372, now seen corresponding path program 2 times [2018-02-02 20:38:24,112 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:24,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:38:24,161 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:24,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:38:24,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:24,161 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 20:38:24,161 INFO L182 omatonBuilderFactory]: Interpolants [19684#true, 19685#false, 19686#(<= 10 entry_point_~len~0), 19687#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 19688#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 19689#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 19690#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 19691#(<= |free_17_#in~len| 3)] [2018-02-02 20:38:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:38:24,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:38:24,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:38:24,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:24,162 INFO L87 Difference]: Start difference. First operand 251 states and 290 transitions. Second operand 8 states. [2018-02-02 20:38:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:24,190 INFO L93 Difference]: Finished difference Result 305 states and 353 transitions. [2018-02-02 20:38:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:38:24,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-02-02 20:38:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:24,191 INFO L225 Difference]: With dead ends: 305 [2018-02-02 20:38:24,191 INFO L226 Difference]: Without dead ends: 297 [2018-02-02 20:38:24,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:38:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-02-02 20:38:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 269. [2018-02-02 20:38:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-02-02 20:38:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 319 transitions. [2018-02-02 20:38:24,194 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 319 transitions. Word has length 101 [2018-02-02 20:38:24,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:24,194 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 319 transitions. [2018-02-02 20:38:24,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:38:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 319 transitions. [2018-02-02 20:38:24,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 20:38:24,195 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:24,195 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 4, 4, 4, 4, 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 20:38:24,195 INFO L371 AbstractCegarLoop]: === Iteration 58 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash 567391423, now seen corresponding path program 4 times [2018-02-02 20:38:24,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:24,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 226 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:38:24,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:24,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:38:24,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:24,913 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 20:38:24,913 INFO L182 omatonBuilderFactory]: Interpolants [20288#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 20289#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 20290#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 20291#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 20292#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 20293#(= 1 (select |#valid| free_17_~array.base)), 20268#true, 20269#false, 20270#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 20271#(= 0 |ldv_malloc_#t~malloc1.offset|), 20272#(= 0 |ldv_malloc_#res.offset|), 20273#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 20274#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 20275#(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)), 20276#(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) 36))))) (= 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)), 20277#(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) 32))))) (= 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) 32)))) 4) 2) entry_point_~i~2)), 20278#(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$.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) 28))))) (= entry_point_~array~0.offset 0)), 20279#(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) 24))))) (= 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) 24)))) 4) 4) entry_point_~i~2)), 20280#(and (<= (+ (div (+ (- entry_point_~array~0.offset) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20)))) 4) 5) 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) 20)))))), 20281#(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) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16))))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 20282#(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$.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) 16)))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 20283#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 16)))))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 20284#(and (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 20285#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 20286#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 20287#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|))] [2018-02-02 20:38:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 3 proven. 226 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-02-02 20:38:24,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:38:24,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:38:24,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:24,914 INFO L87 Difference]: Start difference. First operand 269 states and 319 transitions. Second operand 26 states. [2018-02-02 20:38:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:26,689 INFO L93 Difference]: Finished difference Result 283 states and 331 transitions. [2018-02-02 20:38:26,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:38:26,690 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-02-02 20:38:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:26,690 INFO L225 Difference]: With dead ends: 283 [2018-02-02 20:38:26,690 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 20:38:26,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=492, Invalid=3668, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:38:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 20:38:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 274. [2018-02-02 20:38:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 20:38:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 325 transitions. [2018-02-02 20:38:26,693 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 325 transitions. Word has length 105 [2018-02-02 20:38:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:26,693 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 325 transitions. [2018-02-02 20:38:26,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:38:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 325 transitions. [2018-02-02 20:38:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:38:26,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:26,694 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:26,694 INFO L371 AbstractCegarLoop]: === Iteration 59 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash 2092361700, now seen corresponding path program 1 times [2018-02-02 20:38:26,695 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:26,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 20:38:26,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:27,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:38:27,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:27,002 INFO L182 omatonBuilderFactory]: Interpolants [20930#true, 20931#false, 20932#(= 0 |ldv_malloc_#t~malloc1.offset|), 20933#(= 0 |ldv_malloc_#res.offset|), 20934#(= 0 |entry_point_#t~ret10.offset|), 20935#(= 0 entry_point_~array~0.offset), 20936#(= 0 |alloc_17_#in~array.offset|), 20937#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 20938#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 20939#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 20940#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))), 20941#(and (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 1) alloc_17_~i~0) (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 20942#(and (<= alloc_17_~i~0 2) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0)) (<= (+ (div (+ 0 (- alloc_17_~array.offset)) 4) 2) alloc_17_~i~0)), 20943#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))), 20944#(and (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 20945#(and (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (<= alloc_17_~j~0 0)), 20946#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))), 20947#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-02 20:38:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 20:38:27,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:38:27,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:38:27,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:38:27,002 INFO L87 Difference]: Start difference. First operand 274 states and 325 transitions. Second operand 18 states. [2018-02-02 20:38:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:27,464 INFO L93 Difference]: Finished difference Result 301 states and 355 transitions. [2018-02-02 20:38:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:38:27,464 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 107 [2018-02-02 20:38:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:27,465 INFO L225 Difference]: With dead ends: 301 [2018-02-02 20:38:27,465 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 20:38:27,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:38:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 20:38:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2018-02-02 20:38:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:38:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 347 transitions. [2018-02-02 20:38:27,468 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 347 transitions. Word has length 107 [2018-02-02 20:38:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:27,468 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 347 transitions. [2018-02-02 20:38:27,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:38:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 347 transitions. [2018-02-02 20:38:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:38:27,469 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:27,469 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:27,469 INFO L371 AbstractCegarLoop]: === Iteration 60 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2092361701, now seen corresponding path program 2 times [2018-02-02 20:38:27,470 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:27,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 13 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:38:28,595 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:28,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:38:28,596 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:38:28,596 INFO L182 omatonBuilderFactory]: Interpolants [21574#true, 21575#false, 21576#(= 0 (select |#valid| 0)), 21577#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10)), 21578#(= (select |old(#valid)| 0) (select |#valid| 0)), 21579#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 21580#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 21581#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 21582#(and (<= 10 entry_point_~len~0) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 21583#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 21584#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0))) (= entry_point_~array~0.offset 0) (or (= (* 4 entry_point_~len~0) (+ (* 4 entry_point_~i~2) 4)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 21585#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (= 0 (select |#valid| 0)))), 21586#(and (= 0 (select |#valid| 0)) (= 0 |alloc_17_#in~array.offset|)), 21587#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 21588#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 21589#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 21590#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 (select |#valid| 0))), 21591#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base)) (= 0 (select |#valid| 0))), 21592#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0))))) (= 0 (select |#valid| 0))), 21593#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 21594#(= |#valid| |old(#valid)|), 21595#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 21596#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21597#(and (= alloc_17_~array.offset 0) (or (and (not (= |alloc_17_#t~ret3.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (and (= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 4) (not (= 0 |alloc_17_#t~ret3.base|))) (<= (* 4 alloc_17_~i~0) 3))), 21598#(and (= alloc_17_~array.offset 0) (or (and (<= alloc_17_~i~0 1) (not (= alloc_17_~p~0.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) alloc_17_~p~0.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (not (= 0 alloc_17_~p~0.base)) (<= (* 4 alloc_17_~i~0) 3))), 21599#(and (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 3)) (or (<= (* 4 alloc_17_~i~0) 3) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4)))) (= alloc_17_~array.offset 0) (<= (* 4 alloc_17_~i~0) 4)), 21600#(and (= alloc_17_~array.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))) (<= (* 4 alloc_17_~i~0) 7)) (<= (* 4 alloc_17_~i~0) 8) (or (<= (* 4 alloc_17_~i~0) 7) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 4))))), 21601#(and (= alloc_17_~array.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3))), 21602#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= |alloc_17_#t~mem6.base| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (or (not (= 1 (select |#valid| |alloc_17_#t~mem6.base|))) (and (<= alloc_17_~j~0 1) (= 1 (select (store |#valid| |alloc_17_#t~mem6.base| 0) (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0)))))))), 21603#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= alloc_17_~j~0 1)))), 21604#(and (= alloc_17_~array.offset 0) (or (and (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0))), 21605#(and (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))), 21606#(= 1 (select |#valid| |alloc_17_#t~mem6.base|))] [2018-02-02 20:38:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 13 proven. 131 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-02-02 20:38:28,596 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:38:28,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:38:28,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:38:28,597 INFO L87 Difference]: Start difference. First operand 291 states and 347 transitions. Second operand 33 states. [2018-02-02 20:38:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:29,905 INFO L93 Difference]: Finished difference Result 301 states and 353 transitions. [2018-02-02 20:38:29,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:38:29,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 107 [2018-02-02 20:38:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:29,906 INFO L225 Difference]: With dead ends: 301 [2018-02-02 20:38:29,906 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 20:38:29,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 5 SyntacticMatches, 11 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=564, Invalid=3726, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 20:38:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 20:38:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2018-02-02 20:38:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:38:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 346 transitions. [2018-02-02 20:38:29,910 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 346 transitions. Word has length 107 [2018-02-02 20:38:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:29,910 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 346 transitions. [2018-02-02 20:38:29,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:38:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 346 transitions. [2018-02-02 20:38:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:38:29,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:29,911 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:29,911 INFO L371 AbstractCegarLoop]: === Iteration 61 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:29,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2093109885, now seen corresponding path program 1 times [2018-02-02 20:38:29,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:29,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:38:30,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:30,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:38:30,212 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:30,212 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 20:38:30,212 INFO L182 omatonBuilderFactory]: Interpolants [22272#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 22273#(and (or (and (<= 0 alloc_17_~j~0) (or (not (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 22274#(or (<= 1 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 22275#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 22276#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) 0)))), 22277#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= 0 entry_point_~array~0.offset) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) entry_point_~array~0.base))), 22278#(and (= 0 |free_17_#in~array.offset|) (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0) |free_17_#in~array.base|)) (= 1 (select |#valid| |free_17_#in~array.base|))), 22279#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset)) free_17_~array.base)) (= 0 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (= 1 (select |#valid| free_17_~array.base))), 22280#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 22281#(= 1 (select |#valid| free_17_~array.base)), 22265#true, 22266#false, 22267#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 22268#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 22269#(and (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 22270#(and (= 0 entry_point_~array~0.offset) (not (= 0 entry_point_~array~0.base))), 22271#(and (or (not (= alloc_17_~array.offset 0)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))] [2018-02-02 20:38:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 20:38:30,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:38:30,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:38:30,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:38:30,213 INFO L87 Difference]: Start difference. First operand 291 states and 346 transitions. Second operand 17 states. [2018-02-02 20:38:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:30,470 INFO L93 Difference]: Finished difference Result 293 states and 344 transitions. [2018-02-02 20:38:30,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:38:30,470 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-02-02 20:38:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:30,471 INFO L225 Difference]: With dead ends: 293 [2018-02-02 20:38:30,471 INFO L226 Difference]: Without dead ends: 293 [2018-02-02 20:38:30,471 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-02-02 20:38:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-02-02 20:38:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:38:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 344 transitions. [2018-02-02 20:38:30,473 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 344 transitions. Word has length 107 [2018-02-02 20:38:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:30,473 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 344 transitions. [2018-02-02 20:38:30,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:38:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 344 transitions. [2018-02-02 20:38:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:38:30,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:30,474 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:30,474 INFO L371 AbstractCegarLoop]: === Iteration 62 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2093109884, now seen corresponding path program 1 times [2018-02-02 20:38:30,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:30,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 20:38:30,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:30,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:38:30,719 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:30,719 INFO L182 omatonBuilderFactory]: Interpolants [22884#true, 22885#false, 22886#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 22887#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 22888#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 22889#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 22890#(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)), 22891#(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)), 22892#(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)), 22893#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 22894#(and (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= |#valid| |old(#valid)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 22895#(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|))), 22896#(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|))))), 22897#(and (or (= (select |old(#length)| alloc_17_~array.base) (select |#length| alloc_17_~array.base)) (= 0 (select |old(#valid)| alloc_17_~array.base))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 22898#(= |old(#length)| |#length|), 22899#(or (= 0 (select |old(#valid)| |alloc_17_#in~array.base|)) (= (select |old(#length)| |alloc_17_#in~array.base|) (select |#length| |alloc_17_#in~array.base|))), 22900#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 22901#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 22902#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 22903#(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)), 22904#(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)), 22905#(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 20:38:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 38 proven. 13 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-02-02 20:38:30,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:38:30,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:38:30,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:38:30,720 INFO L87 Difference]: Start difference. First operand 291 states and 344 transitions. Second operand 22 states. [2018-02-02 20:38:31,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:31,213 INFO L93 Difference]: Finished difference Result 306 states and 350 transitions. [2018-02-02 20:38:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:38:31,214 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 107 [2018-02-02 20:38:31,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:31,214 INFO L225 Difference]: With dead ends: 306 [2018-02-02 20:38:31,214 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 20:38:31,215 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:38:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 20:38:31,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 291. [2018-02-02 20:38:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 20:38:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 341 transitions. [2018-02-02 20:38:31,217 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 341 transitions. Word has length 107 [2018-02-02 20:38:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:31,217 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 341 transitions. [2018-02-02 20:38:31,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:38:31,217 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 341 transitions. [2018-02-02 20:38:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 20:38:31,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:31,217 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 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 20:38:31,218 INFO L371 AbstractCegarLoop]: === Iteration 63 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash 409264981, now seen corresponding path program 4 times [2018-02-02 20:38:31,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:31,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:38:31,852 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:31,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:38:31,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:31,852 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 20:38:31,852 INFO L182 omatonBuilderFactory]: Interpolants [23552#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 16)) (= free_17_~array.offset 0)), 23553#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12)))) (= free_17_~array.offset 0)), 23554#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8)))) (= free_17_~array.offset 0)), 23555#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 23556#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))) (= free_17_~array.offset 0)), 23557#(= 0 |free_17_#t~mem9.offset|), 23533#true, 23534#false, 23535#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 23536#(= 0 |ldv_malloc_#t~malloc1.offset|), 23537#(= 0 |ldv_malloc_#res.offset|), 23538#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 23539#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 23540#(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)))), 23541#(and (= 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_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (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)), 23542#(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) 32)) entry_point_~array~0.offset))) (= 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)), 23543#(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_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) 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) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 23544#(and (<= (+ (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) (= 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) 24)) entry_point_~array~0.offset)))), 23545#(and (= 0 entry_point_~array~0.offset) (or (= 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) 20)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23546#(and (or (< (+ entry_point_~i~2 1) entry_point_~len~0) (and (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (+ 16 entry_point_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))) (= 0 entry_point_~array~0.offset)), 23547#(and (= 0 entry_point_~array~0.offset) (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 23548#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 23549#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)))), 23550#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 23551#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|))] [2018-02-02 20:38:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:38:31,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:38:31,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:38:31,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:31,853 INFO L87 Difference]: Start difference. First operand 291 states and 341 transitions. Second operand 25 states. [2018-02-02 20:38:33,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:33,500 INFO L93 Difference]: Finished difference Result 304 states and 351 transitions. [2018-02-02 20:38:33,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:38:33,500 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-02-02 20:38:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:33,501 INFO L225 Difference]: With dead ends: 304 [2018-02-02 20:38:33,501 INFO L226 Difference]: Without dead ends: 304 [2018-02-02 20:38:33,501 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2018-02-02 20:38:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-02 20:38:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2018-02-02 20:38:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:38:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 343 transitions. [2018-02-02 20:38:33,503 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 343 transitions. Word has length 106 [2018-02-02 20:38:33,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:33,503 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 343 transitions. [2018-02-02 20:38:33,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 343 transitions. [2018-02-02 20:38:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-02-02 20:38:33,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:33,504 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 5, 5, 4, 4, 4, 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 20:38:33,504 INFO L371 AbstractCegarLoop]: === Iteration 64 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:33,504 INFO L82 PathProgramCache]: Analyzing trace with hash 409264982, now seen corresponding path program 4 times [2018-02-02 20:38:33,505 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:33,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:38:34,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:34,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:38:34,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:34,145 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 20:38:34,146 INFO L182 omatonBuilderFactory]: Interpolants [24229#true, 24230#false, 24231#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 24232#(= 0 |ldv_malloc_#t~malloc1.offset|), 24233#(= 0 |ldv_malloc_#res.offset|), 24234#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 24235#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24236#(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)), 24237#(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)))))), 24238#(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)), 24239#(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)), 24240#(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$.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)))))), 24241#(and (= 0 entry_point_~array~0.offset) (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) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 20))))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 24242#(and (= 0 entry_point_~array~0.offset) (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) (+ entry_point_~array~0.offset 16)))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 24243#(and (= 0 entry_point_~array~0.offset) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (< (+ entry_point_~i~2 1) entry_point_~len~0))), 24244#(and (= 0 entry_point_~array~0.offset) (or (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 24245#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 16))) (= entry_point_~array~0.offset 0)), 24246#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 24247#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16)) (= 0 |free_17_#in~array.offset|)), 24248#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 16)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 24249#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12)))) (= free_17_~array.offset 0)), 24250#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))))), 24251#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))) (= free_17_~array.offset 0)), 24252#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1)))), 24253#(= |free_17_#t~mem9.base| 0)] [2018-02-02 20:38:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 214 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:38:34,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:38:34,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:38:34,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:38:34,146 INFO L87 Difference]: Start difference. First operand 292 states and 343 transitions. Second operand 25 states. [2018-02-02 20:38:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:35,631 INFO L93 Difference]: Finished difference Result 303 states and 350 transitions. [2018-02-02 20:38:35,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 20:38:35,631 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-02-02 20:38:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:35,632 INFO L225 Difference]: With dead ends: 303 [2018-02-02 20:38:35,632 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 20:38:35,632 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=371, Invalid=2709, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 20:38:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 20:38:35,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-02-02 20:38:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:38:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 342 transitions. [2018-02-02 20:38:35,634 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 342 transitions. Word has length 106 [2018-02-02 20:38:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:35,634 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 342 transitions. [2018-02-02 20:38:35,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:38:35,634 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 342 transitions. [2018-02-02 20:38:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:38:35,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:35,635 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:35,635 INFO L371 AbstractCegarLoop]: === Iteration 65 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash -461896943, now seen corresponding path program 1 times [2018-02-02 20:38:35,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:35,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:36,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:36,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 20:38:36,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:36,984 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 20:38:36,985 INFO L182 omatonBuilderFactory]: Interpolants [24912#true, 24913#false, 24914#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 24915#(= 0 |ldv_malloc_#t~malloc1.offset|), 24916#(= 0 |ldv_malloc_#res.offset|), 24917#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 24918#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 24919#(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)), 24920#(and (= 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_~len~0) (+ (* 4 entry_point_~i~2) 36)) entry_point_~array~0.offset))) (<= (+ (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)), 24921#(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) 32)) entry_point_~array~0.offset))) (= 0 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)), 24922#(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_~i~2) (+ (* (- 4) entry_point_~len~0) 28)) 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) 28)) entry_point_~array~0.offset)) 4) 3) entry_point_~i~2)), 24923#(and (= entry_point_~array~0.offset 0) (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset) (- 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) (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 24)) entry_point_~array~0.offset)))), 24924#(and (<= (+ (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) (= 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) 20)) entry_point_~array~0.offset)))), 24925#(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_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset))) (= 0 entry_point_~array~0.offset) (<= (+ (div (+ (+ (+ (* 4 entry_point_~i~2) (+ (* (- 4) entry_point_~len~0) 16)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 6) entry_point_~i~2)), 24926#(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))) (<= (+ (div (+ (+ (+ (* (- 4) entry_point_~len~0) (+ (* 4 entry_point_~i~2) 12)) entry_point_~array~0.offset) (- entry_point_~array~0.offset)) 4) 7) entry_point_~i~2) (= entry_point_~array~0.offset 0)), 24927#(and (or (= 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) 8)) entry_point_~array~0.offset))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 24928#(and (or (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)) (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_~array~0.offset))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)))) (= entry_point_~array~0.offset 0)), 24929#(and (or (and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (< (+ entry_point_~i~2 1) entry_point_~len~0)) (= entry_point_~array~0.offset 0)), 24930#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))) (<= (+ entry_point_~i~2 1) entry_point_~len~0))), 24931#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 24932#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 24933#(and (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 24934#(and (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24935#(and (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= (select |#memory_$Pointer$.offset| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base)) (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select |#memory_$Pointer$.offset| alloc_17_~array.base))))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24936#(or (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 24937#(or (and (= |alloc_17_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))) (not (= (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))) (select (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)))))) (and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))), 24938#(and (= (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (store (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (select (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base))))) (or (= (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 0)) alloc_17_~array.base)) (and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| alloc_17_~array.base) (select (store |#memory_$Pointer$.offset| alloc_17_~array.base (store (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0)) alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|)), 24939#(and (or (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24940#(and (or (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24941#(and (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) 0) (not (= |alloc_17_#in~array.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))) (= (store (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.offset)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.offset| |alloc_17_#in~array.base|))), 24942#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 24943#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 24944#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 24945#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 20:38:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:36,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 20:38:36,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 20:38:36,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:38:36,985 INFO L87 Difference]: Start difference. First operand 292 states and 342 transitions. Second operand 34 states. [2018-02-02 20:38:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:40,454 INFO L93 Difference]: Finished difference Result 304 states and 349 transitions. [2018-02-02 20:38:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 20:38:40,454 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-02-02 20:38:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:40,455 INFO L225 Difference]: With dead ends: 304 [2018-02-02 20:38:40,455 INFO L226 Difference]: Without dead ends: 304 [2018-02-02 20:38:40,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 10 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=749, Invalid=5571, Unknown=0, NotChecked=0, Total=6320 [2018-02-02 20:38:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-02-02 20:38:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2018-02-02 20:38:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:38:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 341 transitions. [2018-02-02 20:38:40,459 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 341 transitions. Word has length 108 [2018-02-02 20:38:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:40,459 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 341 transitions. [2018-02-02 20:38:40,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 20:38:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 341 transitions. [2018-02-02 20:38:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:38:40,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:40,459 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:40,459 INFO L371 AbstractCegarLoop]: === Iteration 66 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:40,460 INFO L82 PathProgramCache]: Analyzing trace with hash -461896942, now seen corresponding path program 1 times [2018-02-02 20:38:40,460 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:40,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:41,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:41,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 20:38:41,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:41,682 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 20:38:41,682 INFO L182 omatonBuilderFactory]: Interpolants [25664#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 25665#(= |free_17_#t~mem9.base| 0), 25634#true, 25635#false, 25636#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 25637#(= 0 |ldv_malloc_#t~malloc1.offset|), 25638#(= 0 |ldv_malloc_#res.offset|), 25639#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 25640#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 25641#(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)), 25642#(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)))))), 25643#(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)), 25644#(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)), 25645#(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)))))), 25646#(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)), 25647#(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)), 25648#(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)), 25649#(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)))))), 25650#(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)), 25651#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0))) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 25652#(and (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)))) (= entry_point_~array~0.offset 0)), 25653#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 25654#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 25655#(and (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25656#(and (or (not (= alloc_17_~array.offset 0)) (and (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)))) (= alloc_17_~array.base |alloc_17_#in~array.base|))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25657#(and (or (and (or (<= (+ (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) 4) (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25658#(and (or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= (select |#memory_$Pointer$.base| alloc_17_~array.base) (select |old(#memory_$Pointer$.base)| alloc_17_~array.base))) (= (store (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (@diff (select |old(#memory_$Pointer$.base)| alloc_17_~array.base) (select |#memory_$Pointer$.base| alloc_17_~array.base)))) (select |#memory_$Pointer$.base| alloc_17_~array.base)) (= alloc_17_~array.base |alloc_17_#in~array.base|)) (not (= alloc_17_~array.offset 0))) (or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset))), 25659#(or (not (= |alloc_17_#in~array.offset| 0)) (and (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))) (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (* 4 alloc_17_~j~0))))), 25660#(or (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)) (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))))) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (+ (* 4 alloc_17_~j~0) 4)))) (not (= |alloc_17_#in~array.offset| 0))), 25661#(or (not (= |alloc_17_#in~array.offset| 0)) (and (= (store (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (or (= (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)) (or (= (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|))))) (<= (@diff (store (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) (select (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|) (@diff (select |old(#memory_$Pointer$.base)| |alloc_17_#in~array.base|) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)))) (select |#memory_$Pointer$.base| |alloc_17_#in~array.base|)) 0)))), 25662#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 25663#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 20:38:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 1 proven. 212 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:41,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 20:38:41,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 20:38:41,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=912, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:38:41,682 INFO L87 Difference]: Start difference. First operand 292 states and 341 transitions. Second operand 32 states. [2018-02-02 20:38:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:45,068 INFO L93 Difference]: Finished difference Result 303 states and 348 transitions. [2018-02-02 20:38:45,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 20:38:45,068 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 108 [2018-02-02 20:38:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:45,069 INFO L225 Difference]: With dead ends: 303 [2018-02-02 20:38:45,069 INFO L226 Difference]: Without dead ends: 303 [2018-02-02 20:38:45,069 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 10 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=684, Invalid=4572, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 20:38:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-02-02 20:38:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-02-02 20:38:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-02-02 20:38:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 340 transitions. [2018-02-02 20:38:45,073 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 340 transitions. Word has length 108 [2018-02-02 20:38:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:45,073 INFO L432 AbstractCegarLoop]: Abstraction has 292 states and 340 transitions. [2018-02-02 20:38:45,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 20:38:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 340 transitions. [2018-02-02 20:38:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-02 20:38:45,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:45,074 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 5, 4, 4, 4, 4, 4, 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 20:38:45,074 INFO L371 AbstractCegarLoop]: === Iteration 67 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash -197733702, now seen corresponding path program 3 times [2018-02-02 20:38:45,075 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:45,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:38:45,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:45,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:38:45,120 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:45,120 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 20:38:45,120 INFO L182 omatonBuilderFactory]: Interpolants [26343#true, 26344#false, 26345#(<= 10 entry_point_~len~0), 26346#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 26347#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 26348#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 26349#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 3)), 26350#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 4)), 26351#(<= |free_17_#in~len| 4)] [2018-02-02 20:38:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 20:38:45,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:38:45,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:38:45,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:38:45,121 INFO L87 Difference]: Start difference. First operand 292 states and 340 transitions. Second operand 9 states. [2018-02-02 20:38:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:45,148 INFO L93 Difference]: Finished difference Result 350 states and 401 transitions. [2018-02-02 20:38:45,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:38:45,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2018-02-02 20:38:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:45,149 INFO L225 Difference]: With dead ends: 350 [2018-02-02 20:38:45,149 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 20:38:45,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:38:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 20:38:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 310. [2018-02-02 20:38:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-02-02 20:38:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 368 transitions. [2018-02-02 20:38:45,151 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 368 transitions. Word has length 107 [2018-02-02 20:38:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:45,151 INFO L432 AbstractCegarLoop]: Abstraction has 310 states and 368 transitions. [2018-02-02 20:38:45,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:38:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 368 transitions. [2018-02-02 20:38:45,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-02 20:38:45,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:45,152 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:45,152 INFO L371 AbstractCegarLoop]: === Iteration 68 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash 714899973, now seen corresponding path program 1 times [2018-02-02 20:38:45,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:45,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 20:38:45,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:45,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:38:45,875 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:38:45,875 INFO L182 omatonBuilderFactory]: Interpolants [27014#true, 27015#false, 27016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 27017#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 27018#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 27019#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 27020#(and (= 1 (select |#valid| entry_point_~array~0.base)) (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 27021#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 27022#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (or (= 1 (select |#valid| entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0))) (= entry_point_~array~0.offset 0)), 27023#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (and (= 1 (select |#valid| entry_point_~array~0.base)) (= (* 4 entry_point_~len~0) (* 4 entry_point_~i~2))))), 27024#(and (= 1 (select |#valid| |alloc_17_#in~array.base|)) (= 0 |alloc_17_#in~array.offset|)), 27025#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 27026#(= |#valid| |old(#valid)|), 27027#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 27028#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 27029#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 27030#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 27031#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~i~0)))))), 27032#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 3) (and (<= (* 4 alloc_17_~i~0) 4) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 27033#(and (= alloc_17_~array.offset 0) (or (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) 7) (and (<= (* 4 alloc_17_~i~0) 8) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))))), 27034#(and (= alloc_17_~array.offset 0) (or (not (= alloc_17_~array.base (select (store (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0)) 0) 0))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3)) (<= alloc_17_~j~0 1)), 27035#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 1) (or (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset) 3) (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0))))), 27036#(and (or (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 1) 0)) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base)) (<= alloc_17_~j~0 0)), 27037#(and (not (= alloc_17_~array.base (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ alloc_17_~array.offset (* 4 alloc_17_~j~0))))) (= alloc_17_~array.offset 0) (= 0 (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset)) (= 1 (select |#valid| alloc_17_~array.base))), 27038#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 27039#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 20:38:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 6 proven. 136 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 20:38:45,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:38:45,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:38:45,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:45,876 INFO L87 Difference]: Start difference. First operand 310 states and 368 transitions. Second operand 26 states. [2018-02-02 20:38:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:46,494 INFO L93 Difference]: Finished difference Result 319 states and 374 transitions. [2018-02-02 20:38:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:38:46,494 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-02-02 20:38:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:46,495 INFO L225 Difference]: With dead ends: 319 [2018-02-02 20:38:46,495 INFO L226 Difference]: Without dead ends: 319 [2018-02-02 20:38:46,495 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 11 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=1658, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:38:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-02-02 20:38:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 306. [2018-02-02 20:38:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-02-02 20:38:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 363 transitions. [2018-02-02 20:38:46,497 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 363 transitions. Word has length 109 [2018-02-02 20:38:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:46,498 INFO L432 AbstractCegarLoop]: Abstraction has 306 states and 363 transitions. [2018-02-02 20:38:46,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:38:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 363 transitions. [2018-02-02 20:38:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 20:38:46,498 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:46,498 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:46,498 INFO L371 AbstractCegarLoop]: === Iteration 69 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2011462498, now seen corresponding path program 1 times [2018-02-02 20:38:46,499 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:46,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-02 20:38:46,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:46,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:38:46,566 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:38:46,566 INFO L182 omatonBuilderFactory]: Interpolants [27701#true, 27702#false, 27703#(<= 10 entry_point_~len~0), 27704#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 27705#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 27706#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 27707#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 3)), 27708#(<= |alloc_17_#in~len| 3)] [2018-02-02 20:38:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2018-02-02 20:38:46,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:38:46,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:38:46,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:46,567 INFO L87 Difference]: Start difference. First operand 306 states and 363 transitions. Second operand 8 states. [2018-02-02 20:38:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:46,644 INFO L93 Difference]: Finished difference Result 345 states and 405 transitions. [2018-02-02 20:38:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:38:46,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-02-02 20:38:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:46,645 INFO L225 Difference]: With dead ends: 345 [2018-02-02 20:38:46,645 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 20:38:46,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:38:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 20:38:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 312. [2018-02-02 20:38:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-02-02 20:38:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 369 transitions. [2018-02-02 20:38:46,647 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 369 transitions. Word has length 111 [2018-02-02 20:38:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:46,647 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 369 transitions. [2018-02-02 20:38:46,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:38:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 369 transitions. [2018-02-02 20:38:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 20:38:46,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:46,648 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 6, 6, 5, 5, 5, 5, 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 20:38:46,648 INFO L371 AbstractCegarLoop]: === Iteration 70 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:46,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1985906453, now seen corresponding path program 5 times [2018-02-02 20:38:46,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:46,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:38:47,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:47,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:38:47,288 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:47,288 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 20:38:47,288 INFO L182 omatonBuilderFactory]: Interpolants [28368#true, 28369#false, 28370#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 28371#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 28372#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 28373#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 28374#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10) (not (= 0 entry_point_~array~0.base))), 28375#(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))), 28376#(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)), 28377#(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)), 28378#(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)), 28379#(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)), 28380#(and (= 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) 20)) entry_point_~array~0.offset)) entry_point_~array~0.base))), 28381#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~2) 5) (* 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) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)))), 28382#(and (<= (+ (* 4 entry_point_~i~2) 4) (* 4 entry_point_~len~0)) (= entry_point_~array~0.offset 0) (or (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)) (<= (+ (* 4 entry_point_~i~2) 5) (* 4 entry_point_~len~0)))), 28383#(and (<= (* 4 entry_point_~i~2) (* 4 entry_point_~len~0)) (or (<= (+ (* 4 entry_point_~i~2) 1) (* 4 entry_point_~len~0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base))) (= entry_point_~array~0.offset 0)), 28384#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 16 entry_point_~array~0.offset)) entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 28385#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 28386#(and (not (= (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 16) |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 28387#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) 16) free_17_~array.base))), 28388#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) (+ free_17_~array.offset 12))) free_17_~array.base)) (= free_17_~array.offset 0)), 28389#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 8))) free_17_~array.base)) (= free_17_~array.offset 0)), 28390#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4))) free_17_~array.base)) (= free_17_~array.offset 0)), 28391#(and (not (= (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ free_17_~array.offset (* 4 free_17_~i~1))) free_17_~array.base)) (= free_17_~array.offset 0)), 28392#(and (not (= free_17_~array.base |free_17_#t~mem9.base|)) (= 1 (select |#valid| free_17_~array.base))), 28393#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 20:38:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 241 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-02-02 20:38:47,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:38:47,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:38:47,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:47,289 INFO L87 Difference]: Start difference. First operand 312 states and 369 transitions. Second operand 26 states. [2018-02-02 20:38:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:49,267 INFO L93 Difference]: Finished difference Result 326 states and 381 transitions. [2018-02-02 20:38:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:38:49,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2018-02-02 20:38:49,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:49,268 INFO L225 Difference]: With dead ends: 326 [2018-02-02 20:38:49,268 INFO L226 Difference]: Without dead ends: 326 [2018-02-02 20:38:49,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=445, Invalid=3715, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 20:38:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-02-02 20:38:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 317. [2018-02-02 20:38:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-02 20:38:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 375 transitions. [2018-02-02 20:38:49,271 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 375 transitions. Word has length 111 [2018-02-02 20:38:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:49,271 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 375 transitions. [2018-02-02 20:38:49,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:38:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 375 transitions. [2018-02-02 20:38:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-02 20:38:49,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:49,272 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:49,272 INFO L371 AbstractCegarLoop]: === Iteration 71 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1698028761, now seen corresponding path program 2 times [2018-02-02 20:38:49,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:49,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:38:49,328 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 20:38:49,332 INFO L168 Benchmark]: Toolchain (without parser) took 68662.81 ms. Allocated memory was 388.5 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 345.1 MB in the beginning and 1.3 GB in the end (delta: -915.8 MB). Peak memory consumption was 353.0 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:49,333 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 388.5 MB. Free memory is still 351.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:38:49,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.97 ms. Allocated memory is still 388.5 MB. Free memory was 345.1 MB in the beginning and 331.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:49,333 INFO L168 Benchmark]: Boogie Preprocessor took 28.90 ms. Allocated memory is still 388.5 MB. Free memory was 331.9 MB in the beginning and 330.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:49,333 INFO L168 Benchmark]: RCFGBuilder took 279.63 ms. Allocated memory is still 388.5 MB. Free memory was 330.6 MB in the beginning and 305.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:49,333 INFO L168 Benchmark]: TraceAbstraction took 68187.45 ms. Allocated memory was 388.5 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 305.2 MB in the beginning and 1.3 GB in the end (delta: -955.7 MB). Peak memory consumption was 313.1 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:49,335 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 388.5 MB. Free memory is still 351.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.97 ms. Allocated memory is still 388.5 MB. Free memory was 345.1 MB in the beginning and 331.9 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.90 ms. Allocated memory is still 388.5 MB. Free memory was 331.9 MB in the beginning and 330.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 279.63 ms. Allocated memory is still 388.5 MB. Free memory was 330.6 MB in the beginning and 305.2 MB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 68187.45 ms. Allocated memory was 388.5 MB in the beginning and 1.7 GB in the end (delta: 1.3 GB). Free memory was 305.2 MB in the beginning and 1.3 GB in the end (delta: -955.7 MB). Peak memory consumption was 313.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-38-49-341.csv Completed graceful shutdown