java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:18:37,547 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:18:37,548 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:18:37,561 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:18:37,561 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:18:37,561 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:18:37,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:18:37,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:18:37,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:18:37,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:18:37,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:18:37,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:18:37,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:18:37,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:18:37,569 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:18:37,571 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:18:37,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:18:37,574 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:18:37,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:18:37,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:18:37,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:18:37,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:18:37,577 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:18:37,578 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:18:37,579 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:18:37,580 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:18:37,580 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:18:37,580 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:18:37,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:18:37,581 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:18:37,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:18:37,581 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:18:37,589 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:18:37,590 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:18:37,590 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:18:37,590 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:18:37,591 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:18:37,591 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:18:37,592 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:18:37,592 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:18:37,592 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:18:37,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:18:37,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:18:37,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:18:37,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:18:37,592 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:18:37,592 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:18:37,593 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:18:37,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:18:37,626 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:18:37,628 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:18:37,629 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:18:37,629 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:18:37,630 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_false-valid-memtrack.i [2018-02-02 10:18:37,761 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:18:37,762 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:18:37,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:18:37,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:18:37,767 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:18:37,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdda15c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37, skipping insertion in model container [2018-02-02 10:18:37,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,781 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:18:37,818 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:18:37,919 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:18:37,935 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:18:37,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37 WrapperNode [2018-02-02 10:18:37,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:18:37,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:18:37,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:18:37,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:18:37,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... [2018-02-02 10:18:37,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:18:37,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:18:37,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:18:37,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:18:37,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:18:38,022 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:18:38,023 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:18:38,023 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:18:38,023 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:18:38,023 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 10:18:38,023 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:18:38,023 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:18:38,023 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:18:38,023 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:18:38,023 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:18:38,023 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:18:38,023 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:18:38,024 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:18:38,248 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:18:38,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:18:38 BoogieIcfgContainer [2018-02-02 10:18:38,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:18:38,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:18:38,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:18:38,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:18:38,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:18:37" (1/3) ... [2018-02-02 10:18:38,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d653473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:18:38, skipping insertion in model container [2018-02-02 10:18:38,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:18:37" (2/3) ... [2018-02-02 10:18:38,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d653473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:18:38, skipping insertion in model container [2018-02-02 10:18:38,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:18:38" (3/3) ... [2018-02-02 10:18:38,253 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-02-02 10:18:38,258 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:18:38,262 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 10:18:38,288 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:18:38,288 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:18:38,289 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:18:38,289 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:18:38,289 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:18:38,289 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:18:38,289 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:18:38,289 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:18:38,290 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:18:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-02-02 10:18:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:18:38,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:38,312 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:38,312 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]=== [2018-02-02 10:18:38,316 INFO L82 PathProgramCache]: Analyzing trace with hash 76531201, now seen corresponding path program 1 times [2018-02-02 10:18:38,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:38,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:38,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:18:38,481 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,482 INFO L182 omatonBuilderFactory]: Interpolants [76#true, 77#false, 78#(= |#valid| |old(#valid)|)] [2018-02-02 10:18:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:18:38,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:18:38,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:18:38,495 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 3 states. [2018-02-02 10:18:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:38,670 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2018-02-02 10:18:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:18:38,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:18:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:38,682 INFO L225 Difference]: With dead ends: 121 [2018-02-02 10:18:38,682 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:18:38,684 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:18:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:18:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-02 10:18:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:18:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2018-02-02 10:18:38,721 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 17 [2018-02-02 10:18:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:38,721 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2018-02-02 10:18:38,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:18:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2018-02-02 10:18:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:18:38,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:38,723 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:38,723 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]=== [2018-02-02 10:18:38,723 INFO L82 PathProgramCache]: Analyzing trace with hash 76544328, now seen corresponding path program 1 times [2018-02-02 10:18:38,724 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:38,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:38,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:18:38,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,794 INFO L182 omatonBuilderFactory]: Interpolants [299#true, 300#false, 301#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 302#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 303#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 10:18:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:18:38,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:18:38,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:38,796 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 5 states. [2018-02-02 10:18:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:38,816 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2018-02-02 10:18:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:18:38,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:18:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:38,819 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:18:38,819 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:18:38,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:18:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2018-02-02 10:18:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:18:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-02-02 10:18:38,826 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 17 [2018-02-02 10:18:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:38,827 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-02-02 10:18:38,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:18:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-02-02 10:18:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:18:38,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:38,828 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:38,828 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]=== [2018-02-02 10:18:38,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1178904547, now seen corresponding path program 1 times [2018-02-02 10:18:38,830 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:38,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:38,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:18:38,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,886 INFO L182 omatonBuilderFactory]: Interpolants [470#true, 471#false, 472#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 473#(not (= 0 |ldv_malloc_#res.base|)), 474#(not (= 0 |entry_point_#t~ret10.base|)), 475#(not (= 0 entry_point_~array~0.base))] [2018-02-02 10:18:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:18:38,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:18:38,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:38,887 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 6 states. [2018-02-02 10:18:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:38,929 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-02-02 10:18:38,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:18:38,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:18:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:38,930 INFO L225 Difference]: With dead ends: 72 [2018-02-02 10:18:38,930 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 10:18:38,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:18:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 10:18:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 10:18:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:18:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 10:18:38,934 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 19 [2018-02-02 10:18:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:38,934 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 10:18:38,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:18:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 10:18:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:18:38,934 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:38,935 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:38,935 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]=== [2018-02-02 10:18:38,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917674, now seen corresponding path program 1 times [2018-02-02 10:18:38,936 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:38,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:38,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:18:38,979 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,980 INFO L182 omatonBuilderFactory]: Interpolants [624#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 625#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 626#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 627#(= 1 (select |#valid| entry_point_~array~0.base)), 622#true, 623#false] [2018-02-02 10:18:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:38,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:18:38,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:18:38,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:38,980 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2018-02-02 10:18:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:39,041 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 10:18:39,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:18:39,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:18:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:39,042 INFO L225 Difference]: With dead ends: 71 [2018-02-02 10:18:39,042 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 10:18:39,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:18:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 10:18:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 10:18:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 10:18:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 10:18:39,045 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 10:18:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:39,045 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 10:18:39,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:18:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 10:18:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:18:39,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:39,046 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:39,046 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]=== [2018-02-02 10:18:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1178917675, now seen corresponding path program 1 times [2018-02-02 10:18:39,047 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:39,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:39,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:39,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:18:39,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:39,227 INFO L182 omatonBuilderFactory]: Interpolants [772#true, 773#false, 774#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 775#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 776#(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|)), 777#(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|))), 778#(and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 779#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 780#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0))] [2018-02-02 10:18:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:39,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:18:39,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:18:39,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:18:39,228 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 9 states. [2018-02-02 10:18:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:39,393 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 10:18:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:18:39,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 10:18:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:39,394 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:18:39,394 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:18:39,394 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 10:18:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:18:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-02-02 10:18:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:18:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 10:18:39,397 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 19 [2018-02-02 10:18:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:39,397 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 10:18:39,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:18:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 10:18:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:18:39,397 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:39,398 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:39,398 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]=== [2018-02-02 10:18:39,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1797942142, now seen corresponding path program 1 times [2018-02-02 10:18:39,398 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:39,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:39,622 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 10:18:39,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:39,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:18:39,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:39,624 INFO L182 omatonBuilderFactory]: Interpolants [944#(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)), 945#(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|)))), 946#(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)), 947#(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))), 948#(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)), 949#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 950#(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))), 940#true, 941#false, 942#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 943#(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)))] [2018-02-02 10:18:39,624 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 10:18:39,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:18:39,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:18:39,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:18:39,625 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 11 states. [2018-02-02 10:18:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:39,831 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-02-02 10:18:39,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:18:39,832 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:18:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:39,833 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:18:39,833 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:18:39,833 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 10:18:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:18:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-02-02 10:18:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:18:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-02-02 10:18:39,838 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 23 [2018-02-02 10:18:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:39,838 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-02-02 10:18:39,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:18:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-02-02 10:18:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:18:39,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:39,839 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 10:18:39,839 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]=== [2018-02-02 10:18:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1328269913, now seen corresponding path program 2 times [2018-02-02 10:18:39,841 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:39,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:40,029 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 10:18:40,030 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:40,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:18:40,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,030 INFO L182 omatonBuilderFactory]: Interpolants [1123#true, 1124#false, 1125#(<= entry_point_~len~0 10), 1126#(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))), 1127#(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)), 1128#(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|)))), 1129#(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)), 1130#(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))), 1131#(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))), 1132#(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))), 1133#(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)), 1134#(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))), 1135#(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)))] [2018-02-02 10:18:40,030 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 10:18:40,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:18:40,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:18:40,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:18:40,031 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 13 states. [2018-02-02 10:18:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:40,269 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-02 10:18:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:18:40,270 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 10:18:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:40,270 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:18:40,271 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 10:18:40,271 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 10:18:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 10:18:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-02-02 10:18:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:18:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-02 10:18:40,275 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 27 [2018-02-02 10:18:40,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:40,275 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-02 10:18:40,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:18:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-02 10:18:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:18:40,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:40,276 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 10:18:40,276 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]=== [2018-02-02 10:18:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1824994908, now seen corresponding path program 1 times [2018-02-02 10:18:40,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:40,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:40,330 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 10:18:40,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:40,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:18:40,330 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:40,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:40,331 INFO L182 omatonBuilderFactory]: Interpolants [1299#true, 1300#false, 1301#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1302#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1303#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:18:40,331 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 10:18:40,331 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:18:40,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:18:40,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:40,332 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 5 states. [2018-02-02 10:18:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:40,342 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-02-02 10:18:40,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:18:40,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:18:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:40,343 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:18:40,343 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:18:40,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:40,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:18:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-02 10:18:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:18:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-02-02 10:18:40,348 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 34 [2018-02-02 10:18:40,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:40,348 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-02-02 10:18:40,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:18:40,348 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-02-02 10:18:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:18:40,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:40,349 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 10:18:40,349 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]=== [2018-02-02 10:18:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1514452229, now seen corresponding path program 1 times [2018-02-02 10:18:40,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:40,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:40,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:18:40,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,392 INFO L182 omatonBuilderFactory]: Interpolants [1456#(= 1 (select |#valid| entry_point_~array~0.base)), 1457#(= |#valid| |old(#valid)|), 1458#(= 1 (select |#valid| |free_17_#in~array.base|)), 1459#(= 1 (select |#valid| free_17_~array.base)), 1454#true, 1455#false] [2018-02-02 10:18:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:18:40,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:18:40,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:40,393 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 6 states. [2018-02-02 10:18:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:40,538 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-02-02 10:18:40,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:18:40,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 10:18:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:40,540 INFO L225 Difference]: With dead ends: 117 [2018-02-02 10:18:40,540 INFO L226 Difference]: Without dead ends: 117 [2018-02-02 10:18:40,540 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 10:18:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-02 10:18:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2018-02-02 10:18:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-02 10:18:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2018-02-02 10:18:40,546 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 35 [2018-02-02 10:18:40,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:40,546 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2018-02-02 10:18:40,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:18:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2018-02-02 10:18:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:18:40,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:40,548 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 10:18:40,549 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]=== [2018-02-02 10:18:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1514452230, now seen corresponding path program 1 times [2018-02-02 10:18:40,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:40,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:40,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:18:40,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,601 INFO L182 omatonBuilderFactory]: Interpolants [1681#true, 1682#false, 1683#(<= 10 entry_point_~len~0), 1684#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1685#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 10:18:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:18:40,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:18:40,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:40,602 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2018-02-02 10:18:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:40,631 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2018-02-02 10:18:40,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:18:40,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:18:40,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:40,636 INFO L225 Difference]: With dead ends: 104 [2018-02-02 10:18:40,636 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 10:18:40,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 10:18:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-02-02 10:18:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 10:18:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2018-02-02 10:18:40,642 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 35 [2018-02-02 10:18:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:40,642 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2018-02-02 10:18:40,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:18:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2018-02-02 10:18:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:18:40,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:40,647 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 10:18:40,647 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]=== [2018-02-02 10:18:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1275207587, now seen corresponding path program 2 times [2018-02-02 10:18:40,648 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:40,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:40,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:18:40,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,693 INFO L182 omatonBuilderFactory]: Interpolants [1894#true, 1895#false, 1896#(<= 10 entry_point_~len~0), 1897#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1898#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1899#(<= (+ entry_point_~i~2 8) entry_point_~len~0)] [2018-02-02 10:18:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:18:40,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:18:40,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:40,694 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand 6 states. [2018-02-02 10:18:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:40,733 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2018-02-02 10:18:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:18:40,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 10:18:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:40,734 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:18:40,734 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:18:40,734 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:18:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:18:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-02 10:18:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:18:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-02-02 10:18:40,737 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-02-02 10:18:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:40,737 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-02-02 10:18:40,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:18:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-02-02 10:18:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:18:40,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:40,738 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 10:18:40,738 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]=== [2018-02-02 10:18:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash -336361420, now seen corresponding path program 3 times [2018-02-02 10:18:40,739 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:40,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:40,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:18:40,782 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,783 INFO L182 omatonBuilderFactory]: Interpolants [2118#true, 2119#false, 2120#(<= 10 entry_point_~len~0), 2121#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2122#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2123#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2124#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-02 10:18:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:18:40,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:18:40,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:18:40,783 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 7 states. [2018-02-02 10:18:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:40,818 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2018-02-02 10:18:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:18:40,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 10:18:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:40,819 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:18:40,819 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:18:40,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:18:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:18:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-02 10:18:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 10:18:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-02-02 10:18:40,823 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 43 [2018-02-02 10:18:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:40,823 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-02-02 10:18:40,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:18:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-02-02 10:18:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:18:40,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:40,824 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 10:18:40,824 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]=== [2018-02-02 10:18:40,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1586719883, now seen corresponding path program 4 times [2018-02-02 10:18:40,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:40,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:40,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:18:40,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,887 INFO L182 omatonBuilderFactory]: Interpolants [2353#true, 2354#false, 2355#(<= 10 entry_point_~len~0), 2356#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2357#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2358#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2359#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2360#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 10:18:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:40,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:18:40,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:18:40,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:18:40,888 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 8 states. [2018-02-02 10:18:40,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:40,948 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-02-02 10:18:40,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:18:40,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 10:18:40,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:40,950 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:18:40,950 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:18:40,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:18:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:18:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 10:18:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:18:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-02-02 10:18:40,954 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 47 [2018-02-02 10:18:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:40,955 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-02-02 10:18:40,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:18:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-02-02 10:18:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:18:40,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:40,956 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 10:18:40,956 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]=== [2018-02-02 10:18:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -76853918, now seen corresponding path program 5 times [2018-02-02 10:18:40,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:40,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:41,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:18:41,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,023 INFO L182 omatonBuilderFactory]: Interpolants [2599#true, 2600#false, 2601#(<= 10 entry_point_~len~0), 2602#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2603#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2604#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2605#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2606#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2607#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-02 10:18:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:18:41,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:18:41,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:18:41,024 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 9 states. [2018-02-02 10:18:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:41,106 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2018-02-02 10:18:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:18:41,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-02 10:18:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:41,109 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:18:41,109 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:18:41,109 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:18:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:18:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 10:18:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:18:41,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-02-02 10:18:41,113 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 51 [2018-02-02 10:18:41,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:41,113 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-02-02 10:18:41,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:18:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-02-02 10:18:41,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:18:41,114 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:41,114 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 10:18:41,114 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]=== [2018-02-02 10:18:41,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1255609671, now seen corresponding path program 6 times [2018-02-02 10:18:41,126 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:41,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:41,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:18:41,200 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,200 INFO L182 omatonBuilderFactory]: Interpolants [2864#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2865#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2856#true, 2857#false, 2858#(<= 10 entry_point_~len~0), 2859#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2860#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2861#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2862#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2863#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 10:18:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:18:41,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:18:41,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:18:41,201 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 10 states. [2018-02-02 10:18:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:41,283 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2018-02-02 10:18:41,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:18:41,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:18:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:41,285 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:18:41,285 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:18:41,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:18:41,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:18:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 10:18:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:18:41,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-02-02 10:18:41,289 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 55 [2018-02-02 10:18:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:41,289 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-02-02 10:18:41,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:18:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-02-02 10:18:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:18:41,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:41,290 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 10:18:41,290 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]=== [2018-02-02 10:18:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash -241564528, now seen corresponding path program 7 times [2018-02-02 10:18:41,291 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:41,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:41,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:18:41,376 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,376 INFO L182 omatonBuilderFactory]: Interpolants [3124#true, 3125#false, 3126#(<= 10 entry_point_~len~0), 3127#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3128#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3129#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3130#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3131#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3132#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3133#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3134#(<= (+ entry_point_~i~2 3) entry_point_~len~0)] [2018-02-02 10:18:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:18:41,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:18:41,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:18:41,377 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 11 states. [2018-02-02 10:18:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:41,460 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-02-02 10:18:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:18:41,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-02 10:18:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:41,462 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:18:41,462 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:18:41,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:18:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:18:41,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-02-02 10:18:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:18:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-02-02 10:18:41,466 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 59 [2018-02-02 10:18:41,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:41,467 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-02-02 10:18:41,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:18:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-02-02 10:18:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:18:41,468 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:41,468 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 10:18:41,468 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]=== [2018-02-02 10:18:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash -106145049, now seen corresponding path program 8 times [2018-02-02 10:18:41,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:41,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:41,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:18:41,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,572 INFO L182 omatonBuilderFactory]: Interpolants [3408#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3409#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3410#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3411#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3412#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3413#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3414#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3403#true, 3404#false, 3405#(<= 10 entry_point_~len~0), 3406#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3407#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 10:18:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:18:41,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:18:41,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:18:41,573 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 12 states. [2018-02-02 10:18:41,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:41,692 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2018-02-02 10:18:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:18:41,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 10:18:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:41,695 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:18:41,695 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:18:41,695 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 10:18:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:18:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-02 10:18:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:18:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2018-02-02 10:18:41,699 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 63 [2018-02-02 10:18:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:41,700 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2018-02-02 10:18:41,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:18:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2018-02-02 10:18:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:18:41,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:41,701 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 10:18:41,701 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]=== [2018-02-02 10:18:41,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1768795582, now seen corresponding path program 9 times [2018-02-02 10:18:41,702 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:41,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:41,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:18:41,801 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,801 INFO L182 omatonBuilderFactory]: Interpolants [3693#true, 3694#false, 3695#(<= 10 entry_point_~len~0), 3696#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3697#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3698#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3699#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3700#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3701#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3702#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3703#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3704#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3705#(<= (+ entry_point_~i~2 1) entry_point_~len~0)] [2018-02-02 10:18:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:18:41,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:18:41,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:18:41,801 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand 13 states. [2018-02-02 10:18:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:41,906 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-02-02 10:18:41,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:18:41,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-02-02 10:18:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:41,910 INFO L225 Difference]: With dead ends: 134 [2018-02-02 10:18:41,910 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 10:18:41,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:18:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 10:18:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-02-02 10:18:41,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:18:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 10:18:41,914 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 67 [2018-02-02 10:18:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:41,914 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 10:18:41,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:18:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 10:18:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:18:41,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:41,915 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 10:18:41,915 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]=== [2018-02-02 10:18:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1609843435, now seen corresponding path program 10 times [2018-02-02 10:18:41,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:41,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:18:41,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:41,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:18:41,972 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:41,972 INFO L182 omatonBuilderFactory]: Interpolants [3992#true, 3993#false, 3994#(<= 10 entry_point_~len~0), 3995#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 3996#(<= |alloc_17_#in~len| 0)] [2018-02-02 10:18:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 10:18:41,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:18:41,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:18:41,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:41,973 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 5 states. [2018-02-02 10:18:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:41,997 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-02-02 10:18:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:18:41,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-02-02 10:18:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:41,998 INFO L225 Difference]: With dead ends: 159 [2018-02-02 10:18:41,998 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:18:41,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:18:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 133. [2018-02-02 10:18:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 10:18:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-02-02 10:18:42,002 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 71 [2018-02-02 10:18:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:42,003 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-02-02 10:18:42,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:18:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-02-02 10:18:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:18:42,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:42,003 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:42,003 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]=== [2018-02-02 10:18:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863145, now seen corresponding path program 1 times [2018-02-02 10:18:42,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:42,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:18:42,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:42,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:18:42,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:42,249 INFO L182 omatonBuilderFactory]: Interpolants [4291#true, 4292#false, 4293#(<= 10 entry_point_~len~0), 4294#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4295#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4296#(and (<= 10 entry_point_~len~0) (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 4297#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4298#(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)), 4299#(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)), 4300#(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)), 4301#(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)), 4302#(and (<= 36 (select |#length| |alloc_17_#in~array.base|)) (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 4303#(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))), 4304#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 4305#(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|))), 4306#(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|))))), 4307#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (<= 36 (select |#length| alloc_17_~array.base)))] [2018-02-02 10:18:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-02-02 10:18:42,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:18:42,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:18:42,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:18:42,250 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 17 states. [2018-02-02 10:18:42,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:42,811 INFO L93 Difference]: Finished difference Result 202 states and 221 transitions. [2018-02-02 10:18:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:18:42,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-02-02 10:18:42,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:42,812 INFO L225 Difference]: With dead ends: 202 [2018-02-02 10:18:42,812 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:18:42,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:18:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:18:42,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2018-02-02 10:18:42,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 10:18:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2018-02-02 10:18:42,816 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 72 [2018-02-02 10:18:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:42,816 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-02-02 10:18:42,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:18:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2018-02-02 10:18:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:18:42,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:42,816 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:42,817 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]=== [2018-02-02 10:18:42,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2145863146, now seen corresponding path program 1 times [2018-02-02 10:18:42,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:42,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:42,951 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 10:18:42,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:42,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:18:42,951 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:42,952 INFO L182 omatonBuilderFactory]: Interpolants [4688#(= 1 (select |#valid| entry_point_~array~0.base)), 4689#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 4690#(= 1 (select |#valid| alloc_17_~array.base)), 4691#(= |#valid| |old(#valid)|), 4692#(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|)), 4693#(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|))))), 4683#true, 4684#false, 4685#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4686#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4687#(= 1 (select |#valid| |entry_point_#t~ret10.base|))] [2018-02-02 10:18:42,952 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 10:18:42,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:18:42,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:18:42,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:18:42,953 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 11 states. [2018-02-02 10:18:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:43,177 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2018-02-02 10:18:43,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:18:43,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-02-02 10:18:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:43,178 INFO L225 Difference]: With dead ends: 193 [2018-02-02 10:18:43,178 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:18:43,178 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 10:18:43,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:18:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2018-02-02 10:18:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:18:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-02-02 10:18:43,182 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 72 [2018-02-02 10:18:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:43,182 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-02-02 10:18:43,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:18:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-02-02 10:18:43,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 10:18:43,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:43,183 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 10:18:43,183 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]=== [2018-02-02 10:18:43,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1300106032, now seen corresponding path program 1 times [2018-02-02 10:18:43,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:43,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:18:43,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:43,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:18:43,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:43,226 INFO L182 omatonBuilderFactory]: Interpolants [5035#true, 5036#false, 5037#(= alloc_17_~i~0 0), 5038#(<= (+ alloc_17_~j~0 1) 0)] [2018-02-02 10:18:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:18:43,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:18:43,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:18:43,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:18:43,227 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 4 states. [2018-02-02 10:18:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:43,250 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2018-02-02 10:18:43,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:18:43,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-02-02 10:18:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:43,253 INFO L225 Difference]: With dead ends: 143 [2018-02-02 10:18:43,253 INFO L226 Difference]: Without dead ends: 143 [2018-02-02 10:18:43,253 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-02 10:18:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-02-02 10:18:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:18:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-02 10:18:43,256 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 73 [2018-02-02 10:18:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:43,257 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-02 10:18:43,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:18:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-02 10:18:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 10:18:43,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:43,258 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:43,258 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]=== [2018-02-02 10:18:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1928926345, now seen corresponding path program 1 times [2018-02-02 10:18:43,259 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:43,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:43,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 10:18:43,421 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:43,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:18:43,422 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:43,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 10:18:43,422 INFO L182 omatonBuilderFactory]: Interpolants [5321#true, 5322#false, 5323#(= 0 |ldv_malloc_#t~malloc1.offset|), 5324#(= 0 |ldv_malloc_#res.offset|), 5325#(= 0 |entry_point_#t~ret10.offset|), 5326#(= entry_point_~array~0.offset 0), 5327#(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)), 5328#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5329#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 5330#(= |old(#length)| |#length|), 5331#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 5332#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 5333#(and (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0))] [2018-02-02 10:18:43,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 10:18:43,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:18:43,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:18:43,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:18:43,423 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 13 states. [2018-02-02 10:18:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:43,670 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2018-02-02 10:18:43,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:18:43,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-02-02 10:18:43,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:43,671 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:18:43,671 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:18:43,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:18:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:18:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2018-02-02 10:18:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-02-02 10:18:43,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2018-02-02 10:18:43,674 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 81 [2018-02-02 10:18:43,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:43,674 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2018-02-02 10:18:43,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:18:43,674 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2018-02-02 10:18:43,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:18:43,674 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:43,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] [2018-02-02 10:18:43,674 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]=== [2018-02-02 10:18:43,675 INFO L82 PathProgramCache]: Analyzing trace with hash 332825470, now seen corresponding path program 1 times [2018-02-02 10:18:43,675 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:43,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:44,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:44,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:18:44,632 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:44,632 INFO L182 omatonBuilderFactory]: Interpolants [5664#(= 0 |free_17_#t~mem9.offset|), 5641#true, 5642#false, 5643#(<= entry_point_~len~0 10), 5644#(= 0 |ldv_malloc_#t~malloc1.offset|), 5645#(= 0 |ldv_malloc_#res.offset|), 5646#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 5647#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 5648#(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))), 5649#(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))))))), 5650#(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)))), 5651#(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)))), 5652#(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))), 5653#(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)))), 5654#(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))), 5655#(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)))), 5656#(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))), 5657#(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)))), 5658#(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)))), 5659#(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))), 5660#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 5661#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 5662#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 0))), 5663#(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)))))] [2018-02-02 10:18:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:44,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:18:44,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:18:44,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:18:44,633 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand 24 states. [2018-02-02 10:18:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:45,390 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-02-02 10:18:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:18:45,390 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 10:18:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:45,391 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:18:45,391 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:18:45,392 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=1750, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:18:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:18:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 158. [2018-02-02 10:18:45,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:18:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2018-02-02 10:18:45,397 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 82 [2018-02-02 10:18:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:45,397 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2018-02-02 10:18:45,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:18:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2018-02-02 10:18:45,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 10:18:45,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:45,399 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:45,399 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]=== [2018-02-02 10:18:45,399 INFO L82 PathProgramCache]: Analyzing trace with hash 332825471, now seen corresponding path program 1 times [2018-02-02 10:18:45,400 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:45,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:46,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:46,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:18:46,296 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:46,296 INFO L182 omatonBuilderFactory]: Interpolants [6048#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 6049#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 6050#(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))), 6051#(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)))), 6052#(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)))), 6053#(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)))), 6054#(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))), 6055#(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)))), 6056#(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))), 6057#(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)))), 6058#(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)))), 6059#(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)))), 6060#(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)))), 6061#(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))), 6062#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= 0 entry_point_~array~0.offset)), 6063#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 6064#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 0)) (= 0 |free_17_#in~array.offset|)), 6065#(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)), 6066#(= |free_17_#t~mem9.base| 0), 6043#true, 6044#false, 6045#(<= entry_point_~len~0 10), 6046#(= 0 |ldv_malloc_#t~malloc1.offset|), 6047#(= 0 |ldv_malloc_#res.offset|)] [2018-02-02 10:18:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 114 proven. 88 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:46,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:18:46,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:18:46,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:18:46,297 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand 24 states. [2018-02-02 10:18:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:47,082 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2018-02-02 10:18:47,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:18:47,083 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 82 [2018-02-02 10:18:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:47,084 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:18:47,084 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:18:47,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 10:18:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:18:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 158. [2018-02-02 10:18:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-02-02 10:18:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 181 transitions. [2018-02-02 10:18:47,089 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 181 transitions. Word has length 82 [2018-02-02 10:18:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:47,089 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 181 transitions. [2018-02-02 10:18:47,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:18:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 181 transitions. [2018-02-02 10:18:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 10:18:47,090 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:47,090 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:47,090 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]=== [2018-02-02 10:18:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1452983252, now seen corresponding path program 1 times [2018-02-02 10:18:47,091 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:47,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:47,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 10:18:47,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:47,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:18:47,133 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:47,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 10:18:47,133 INFO L182 omatonBuilderFactory]: Interpolants [6440#true, 6441#false, 6442#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 6443#(not (= 0 |ldv_malloc_#res.base|)), 6444#(not (= 0 |alloc_17_#t~ret3.base|)), 6445#(not (= 0 alloc_17_~p~0.base))] [2018-02-02 10:18:47,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 10:18:47,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:18:47,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:18:47,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:47,134 INFO L87 Difference]: Start difference. First operand 158 states and 181 transitions. Second operand 6 states. [2018-02-02 10:18:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:47,158 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2018-02-02 10:18:47,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:18:47,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-02-02 10:18:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:47,159 INFO L225 Difference]: With dead ends: 139 [2018-02-02 10:18:47,159 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 10:18:47,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:18:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 10:18:47,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-02-02 10:18:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:18:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2018-02-02 10:18:47,163 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 83 [2018-02-02 10:18:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:47,163 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2018-02-02 10:18:47,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:18:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2018-02-02 10:18:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 10:18:47,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:47,164 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 10:18:47,164 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]=== [2018-02-02 10:18:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash 558282765, now seen corresponding path program 1 times [2018-02-02 10:18:47,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:47,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:18:47,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:47,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:18:47,241 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:18:47,241 INFO L182 omatonBuilderFactory]: Interpolants [6726#true, 6727#false, 6728#(= alloc_17_~array.base |alloc_17_#in~array.base|), 6729#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 6730#(= 1 (select |#valid| entry_point_~array~0.base)), 6731#(= 1 (select |#valid| |free_17_#in~array.base|)), 6732#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:18:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:18:47,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:18:47,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:18:47,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:18:47,242 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 7 states. [2018-02-02 10:18:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:47,337 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2018-02-02 10:18:47,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:18:47,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-02-02 10:18:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:47,338 INFO L225 Difference]: With dead ends: 158 [2018-02-02 10:18:47,338 INFO L226 Difference]: Without dead ends: 158 [2018-02-02 10:18:47,338 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 10:18:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-02 10:18:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-02-02 10:18:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:18:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2018-02-02 10:18:47,342 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 84 [2018-02-02 10:18:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:47,342 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2018-02-02 10:18:47,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:18:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2018-02-02 10:18:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 10:18:47,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:47,343 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 10:18:47,343 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]=== [2018-02-02 10:18:47,343 INFO L82 PathProgramCache]: Analyzing trace with hash 558282766, now seen corresponding path program 1 times [2018-02-02 10:18:47,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:47,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:18:47,398 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:47,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:18:47,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:18:47,399 INFO L182 omatonBuilderFactory]: Interpolants [7045#true, 7046#false, 7047#(<= 10 entry_point_~len~0), 7048#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 7049#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 7050#(<= |alloc_17_#in~len| 1)] [2018-02-02 10:18:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:18:47,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:18:47,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:18:47,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:47,399 INFO L87 Difference]: Start difference. First operand 150 states and 167 transitions. Second operand 6 states. [2018-02-02 10:18:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:47,435 INFO L93 Difference]: Finished difference Result 185 states and 206 transitions. [2018-02-02 10:18:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:18:47,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2018-02-02 10:18:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:47,436 INFO L225 Difference]: With dead ends: 185 [2018-02-02 10:18:47,436 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:18:47,437 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:18:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:18:47,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2018-02-02 10:18:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-02 10:18:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2018-02-02 10:18:47,440 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 84 [2018-02-02 10:18:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:47,441 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2018-02-02 10:18:47,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:18:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2018-02-02 10:18:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:18:47,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:47,441 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:47,441 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]=== [2018-02-02 10:18:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash 641539646, now seen corresponding path program 1 times [2018-02-02 10:18:47,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:47,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:18:47,768 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:47,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:18:47,768 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:18:47,769 INFO L182 omatonBuilderFactory]: Interpolants [7392#false, 7393#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 7394#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7395#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 7396#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 7397#(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)), 7398#(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)), 7399#(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)), 7400#(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|)), 7401#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~array.offset 0)), 7402#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7403#(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|))), 7404#(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|))))), 7405#(and (<= (* 4 alloc_17_~len) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 7406#(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)), 7407#(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)), 7408#(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)), 7409#(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)), 7391#true] [2018-02-02 10:18:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 37 proven. 10 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-02-02 10:18:47,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:18:47,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:18:47,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:18:47,769 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand 19 states. [2018-02-02 10:18:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:48,479 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2018-02-02 10:18:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:18:48,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 85 [2018-02-02 10:18:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:48,480 INFO L225 Difference]: With dead ends: 196 [2018-02-02 10:18:48,480 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 10:18:48,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=1029, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:18:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 10:18:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 156. [2018-02-02 10:18:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-02-02 10:18:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 174 transitions. [2018-02-02 10:18:48,485 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 174 transitions. Word has length 85 [2018-02-02 10:18:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:48,485 INFO L432 AbstractCegarLoop]: Abstraction has 156 states and 174 transitions. [2018-02-02 10:18:48,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:18:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 174 transitions. [2018-02-02 10:18:48,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 10:18:48,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:48,486 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] [2018-02-02 10:18:48,486 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]=== [2018-02-02 10:18:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1920478082, now seen corresponding path program 1 times [2018-02-02 10:18:48,487 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:48,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:18:48,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:18:48,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:18:48,568 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:48,569 INFO L182 omatonBuilderFactory]: Interpolants [7794#true, 7795#false, 7796#(<= 10 entry_point_~len~0), 7797#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 7798#(<= |free_17_#in~len| 0)] [2018-02-02 10:18:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:18:48,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:18:48,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:18:48,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:18:48,569 INFO L87 Difference]: Start difference. First operand 156 states and 174 transitions. Second operand 5 states. [2018-02-02 10:18:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:48,593 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2018-02-02 10:18:48,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:18:48,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-02-02 10:18:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:48,595 INFO L225 Difference]: With dead ends: 168 [2018-02-02 10:18:48,595 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 10:18:48,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 10:18:48,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-02-02 10:18:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 10:18:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2018-02-02 10:18:48,599 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 85 [2018-02-02 10:18:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:48,599 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2018-02-02 10:18:48,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:18:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2018-02-02 10:18:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 10:18:48,600 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:48,600 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:48,600 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]=== [2018-02-02 10:18:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1810246633, now seen corresponding path program 1 times [2018-02-02 10:18:48,601 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:48,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:18:48,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:48,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:18:48,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:18:48,742 INFO L182 omatonBuilderFactory]: Interpolants [8128#(= alloc_17_~array.offset 0), 8129#(and (= alloc_17_~array.offset 0) (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base))), 8130#(and (<= (+ (* 4 alloc_17_~i~0) alloc_17_~array.offset) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8131#(= |old(#length)| |#length|), 8132#(and (<= (+ (* 4 alloc_17_~j~0) alloc_17_~array.offset 4) (select |#length| alloc_17_~array.base)) (= alloc_17_~array.offset 0)), 8133#(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)), 8121#true, 8122#false, 8123#(= 0 |ldv_malloc_#t~malloc1.offset|), 8124#(= 0 |ldv_malloc_#res.offset|), 8125#(= 0 |entry_point_#t~ret10.offset|), 8126#(= 0 entry_point_~array~0.offset), 8127#(= 0 |alloc_17_#in~array.offset|)] [2018-02-02 10:18:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:18:48,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:18:48,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:18:48,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:18:48,743 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand 13 states. [2018-02-02 10:18:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:48,936 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2018-02-02 10:18:48,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:18:48,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-02-02 10:18:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:48,937 INFO L225 Difference]: With dead ends: 152 [2018-02-02 10:18:48,937 INFO L226 Difference]: Without dead ends: 152 [2018-02-02 10:18:48,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:18:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-02 10:18:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-02-02 10:18:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 10:18:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2018-02-02 10:18:48,941 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 86 [2018-02-02 10:18:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:48,941 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2018-02-02 10:18:48,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:18:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2018-02-02 10:18:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:18:48,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:48,942 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:48,942 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]=== [2018-02-02 10:18:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash 283070766, now seen corresponding path program 1 times [2018-02-02 10:18:48,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:48,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:18:49,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:49,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:18:49,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:18:49,201 INFO L182 omatonBuilderFactory]: Interpolants [8455#true, 8456#false, 8457#(= 0 |ldv_malloc_#t~malloc1.offset|), 8458#(= 0 |ldv_malloc_#res.offset|), 8459#(= 0 |entry_point_#t~ret10.offset|), 8460#(= 0 entry_point_~array~0.offset), 8461#(= 0 |alloc_17_#in~array.offset|), 8462#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8463#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 8464#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 8465#(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))))), 8466#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) 0))), 8467#(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)), 8468#(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))))), 8469#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-02 10:18:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 10:18:49,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:18:49,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:18:49,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:18:49,202 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand 15 states. [2018-02-02 10:18:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:49,458 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2018-02-02 10:18:49,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:18:49,458 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 10:18:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:49,458 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:18:49,459 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:18:49,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:18:49,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:18:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2018-02-02 10:18:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 10:18:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2018-02-02 10:18:49,461 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 87 [2018-02-02 10:18:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:49,462 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2018-02-02 10:18:49,462 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:18:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2018-02-02 10:18:49,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:18:49,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:49,462 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:49,463 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]=== [2018-02-02 10:18:49,463 INFO L82 PathProgramCache]: Analyzing trace with hash 283070767, now seen corresponding path program 1 times [2018-02-02 10:18:49,463 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:49,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:18:49,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:49,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:18:49,740 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:18:49,740 INFO L182 omatonBuilderFactory]: Interpolants [8832#(= 0 |ldv_malloc_#t~malloc1.offset|), 8833#(= 0 |ldv_malloc_#res.offset|), 8834#(= 0 |entry_point_#t~ret10.offset|), 8835#(= 0 entry_point_~array~0.offset), 8836#(= 0 |alloc_17_#in~array.offset|), 8837#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8838#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 8839#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 8840#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 8841#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 8842#(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)))))), 8843#(and (<= alloc_17_~i~0 1) (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) 0)))), 8844#(= |#valid| |old(#valid)|), 8845#(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)), 8846#(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)))))), 8847#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 8830#true, 8831#false] [2018-02-02 10:18:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 10:18:49,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:18:49,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:18:49,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:18:49,741 INFO L87 Difference]: Start difference. First operand 163 states and 184 transitions. Second operand 18 states. [2018-02-02 10:18:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:50,125 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2018-02-02 10:18:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:18:50,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2018-02-02 10:18:50,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:50,126 INFO L225 Difference]: With dead ends: 174 [2018-02-02 10:18:50,126 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 10:18:50,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:18:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 10:18:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2018-02-02 10:18:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 10:18:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2018-02-02 10:18:50,129 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 87 [2018-02-02 10:18:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:50,129 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2018-02-02 10:18:50,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:18:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2018-02-02 10:18:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:18:50,130 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:50,130 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:50,130 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]=== [2018-02-02 10:18:50,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1189582988, now seen corresponding path program 1 times [2018-02-02 10:18:50,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:50,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:50,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 10:18:50,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:50,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:18:50,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:50,942 INFO L182 omatonBuilderFactory]: Interpolants [9216#(= 0 |ldv_malloc_#t~malloc1.offset|), 9217#(= 0 |ldv_malloc_#res.offset|), 9218#(and (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 9219#(and (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 9220#(and (or (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) 0) (<= entry_point_~len~0 10)) (= 0 entry_point_~array~0.offset)), 9221#(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))))))), 9222#(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)))), 9223#(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)))), 9224#(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)))), 9225#(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)))), 9226#(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)))), 9227#(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)))), 9228#(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)))), 9229#(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)), 9230#(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)))), 9231#(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))), 9232#(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)), 9233#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 9234#(= |#valid| |old(#valid)|), 9235#(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|))), 9236#(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))), 9237#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 9238#(= 1 (select |#valid| free_17_~array.base)), 9213#true, 9214#false, 9215#(<= entry_point_~len~0 10)] [2018-02-02 10:18:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 116 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:50,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:18:50,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:18:50,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:18:50,943 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand 26 states. [2018-02-02 10:18:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:51,830 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2018-02-02 10:18:51,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:18:51,830 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 87 [2018-02-02 10:18:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:51,830 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:18:51,830 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:18:51,831 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 10:18:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:18:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2018-02-02 10:18:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:18:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2018-02-02 10:18:51,834 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 87 [2018-02-02 10:18:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:51,834 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2018-02-02 10:18:51,834 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:18:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2018-02-02 10:18:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 10:18:51,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:51,835 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:51,835 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]=== [2018-02-02 10:18:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1189582989, now seen corresponding path program 1 times [2018-02-02 10:18:51,836 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:51,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:18:52,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:52,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 10:18:52,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:18:52,028 INFO L182 omatonBuilderFactory]: Interpolants [9637#true, 9638#false, 9639#(= 0 |ldv_malloc_#t~malloc1.offset|), 9640#(= 0 |ldv_malloc_#res.offset|), 9641#(= 0 |entry_point_#t~ret10.offset|), 9642#(= entry_point_~array~0.offset 0), 9643#(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)), 9644#(and (<= (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9645#(and (<= (+ (* 4 entry_point_~len~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 9646#(= |old(#length)| |#length|), 9647#(and (<= (* 4 |free_17_#in~len|) (select |#length| |free_17_#in~array.base|)) (= 0 |free_17_#in~array.offset|)), 9648#(and (<= (* 4 free_17_~len) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0)), 9649#(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)), 9650#(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)), 9651#(and (<= 4 (+ (* 4 free_17_~i~1) free_17_~array.offset)) (<= (+ (* 4 free_17_~i~1) 4) (select |#length| free_17_~array.base)) (= free_17_~array.offset 0))] [2018-02-02 10:18:52,028 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 10:18:52,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 10:18:52,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 10:18:52,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:18:52,029 INFO L87 Difference]: Start difference. First operand 170 states and 193 transitions. Second operand 15 states. [2018-02-02 10:18:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:52,248 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2018-02-02 10:18:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:18:52,249 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2018-02-02 10:18:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:52,249 INFO L225 Difference]: With dead ends: 175 [2018-02-02 10:18:52,249 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 10:18:52,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:18:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 10:18:52,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2018-02-02 10:18:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:18:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2018-02-02 10:18:52,252 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 87 [2018-02-02 10:18:52,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:52,252 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-02-02 10:18:52,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 10:18:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2018-02-02 10:18:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:18:52,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:52,253 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:52,253 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]=== [2018-02-02 10:18:52,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1777632984, now seen corresponding path program 1 times [2018-02-02 10:18:52,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:52,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:18:53,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:53,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:18:53,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:53,090 INFO L182 omatonBuilderFactory]: Interpolants [10011#true, 10012#false, 10013#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10014#(= 0 |ldv_malloc_#t~malloc1.offset|), 10015#(= 0 |ldv_malloc_#res.offset|), 10016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10017#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10018#(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)), 10019#(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)), 10020#(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)), 10021#(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)), 10022#(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)))))), 10023#(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)))))), 10024#(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)))))), 10025#(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)), 10026#(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))))))), 10027#(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))), 10028#(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)), 10029#(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))), 10030#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4)))), 10031#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 10032#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 4)) (= 0 |free_17_#in~array.offset|)), 10033#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 4))), 10034#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10035#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 10:18:53,091 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:18:53,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:18:53,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:18:53,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:18:53,091 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 25 states. [2018-02-02 10:18:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:55,393 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2018-02-02 10:18:55,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:18:55,393 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 10:18:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:55,394 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:18:55,394 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:18:55,395 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 10:18:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:18:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2018-02-02 10:18:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:18:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2018-02-02 10:18:55,399 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 88 [2018-02-02 10:18:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:55,399 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2018-02-02 10:18:55,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:18:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2018-02-02 10:18:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 10:18:55,400 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:55,400 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:55,400 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]=== [2018-02-02 10:18:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1777632983, now seen corresponding path program 1 times [2018-02-02 10:18:55,401 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:55,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:18:56,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:56,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:18:56,243 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:56,244 INFO L182 omatonBuilderFactory]: Interpolants [10469#true, 10470#false, 10471#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 10472#(= 0 |ldv_malloc_#t~malloc1.offset|), 10473#(= 0 |ldv_malloc_#res.offset|), 10474#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 10475#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 10476#(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)), 10477#(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)), 10478#(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)), 10479#(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)), 10480#(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)))), 10481#(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)), 10482#(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)), 10483#(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)), 10484#(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)))), 10485#(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)))), 10486#(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)), 10487#(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))))), 10488#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 4 entry_point_~array~0.offset)))), 10489#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 10490#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 10491#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 10492#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 10493#(= |free_17_#t~mem9.base| 0)] [2018-02-02 10:18:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 1 proven. 202 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 10:18:56,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:18:56,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:18:56,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:18:56,245 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand 25 states. [2018-02-02 10:18:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:58,688 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2018-02-02 10:18:58,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:18:58,689 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-02-02 10:18:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:58,689 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:18:58,689 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:18:58,690 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 10:18:58,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:18:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2018-02-02 10:18:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:18:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2018-02-02 10:18:58,692 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 88 [2018-02-02 10:18:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:58,692 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2018-02-02 10:18:58,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:18:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2018-02-02 10:18:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 10:18:58,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:58,693 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 10:18:58,693 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]=== [2018-02-02 10:18:58,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1448067279, now seen corresponding path program 1 times [2018-02-02 10:18:58,694 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:58,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:58,982 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 10:18:58,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:58,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:18:58,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:58,982 INFO L182 omatonBuilderFactory]: Interpolants [10920#true, 10921#false, 10922#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 10923#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 10924#(and (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 10925#(and (= 0 entry_point_~array~0.offset) (= (select |#valid| entry_point_~array~0.base) 1)), 10926#(and (= (select |#valid| |alloc_17_#in~array.base|) 1) (= 0 |alloc_17_#in~array.offset|)), 10927#(and (= (select |#valid| alloc_17_~array.base) 1) (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 10928#(= |#valid| |old(#valid)|), 10929#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10930#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10931#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 10932#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 10933#(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)))))), 10934#(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)))), 10935#(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)), 10936#(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))), 10937#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 10938#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:18:58,983 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 10:18:58,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:18:58,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:18:58,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:18:58,983 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 19 states. [2018-02-02 10:18:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:59,329 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2018-02-02 10:18:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:18:59,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-02-02 10:18:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:59,330 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:18:59,330 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:18:59,330 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 10:18:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:18:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2018-02-02 10:18:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-02-02 10:18:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 194 transitions. [2018-02-02 10:18:59,333 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 194 transitions. Word has length 89 [2018-02-02 10:18:59,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:59,333 INFO L432 AbstractCegarLoop]: Abstraction has 173 states and 194 transitions. [2018-02-02 10:18:59,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:18:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 194 transitions. [2018-02-02 10:18:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 10:18:59,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:59,333 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] [2018-02-02 10:18:59,333 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]=== [2018-02-02 10:18:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -562035052, now seen corresponding path program 1 times [2018-02-02 10:18:59,334 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:59,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:18:59,392 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:59,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:18:59,393 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:18:59,393 INFO L182 omatonBuilderFactory]: Interpolants [11312#true, 11313#false, 11314#(<= 10 entry_point_~len~0), 11315#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 11316#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 11317#(<= |free_17_#in~len| 1)] [2018-02-02 10:18:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:18:59,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:18:59,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:18:59,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:18:59,394 INFO L87 Difference]: Start difference. First operand 173 states and 194 transitions. Second operand 6 states. [2018-02-02 10:18:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:59,420 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2018-02-02 10:18:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:18:59,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-02-02 10:18:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:59,422 INFO L225 Difference]: With dead ends: 197 [2018-02-02 10:18:59,422 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 10:18:59,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:18:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 10:18:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-02-02 10:18:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 10:18:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 203 transitions. [2018-02-02 10:18:59,425 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 203 transitions. Word has length 91 [2018-02-02 10:18:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:59,426 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 203 transitions. [2018-02-02 10:18:59,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:18:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 203 transitions. [2018-02-02 10:18:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:18:59,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:59,427 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:59,427 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]=== [2018-02-02 10:18:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1992508207, now seen corresponding path program 1 times [2018-02-02 10:18:59,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:59,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:18:59,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:59,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:18:59,479 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:18:59,479 INFO L182 omatonBuilderFactory]: Interpolants [11696#true, 11697#false, 11698#(= alloc_17_~array.base |alloc_17_#in~array.base|), 11699#(= 1 (select |#valid| |alloc_17_#in~array.base|)), 11700#(= |#valid| |old(#valid)|), 11701#(= 1 (select |#valid| entry_point_~array~0.base)), 11702#(= 1 (select |#valid| |free_17_#in~array.base|)), 11703#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:18:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 10:18:59,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:18:59,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:18:59,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:18:59,480 INFO L87 Difference]: Start difference. First operand 179 states and 203 transitions. Second operand 8 states. [2018-02-02 10:18:59,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:59,588 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2018-02-02 10:18:59,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:18:59,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-02-02 10:18:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:59,589 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:18:59,589 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:18:59,589 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 10:18:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:18:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2018-02-02 10:18:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 10:18:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-02-02 10:18:59,592 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 94 [2018-02-02 10:18:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:59,593 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-02-02 10:18:59,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:18:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-02-02 10:18:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:18:59,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:59,593 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:59,594 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]=== [2018-02-02 10:18:59,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1992508208, now seen corresponding path program 1 times [2018-02-02 10:18:59,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:59,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:18:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:18:59,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:18:59,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:18:59,685 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:18:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:18:59,686 INFO L182 omatonBuilderFactory]: Interpolants [12064#true, 12065#false, 12066#(= 0 |ldv_malloc_#t~malloc1.offset|), 12067#(= 0 |ldv_malloc_#res.offset|), 12068#(= 0 |entry_point_#t~ret10.offset|), 12069#(= 0 entry_point_~array~0.offset), 12070#(or (= alloc_17_~array.offset 0) (= |alloc_17_#in~array.offset| alloc_17_~array.offset)), 12071#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 0 alloc_17_~i~0)), 12072#(or (not (= |alloc_17_#in~array.offset| 0)) (<= 1 alloc_17_~i~0)), 12073#(or (<= 0 alloc_17_~j~0) (not (= |alloc_17_#in~array.offset| 0))), 12074#(not (= |alloc_17_#in~array.offset| 0))] [2018-02-02 10:18:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2018-02-02 10:18:59,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:18:59,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:18:59,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:18:59,687 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 11 states. [2018-02-02 10:18:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:18:59,788 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2018-02-02 10:18:59,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:18:59,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-02-02 10:18:59,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:18:59,789 INFO L225 Difference]: With dead ends: 173 [2018-02-02 10:18:59,789 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 10:18:59,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:18:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 10:18:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-02-02 10:18:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 10:18:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 189 transitions. [2018-02-02 10:18:59,792 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 189 transitions. Word has length 94 [2018-02-02 10:18:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:18:59,792 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 189 transitions. [2018-02-02 10:18:59,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:18:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 189 transitions. [2018-02-02 10:18:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 10:18:59,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:18:59,793 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:18:59,793 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]=== [2018-02-02 10:18:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 983276834, now seen corresponding path program 2 times [2018-02-02 10:18:59,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:18:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:18:59,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:00,641 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 10:19:00,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:00,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:19:00,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:00,642 INFO L182 omatonBuilderFactory]: Interpolants [12428#true, 12429#false, 12430#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 12431#(= 0 |ldv_malloc_#t~malloc1.offset|), 12432#(= 0 |ldv_malloc_#res.offset|), 12433#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 12434#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 12435#(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)), 12436#(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)))))), 12437#(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)), 12438#(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)), 12439#(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)))))), 12440#(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)), 12441#(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)), 12442#(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)), 12443#(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)), 12444#(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)), 12445#(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)), 12446#(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))), 12447#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 4))) (= entry_point_~array~0.offset 0)), 12448#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12449#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 4))), 12450#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 4)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 12451#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 12452#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 12453#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:19:00,642 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 10:19:00,642 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:19:00,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:19:00,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:19:00,642 INFO L87 Difference]: Start difference. First operand 170 states and 189 transitions. Second operand 26 states. [2018-02-02 10:19:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:03,165 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2018-02-02 10:19:03,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 10:19:03,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 93 [2018-02-02 10:19:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:03,167 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:19:03,167 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:19:03,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=625, Invalid=3797, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 10:19:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:19:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2018-02-02 10:19:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 10:19:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2018-02-02 10:19:03,170 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 93 [2018-02-02 10:19:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:03,170 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2018-02-02 10:19:03,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:19:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2018-02-02 10:19:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:19:03,171 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:03,171 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 10:19:03,171 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]=== [2018-02-02 10:19:03,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1215322232, now seen corresponding path program 1 times [2018-02-02 10:19:03,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:03,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:03,220 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 10:19:03,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:03,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:19:03,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:19:03,221 INFO L182 omatonBuilderFactory]: Interpolants [12896#(= alloc_17_~i~0 0), 12897#(<= alloc_17_~i~0 1), 12898#(<= alloc_17_~j~0 0), 12899#(<= (+ alloc_17_~j~0 1) 0), 12894#true, 12895#false] [2018-02-02 10:19:03,222 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 10:19:03,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:19:03,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:19:03,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:19:03,222 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand 6 states. [2018-02-02 10:19:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:03,266 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-02-02 10:19:03,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:19:03,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-02-02 10:19:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:03,267 INFO L225 Difference]: With dead ends: 180 [2018-02-02 10:19:03,268 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 10:19:03,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:19:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 10:19:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 171. [2018-02-02 10:19:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 10:19:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-02-02 10:19:03,274 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 94 [2018-02-02 10:19:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:03,274 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-02-02 10:19:03,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:19:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-02-02 10:19:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:19:03,276 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:03,276 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:03,276 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]=== [2018-02-02 10:19:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash 416810834, now seen corresponding path program 2 times [2018-02-02 10:19:03,278 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:03,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:19:04,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:04,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:19:04,086 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:04,086 INFO L182 omatonBuilderFactory]: Interpolants [13257#true, 13258#false, 13259#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13260#(= 0 |ldv_malloc_#t~malloc1.offset|), 13261#(= 0 |ldv_malloc_#res.offset|), 13262#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 13263#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13264#(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)))), 13265#(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)))))), 13266#(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)), 13267#(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)), 13268#(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)))))), 13269#(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)))))), 13270#(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)))))), 13271#(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))), 13272#(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)), 13273#(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)))), 13274#(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))), 13275#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset 8))) (= entry_point_~array~0.offset 0)), 13276#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 13277#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) 8))), 13278#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) 8)) (= free_17_~array.offset 0)), 13279#(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)), 13280#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13281#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 10:19:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:19:04,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:19:04,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:19:04,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:19:04,087 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 25 states. [2018-02-02 10:19:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:05,947 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2018-02-02 10:19:05,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 10:19:05,947 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 10:19:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:05,948 INFO L225 Difference]: With dead ends: 182 [2018-02-02 10:19:05,948 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 10:19:05,949 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 10:19:05,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 10:19:05,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2018-02-02 10:19:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:19:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 190 transitions. [2018-02-02 10:19:05,952 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 190 transitions. Word has length 94 [2018-02-02 10:19:05,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:05,952 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 190 transitions. [2018-02-02 10:19:05,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:19:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 190 transitions. [2018-02-02 10:19:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 10:19:05,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:05,953 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:05,953 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]=== [2018-02-02 10:19:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash 416810835, now seen corresponding path program 2 times [2018-02-02 10:19:05,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:05,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:19:06,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:06,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:19:06,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:06,612 INFO L182 omatonBuilderFactory]: Interpolants [13715#true, 13716#false, 13717#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 13718#(= 0 |ldv_malloc_#t~malloc1.offset|), 13719#(= 0 |ldv_malloc_#res.offset|), 13720#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 13721#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 13722#(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)), 13723#(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)), 13724#(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)))), 13725#(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)), 13726#(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)))), 13727#(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)), 13728#(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)), 13729#(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)), 13730#(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))))), 13731#(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)), 13732#(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))))), 13733#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 13734#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 13735#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 13736#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 13737#(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)), 13738#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 13739#(= |free_17_#t~mem9.base| 0)] [2018-02-02 10:19:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 2 proven. 204 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:19:06,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:19:06,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:19:06,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:19:06,612 INFO L87 Difference]: Start difference. First operand 172 states and 190 transitions. Second operand 25 states. [2018-02-02 10:19:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:08,554 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2018-02-02 10:19:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 10:19:08,554 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-02-02 10:19:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:08,555 INFO L225 Difference]: With dead ends: 181 [2018-02-02 10:19:08,555 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 10:19:08,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 10 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=501, Invalid=3039, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 10:19:08,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 10:19:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2018-02-02 10:19:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 10:19:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2018-02-02 10:19:08,560 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 94 [2018-02-02 10:19:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:08,560 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2018-02-02 10:19:08,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:19:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2018-02-02 10:19:08,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 10:19:08,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:08,561 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 10:19:08,561 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]=== [2018-02-02 10:19:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 904599989, now seen corresponding path program 2 times [2018-02-02 10:19:08,562 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:08,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:19:08,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:08,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:19:08,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:08,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:08,635 INFO L182 omatonBuilderFactory]: Interpolants [14164#true, 14165#false, 14166#(<= 10 entry_point_~len~0), 14167#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 14168#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 1)), 14169#(<= (+ alloc_17_~i~0 |alloc_17_#in~len|) (+ alloc_17_~len 2)), 14170#(<= |alloc_17_#in~len| 2)] [2018-02-02 10:19:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-02-02 10:19:08,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:08,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:08,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:08,635 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand 7 states. [2018-02-02 10:19:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:08,680 INFO L93 Difference]: Finished difference Result 207 states and 227 transitions. [2018-02-02 10:19:08,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:08,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-02-02 10:19:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:08,681 INFO L225 Difference]: With dead ends: 207 [2018-02-02 10:19:08,681 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 10:19:08,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 10:19:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2018-02-02 10:19:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 10:19:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 195 transitions. [2018-02-02 10:19:08,685 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 195 transitions. Word has length 97 [2018-02-02 10:19:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:08,685 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 195 transitions. [2018-02-02 10:19:08,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 195 transitions. [2018-02-02 10:19:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 10:19:08,686 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:08,686 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, 1, 1] [2018-02-02 10:19:08,686 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]=== [2018-02-02 10:19:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash 416534570, now seen corresponding path program 2 times [2018-02-02 10:19:08,687 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:08,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:19:08,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:08,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:19:08,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:08,742 INFO L182 omatonBuilderFactory]: Interpolants [14560#(<= 10 entry_point_~len~0), 14561#(and (= free_17_~i~1 0) (<= |free_17_#in~len| free_17_~len)), 14562#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 1)), 14563#(<= (+ free_17_~i~1 |free_17_#in~len|) (+ free_17_~len 2)), 14564#(<= |free_17_#in~len| 2), 14558#true, 14559#false] [2018-02-02 10:19:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-02-02 10:19:08,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:19:08,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:19:08,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:19:08,743 INFO L87 Difference]: Start difference. First operand 178 states and 195 transitions. Second operand 7 states. [2018-02-02 10:19:08,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:08,774 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2018-02-02 10:19:08,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:19:08,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-02-02 10:19:08,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:08,775 INFO L225 Difference]: With dead ends: 205 [2018-02-02 10:19:08,775 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 10:19:08,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:19:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 10:19:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 184. [2018-02-02 10:19:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 10:19:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 204 transitions. [2018-02-02 10:19:08,778 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 204 transitions. Word has length 97 [2018-02-02 10:19:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:08,779 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 204 transitions. [2018-02-02 10:19:08,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:19:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 204 transitions. [2018-02-02 10:19:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:19:08,779 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:08,780 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:08,780 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]=== [2018-02-02 10:19:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash 908016167, now seen corresponding path program 2 times [2018-02-02 10:19:08,780 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:08,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:19:09,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:09,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 10:19:09,209 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:19:09,209 INFO L182 omatonBuilderFactory]: Interpolants [14956#true, 14957#false, 14958#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 14959#(= 0 |ldv_malloc_#t~malloc1.offset|), 14960#(= 0 |ldv_malloc_#res.offset|), 14961#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 14962#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 14963#(= entry_point_~array~0.offset 0), 14964#(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)))), 14965#(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)))), 14966#(= 0 |alloc_17_#in~array.offset|), 14967#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 14968#(= alloc_17_~array.offset 0), 14969#(and (= alloc_17_~array.offset 0) (= 0 |alloc_17_#t~ret3.offset|)), 14970#(and (= alloc_17_~array.offset 0) (= 0 alloc_17_~p~0.offset)), 14971#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (* 4 alloc_17_~i~0)))), 14972#(and (= alloc_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))), 14973#(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))))), 14974#(= 0 |alloc_17_#t~mem6.offset|)] [2018-02-02 10:19:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 36 proven. 89 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-02-02 10:19:09,209 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 10:19:09,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 10:19:09,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:19:09,210 INFO L87 Difference]: Start difference. First operand 184 states and 204 transitions. Second operand 19 states. [2018-02-02 10:19:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:09,475 INFO L93 Difference]: Finished difference Result 190 states and 210 transitions. [2018-02-02 10:19:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:19:09,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 100 [2018-02-02 10:19:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:09,476 INFO L225 Difference]: With dead ends: 190 [2018-02-02 10:19:09,476 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 10:19:09,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:19:09,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 10:19:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2018-02-02 10:19:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:19:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 207 transitions. [2018-02-02 10:19:09,484 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 207 transitions. Word has length 100 [2018-02-02 10:19:09,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:09,485 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 207 transitions. [2018-02-02 10:19:09,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 10:19:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 207 transitions. [2018-02-02 10:19:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:19:09,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:09,486 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:09,486 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]=== [2018-02-02 10:19:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash 908016168, now seen corresponding path program 2 times [2018-02-02 10:19:09,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:09,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:19:09,933 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:09,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:19:09,933 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:19:09,934 INFO L182 omatonBuilderFactory]: Interpolants [15392#(and (= 1 (select |#valid| |alloc_17_#t~ret3.base|)) (= alloc_17_~array.offset 0)), 15393#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~p~0.base))), 15394#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (* 4 alloc_17_~i~0))))), 15395#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_17_~array.base) (+ (* 4 alloc_17_~i~0) (- 4))))) (= alloc_17_~array.offset 0)), 15396#(= |#valid| |old(#valid)|), 15397#(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)))))), 15398#(= 1 (select |#valid| |alloc_17_#t~mem6.base|)), 15377#true, 15378#false, 15379#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15380#(= 0 |ldv_malloc_#t~malloc1.offset|), 15381#(= 0 |ldv_malloc_#res.offset|), 15382#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15383#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15384#(= entry_point_~array~0.offset 0), 15385#(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)))), 15386#(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)))), 15387#(= 0 |alloc_17_#in~array.offset|), 15388#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 15389#(= alloc_17_~array.offset 0), 15390#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 15391#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:19:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 44 proven. 92 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-02-02 10:19:09,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:19:09,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:19:09,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:19:09,935 INFO L87 Difference]: Start difference. First operand 186 states and 207 transitions. Second operand 22 states. [2018-02-02 10:19:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:10,328 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2018-02-02 10:19:10,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 10:19:10,328 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 100 [2018-02-02 10:19:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:10,329 INFO L225 Difference]: With dead ends: 191 [2018-02-02 10:19:10,329 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 10:19:10,329 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1458, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 10:19:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 10:19:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2018-02-02 10:19:10,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 10:19:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 206 transitions. [2018-02-02 10:19:10,331 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 206 transitions. Word has length 100 [2018-02-02 10:19:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:10,332 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 206 transitions. [2018-02-02 10:19:10,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:19:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 206 transitions. [2018-02-02 10:19:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 10:19:10,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:10,333 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:10,333 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]=== [2018-02-02 10:19:10,333 INFO L82 PathProgramCache]: Analyzing trace with hash 790845752, now seen corresponding path program 3 times [2018-02-02 10:19:10,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:10,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:11,229 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 10:19:11,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:11,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:19:11,229 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:11,230 INFO L182 omatonBuilderFactory]: Interpolants [15815#true, 15816#false, 15817#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 15818#(= 0 |ldv_malloc_#t~malloc1.offset|), 15819#(= 0 |ldv_malloc_#res.offset|), 15820#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 15821#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 15822#(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)), 15823#(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)), 15824#(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)), 15825#(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)), 15826#(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)))), 15827#(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)), 15828#(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)), 15829#(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)), 15830#(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)), 15831#(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))), 15832#(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)), 15833#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ 8 entry_point_~array~0.offset)))), 15834#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 15835#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 8))), 15836#(and (= free_17_~i~1 0) (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 8))), 15837#(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)), 15838#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 15839#(and (= |free_17_#t~mem9.base| 0) (= 1 (select |#valid| free_17_~array.base))), 15840#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:19:11,230 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 10:19:11,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:19:11,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:19:11,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:19:11,231 INFO L87 Difference]: Start difference. First operand 186 states and 206 transitions. Second operand 26 states. [2018-02-02 10:19:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:13,362 INFO L93 Difference]: Finished difference Result 198 states and 216 transitions. [2018-02-02 10:19:13,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 10:19:13,362 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-02 10:19:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:13,363 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:19:13,363 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:19:13,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=554, Invalid=3736, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:19:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:19:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-02-02 10:19:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 10:19:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2018-02-02 10:19:13,366 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 99 [2018-02-02 10:19:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:13,366 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2018-02-02 10:19:13,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:19:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2018-02-02 10:19:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 10:19:13,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:13,367 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:19:13,367 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]=== [2018-02-02 10:19:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1853741113, now seen corresponding path program 1 times [2018-02-02 10:19:13,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:13,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:19:13,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:13,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:19:13,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:19:13,504 INFO L182 omatonBuilderFactory]: Interpolants [16320#(or (<= 4 (select |#length| |alloc_17_#in~array.base|)) (not (= |alloc_17_#in~array.offset| 0))), 16321#(and (= 0 entry_point_~array~0.offset) (<= 4 (select |#length| entry_point_~array~0.base))), 16322#(and (= 0 |free_17_#in~array.offset|) (<= 4 (select |#length| |free_17_#in~array.base|))), 16323#(and (<= 4 (select |#length| free_17_~array.base)) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16311#true, 16312#false, 16313#(= 0 |ldv_malloc_#t~malloc1.offset|), 16314#(= 0 |ldv_malloc_#res.offset|), 16315#(= 0 |entry_point_#t~ret10.offset|), 16316#(= 0 entry_point_~array~0.offset), 16317#(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|)), 16318#(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|)), 16319#(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|))] [2018-02-02 10:19:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-02-02 10:19:13,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:19:13,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:19:13,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:19:13,505 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand 13 states. [2018-02-02 10:19:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:13,622 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2018-02-02 10:19:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:19:13,622 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-02-02 10:19:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:13,622 INFO L225 Difference]: With dead ends: 198 [2018-02-02 10:19:13,623 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 10:19:13,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:19:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 10:19:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-02-02 10:19:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 10:19:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-02-02 10:19:13,626 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 101 [2018-02-02 10:19:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:13,626 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-02-02 10:19:13,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:19:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-02-02 10:19:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:19:13,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:13,627 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 10:19:13,627 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]=== [2018-02-02 10:19:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1253585412, now seen corresponding path program 3 times [2018-02-02 10:19:13,628 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:13,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:14,358 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 10:19:14,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:14,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:19:14,358 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:14,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:14,358 INFO L182 omatonBuilderFactory]: Interpolants [16719#true, 16720#false, 16721#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 16722#(= 0 |ldv_malloc_#t~malloc1.offset|), 16723#(= 0 |ldv_malloc_#res.offset|), 16724#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 16725#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 16726#(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)), 16727#(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))))), 16728#(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)), 16729#(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)), 16730#(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)), 16731#(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)), 16732#(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)), 16733#(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)), 16734#(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)), 16735#(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))), 16736#(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)), 16737#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 16738#(and (= 0 |free_17_#in~array.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |free_17_#in~array.base|) (+ 8 4)))), 16739#(and (= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ 8 4))) (= free_17_~i~1 0) (= free_17_~array.offset 0)), 16740#(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)))), 16741#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ free_17_~array.offset (+ (* 4 free_17_~i~1) 4)))), 16742#(= 0 (select (select |#memory_$Pointer$.offset| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 16743#(= 0 |free_17_#t~mem9.offset|)] [2018-02-02 10:19:14,359 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 10:19:14,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:19:14,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:19:14,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:19:14,359 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 25 states. [2018-02-02 10:19:16,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:16,194 INFO L93 Difference]: Finished difference Result 202 states and 219 transitions. [2018-02-02 10:19:16,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 10:19:16,194 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 10:19:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:16,195 INFO L225 Difference]: With dead ends: 202 [2018-02-02 10:19:16,195 INFO L226 Difference]: Without dead ends: 202 [2018-02-02 10:19:16,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=477, Invalid=3429, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:19:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-02-02 10:19:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2018-02-02 10:19:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 10:19:16,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2018-02-02 10:19:16,198 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 100 [2018-02-02 10:19:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:16,198 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2018-02-02 10:19:16,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:19:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2018-02-02 10:19:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 10:19:16,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:16,199 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 10:19:16,199 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]=== [2018-02-02 10:19:16,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1253585411, now seen corresponding path program 3 times [2018-02-02 10:19:16,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:16,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:16,981 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 10:19:16,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:16,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:19:16,982 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:19:16,982 INFO L182 omatonBuilderFactory]: Interpolants [17216#false, 17217#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17218#(= 0 |ldv_malloc_#t~malloc1.offset|), 17219#(= 0 |ldv_malloc_#res.offset|), 17220#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17221#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17222#(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)), 17223#(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)), 17224#(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)), 17225#(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)), 17226#(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)), 17227#(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)))))), 17228#(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)), 17229#(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))), 17230#(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))), 17231#(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))), 17232#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset 12)))), 17233#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 17234#(and (= 0 (select (select |#memory_$Pointer$.base| |free_17_#in~array.base|) 12)) (= 0 |free_17_#in~array.offset|)), 17235#(and (= free_17_~i~1 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) 12)) (= free_17_~array.offset 0)), 17236#(and (= free_17_~array.offset 0) (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 8)))), 17237#(and (= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) 4))) (= free_17_~array.offset 0)), 17238#(= 0 (select (select |#memory_$Pointer$.base| free_17_~array.base) (+ (* 4 free_17_~i~1) free_17_~array.offset))), 17239#(= |free_17_#t~mem9.base| 0), 17215#true] [2018-02-02 10:19:16,982 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 10:19:16,983 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:19:16,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:19:16,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:19:16,983 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand 25 states. [2018-02-02 10:19:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:18,713 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2018-02-02 10:19:18,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:19:18,714 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-02-02 10:19:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:18,714 INFO L225 Difference]: With dead ends: 201 [2018-02-02 10:19:18,714 INFO L226 Difference]: Without dead ends: 201 [2018-02-02 10:19:18,715 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 10:19:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-02-02 10:19:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 192. [2018-02-02 10:19:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-02-02 10:19:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-02-02 10:19:18,717 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 100 [2018-02-02 10:19:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:18,717 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-02-02 10:19:18,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:19:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-02-02 10:19:18,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:19:18,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:18,718 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 10:19:18,718 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]=== [2018-02-02 10:19:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash 725176200, now seen corresponding path program 2 times [2018-02-02 10:19:18,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:18,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:19,190 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 10:19:19,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:19:19,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:19:19,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:19:19,190 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 10:19:19,191 INFO L182 omatonBuilderFactory]: Interpolants [17700#true, 17701#false, 17702#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 17703#(= 0 |ldv_malloc_#t~malloc1.offset|), 17704#(= 0 |ldv_malloc_#res.offset|), 17705#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10) (= 0 |entry_point_#t~ret10.offset|)), 17706#(and (<= 10 entry_point_~len~0) (= entry_point_~array~0.offset 0) (<= entry_point_~len~0 10)), 17707#(= entry_point_~array~0.offset 0), 17708#(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)))), 17709#(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)), 17710#(= 0 |alloc_17_#in~array.offset|), 17711#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0)), 17712#(and (= alloc_17_~i~0 0) (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 17713#(and (= alloc_17_~array.offset 0) (= 1 (select |#valid| alloc_17_~array.base))), 17714#(= |#valid| |old(#valid)|), 17715#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 17716#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 17717#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base |alloc_17_#t~ret3.base|))), 17718#(and (= alloc_17_~array.offset 0) (not (= alloc_17_~array.base alloc_17_~p~0.base))), 17719#(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))))), 17720#(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)))))), 17721#(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))), 17722#(and (not (= alloc_17_~array.base |alloc_17_#t~mem6.base|)) (= 1 (select |#valid| alloc_17_~array.base))), 17723#(= 1 (select |#valid| alloc_17_~array.base))] [2018-02-02 10:19:19,191 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 10:19:19,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:19:19,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:19:19,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:19:19,191 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 24 states. [2018-02-02 10:19:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:19:19,619 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2018-02-02 10:19:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 10:19:19,619 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 102 [2018-02-02 10:19:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:19:19,620 INFO L225 Difference]: With dead ends: 208 [2018-02-02 10:19:19,620 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 10:19:19,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=1857, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 10:19:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 10:19:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 194. [2018-02-02 10:19:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-02-02 10:19:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 214 transitions. [2018-02-02 10:19:19,623 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 214 transitions. Word has length 102 [2018-02-02 10:19:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:19:19,623 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 214 transitions. [2018-02-02 10:19:19,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:19:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 214 transitions. [2018-02-02 10:19:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-02 10:19:19,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:19:19,624 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 10:19:19,624 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]=== [2018-02-02 10:19:19,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1631399634, now seen corresponding path program 1 times [2018-02-02 10:19:19,625 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:19:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:19:19,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:19:19,691 ERROR L119 erpolLogProxyWrapper]: Could not assert interpolant [2018-02-02 10:19:19,691 ERROR L119 erpolLogProxyWrapper]: Interpolant 82 not inductive: (Check returned sat) [2018-02-02 10:19:19,692 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Asserted terms must be closed at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:956) 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 10:19:19,702 INFO L168 Benchmark]: Toolchain (without parser) took 41940.46 ms. Allocated memory was 402.7 MB in the beginning and 1.4 GB in the end (delta: 982.5 MB). Free memory was 359.0 MB in the beginning and 906.5 MB in the end (delta: -547.5 MB). Peak memory consumption was 435.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:19,703 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:19:19,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.59 ms. Allocated memory is still 402.7 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:19,704 INFO L168 Benchmark]: Boogie Preprocessor took 32.19 ms. Allocated memory is still 402.7 MB. Free memory was 345.8 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:19,704 INFO L168 Benchmark]: RCFGBuilder took 274.64 ms. Allocated memory is still 402.7 MB. Free memory was 344.5 MB in the beginning and 320.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:19,704 INFO L168 Benchmark]: TraceAbstraction took 41452.20 ms. Allocated memory was 402.7 MB in the beginning and 1.4 GB in the end (delta: 982.5 MB). Free memory was 319.1 MB in the beginning and 906.5 MB in the end (delta: -587.4 MB). Peak memory consumption was 395.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:19:19,706 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.12 ms. Allocated memory is still 402.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 178.59 ms. Allocated memory is still 402.7 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.19 ms. Allocated memory is still 402.7 MB. Free memory was 345.8 MB in the beginning and 344.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 274.64 ms. Allocated memory is still 402.7 MB. Free memory was 344.5 MB in the beginning and 320.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 41452.20 ms. Allocated memory was 402.7 MB in the beginning and 1.4 GB in the end (delta: 982.5 MB). Free memory was 319.1 MB in the beginning and 906.5 MB in the end (delta: -587.4 MB). Peak memory consumption was 395.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Asserted terms must be closed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Asserted terms must be closed: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:654) 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_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-19-19-713.csv Received shutdown request...