java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:38:50,763 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:38:50,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:38:50,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:38:50,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:38:50,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:38:50,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:38:50,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:38:50,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:38:50,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:38:50,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:38:50,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:38:50,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:38:50,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:38:50,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:38:50,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:38:50,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:38:50,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:38:50,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:38:50,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:38:50,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:38:50,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:38:50,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:38:50,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:38:50,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:38:50,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:38:50,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:38:50,795 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:38:50,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:38:50,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:38:50,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:38:50,796 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:38:50,805 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:38:50,805 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:38:50,806 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:38:50,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:38:50,807 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:38:50,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:38:50,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:38:50,807 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:38:50,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:38:50,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:38:50,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:38:50,808 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:38:50,808 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:38:50,808 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:38:50,808 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:38:50,808 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:38:50,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:38:50,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:38:50,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:38:50,809 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:38:50,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:38:50,809 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:38:50,810 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:38:50,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:38:50,848 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:38:50,851 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:38:50,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:38:50,853 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:38:50,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-02 20:38:51,007 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:38:51,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:38:51,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:38:51,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:38:51,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:38:51,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dca496d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51, skipping insertion in model container [2018-02-02 20:38:51,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,032 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:38:51,068 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:38:51,155 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:38:51,168 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:38:51,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51 WrapperNode [2018-02-02 20:38:51,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:38:51,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:38:51,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:38:51,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:38:51,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... [2018-02-02 20:38:51,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:38:51,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:38:51,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:38:51,205 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:38:51,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:38:51,242 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:38:51,242 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:38:51,242 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 20:38:51,242 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 20:38:51,243 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:38:51,243 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:38:51,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:38:51,399 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:38:51,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:38:51 BoogieIcfgContainer [2018-02-02 20:38:51,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:38:51,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:38:51,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:38:51,403 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:38:51,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:38:51" (1/3) ... [2018-02-02 20:38:51,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54949e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:38:51, skipping insertion in model container [2018-02-02 20:38:51,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:38:51" (2/3) ... [2018-02-02 20:38:51,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54949e0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:38:51, skipping insertion in model container [2018-02-02 20:38:51,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:38:51" (3/3) ... [2018-02-02 20:38:51,405 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_true-valid-memsafety_true-termination.i [2018-02-02 20:38:51,409 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:38:51,415 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 20:38:51,448 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:38:51,448 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:38:51,448 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:38:51,448 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:38:51,448 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:38:51,449 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:38:51,449 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:38:51,449 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:38:51,450 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:38:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-02 20:38:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:38:51,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:51,471 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:51,471 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:51,475 INFO L82 PathProgramCache]: Analyzing trace with hash 932191006, now seen corresponding path program 1 times [2018-02-02 20:38:51,530 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:51,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:51,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:51,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:38:51,641 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:51,642 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= |#valid| |old(#valid)|)] [2018-02-02 20:38:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:51,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:38:51,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:38:51,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:38:51,656 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-02-02 20:38:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:51,804 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-02 20:38:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:38:51,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 20:38:51,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:51,812 INFO L225 Difference]: With dead ends: 74 [2018-02-02 20:38:51,812 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 20:38:51,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:38:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 20:38:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-02-02 20:38:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 20:38:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-02-02 20:38:51,842 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 17 [2018-02-02 20:38:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:51,843 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-02-02 20:38:51,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:38:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-02-02 20:38:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 20:38:51,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:51,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:51,844 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:51,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1509814464, now seen corresponding path program 1 times [2018-02-02 20:38:51,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:51,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:51,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:51,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:38:51,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:51,904 INFO L182 omatonBuilderFactory]: Interpolants [176#(not (= 0 |ldv_malloc_#res.base|)), 177#(not (= 0 |entry_point_#t~ret2.base|)), 178#(not (= 0 entry_point_~array~0.base)), 173#true, 174#false, 175#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-02 20:38:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:51,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:51,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:51,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:51,907 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 6 states. [2018-02-02 20:38:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:51,971 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2018-02-02 20:38:51,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:51,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 20:38:51,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:51,974 INFO L225 Difference]: With dead ends: 71 [2018-02-02 20:38:51,974 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 20:38:51,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 20:38:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2018-02-02 20:38:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 20:38:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 20:38:51,983 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 19 [2018-02-02 20:38:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:51,983 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 20:38:51,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 20:38:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:38:51,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:51,984 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:51,984 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:51,984 INFO L82 PathProgramCache]: Analyzing trace with hash 179879494, now seen corresponding path program 1 times [2018-02-02 20:38:51,986 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:51,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:52,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:38:52,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,036 INFO L182 omatonBuilderFactory]: Interpolants [295#true, 296#false, 297#(= 0 |ldv_malloc_#res.offset|), 298#(= 0 |entry_point_#t~ret2.offset|), 299#(= 0 entry_point_~array~0.offset)] [2018-02-02 20:38:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:52,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:52,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,037 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-02 20:38:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,090 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-02 20:38:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:52,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 20:38:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,091 INFO L225 Difference]: With dead ends: 69 [2018-02-02 20:38:52,091 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 20:38:52,092 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 20:38:52,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-02-02 20:38:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 20:38:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-02-02 20:38:52,100 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 20 [2018-02-02 20:38:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,100 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-02-02 20:38:52,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-02-02 20:38:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:38:52,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,101 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,101 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash 179879495, now seen corresponding path program 1 times [2018-02-02 20:38:52,103 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:52,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:38:52,142 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,143 INFO L182 omatonBuilderFactory]: Interpolants [432#false, 433#(= 0 |ldv_malloc_#res.base|), 434#(= 0 |entry_point_#t~ret2.base|), 435#(= entry_point_~array~0.base 0), 431#true] [2018-02-02 20:38:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:52,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:52,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,144 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 5 states. [2018-02-02 20:38:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,185 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-02-02 20:38:52,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:52,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 20:38:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,186 INFO L225 Difference]: With dead ends: 70 [2018-02-02 20:38:52,186 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 20:38:52,186 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 20:38:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2018-02-02 20:38:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 20:38:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2018-02-02 20:38:52,192 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 20 [2018-02-02 20:38:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,192 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2018-02-02 20:38:52,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2018-02-02 20:38:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:38:52,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,193 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,193 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash 179879544, now seen corresponding path program 1 times [2018-02-02 20:38:52,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:52,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:52,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,252 INFO L182 omatonBuilderFactory]: Interpolants [568#true, 569#false, 570#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 571#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 |entry_point_#t~ret2.base|)), 572#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset))] [2018-02-02 20:38:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:52,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:52,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,253 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 5 states. [2018-02-02 20:38:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,268 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-02-02 20:38:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:52,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 20:38:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,269 INFO L225 Difference]: With dead ends: 47 [2018-02-02 20:38:52,269 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 20:38:52,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 20:38:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 20:38:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 20:38:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-02 20:38:52,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 20 [2018-02-02 20:38:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,273 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-02 20:38:52,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-02 20:38:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:38:52,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,274 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,274 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638300, now seen corresponding path program 1 times [2018-02-02 20:38:52,275 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:52,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:52,318 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,318 INFO L182 omatonBuilderFactory]: Interpolants [665#true, 666#false, 667#(= 0 |ldv_malloc_#t~malloc1.offset|), 668#(= 0 |ldv_malloc_#res.offset|), 669#(= 0 |entry_point_#t~ret2.offset|), 670#(= 0 entry_point_~array~0.offset)] [2018-02-02 20:38:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:52,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:52,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:52,319 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-02-02 20:38:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,345 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 20:38:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:52,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 20:38:52,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,346 INFO L225 Difference]: With dead ends: 44 [2018-02-02 20:38:52,346 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 20:38:52,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 20:38:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 20:38:52,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 20:38:52,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 20:38:52,350 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 22 [2018-02-02 20:38:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,350 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 20:38:52,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 20:38:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:38:52,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,351 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,351 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638299, now seen corresponding path program 1 times [2018-02-02 20:38:52,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,398 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:52,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:52,398 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,398 INFO L182 omatonBuilderFactory]: Interpolants [761#true, 762#false, 763#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 764#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 765#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 766#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:38:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:52,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:52,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:52,399 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-02 20:38:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,459 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 20:38:52,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:52,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 20:38:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,461 INFO L225 Difference]: With dead ends: 50 [2018-02-02 20:38:52,461 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 20:38:52,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 20:38:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-02-02 20:38:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 20:38:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 20:38:52,465 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-02 20:38:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,465 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 20:38:52,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 20:38:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:38:52,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,466 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,466 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1773638249, now seen corresponding path program 1 times [2018-02-02 20:38:52,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:52,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:38:52,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,505 INFO L182 omatonBuilderFactory]: Interpolants [868#true, 869#false, 870#(<= 10 entry_point_~len~0), 871#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0))] [2018-02-02 20:38:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:38:52,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:38:52,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:38:52,506 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 4 states. [2018-02-02 20:38:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,535 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-02-02 20:38:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:38:52,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 20:38:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,536 INFO L225 Difference]: With dead ends: 73 [2018-02-02 20:38:52,536 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 20:38:52,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:38:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 20:38:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2018-02-02 20:38:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 20:38:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-02 20:38:52,540 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 22 [2018-02-02 20:38:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,540 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-02 20:38:52,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:38:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-02 20:38:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:38:52,541 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,541 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,541 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1600952977, now seen corresponding path program 1 times [2018-02-02 20:38:52,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:52,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:52,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:52,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:52,587 INFO L182 omatonBuilderFactory]: Interpolants [996#true, 997#false, 998#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 999#(and (= 0 |entry_point_#t~ret4.base|) (= 0 |entry_point_#t~ret4.offset|)), 1000#(and (= 0 entry_point_~p~0.base) (= 0 entry_point_~p~0.offset))] [2018-02-02 20:38:52,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:52,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:52,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:52,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,588 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-02 20:38:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,609 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 20:38:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:52,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 20:38:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,611 INFO L225 Difference]: With dead ends: 67 [2018-02-02 20:38:52,611 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 20:38:52,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 20:38:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2018-02-02 20:38:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 20:38:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-02 20:38:52,615 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 26 [2018-02-02 20:38:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,615 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-02 20:38:52,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-02 20:38:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:38:52,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,616 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,616 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -578226829, now seen corresponding path program 1 times [2018-02-02 20:38:52,618 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,704 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:52,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:38:52,704 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,704 INFO L182 omatonBuilderFactory]: Interpolants [1121#true, 1122#false, 1123#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1124#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1125#(= 1 (select |#valid| |entry_point_#t~ret2.base|)), 1126#(= 1 (select |#valid| entry_point_~array~0.base)), 1127#(= |#valid| |old(#valid)|), 1128#(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|)), 1129#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 20:38:52,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:52,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:38:52,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:38:52,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:38:52,705 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 9 states. [2018-02-02 20:38:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:52,860 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-02-02 20:38:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:38:52,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-02-02 20:38:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:52,861 INFO L225 Difference]: With dead ends: 69 [2018-02-02 20:38:52,862 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 20:38:52,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:38:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 20:38:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-02-02 20:38:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 20:38:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-02 20:38:52,866 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-02-02 20:38:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:52,866 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-02 20:38:52,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:38:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-02 20:38:52,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:38:52,867 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:52,867 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:52,867 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash -578226828, now seen corresponding path program 1 times [2018-02-02 20:38:52,868 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:52,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:53,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:53,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:53,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:53,131 INFO L182 omatonBuilderFactory]: Interpolants [1256#true, 1257#false, 1258#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 1259#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 1260#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 1261#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 1262#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 1263#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 1264#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 1265#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1266#(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|))), 1267#(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|))))), 1268#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0))] [2018-02-02 20:38:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:38:53,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:53,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:53,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:53,132 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 13 states. [2018-02-02 20:38:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:53,605 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2018-02-02 20:38:53,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:38:53,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-02-02 20:38:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:53,606 INFO L225 Difference]: With dead ends: 113 [2018-02-02 20:38:53,606 INFO L226 Difference]: Without dead ends: 113 [2018-02-02 20:38:53,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:38:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-02-02 20:38:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 55. [2018-02-02 20:38:53,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 20:38:53,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-02-02 20:38:53,610 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 28 [2018-02-02 20:38:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:53,610 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-02-02 20:38:53,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-02-02 20:38:53,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 20:38:53,610 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:53,611 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:53,611 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:53,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1623272965, now seen corresponding path program 1 times [2018-02-02 20:38:53,612 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:53,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:38:53,642 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:53,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:38:53,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:53,643 INFO L182 omatonBuilderFactory]: Interpolants [1459#true, 1460#false, 1461#(= entry_point_~i~0 0), 1462#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 20:38:53,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 20:38:53,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:38:53,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:38:53,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:38:53,644 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 4 states. [2018-02-02 20:38:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:53,670 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-02-02 20:38:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:53,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-02 20:38:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:53,671 INFO L225 Difference]: With dead ends: 64 [2018-02-02 20:38:53,671 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 20:38:53,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 20:38:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-02-02 20:38:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 20:38:53,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-02 20:38:53,676 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 29 [2018-02-02 20:38:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:53,676 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-02 20:38:53,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:38:53,677 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-02 20:38:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:38:53,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:53,677 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:53,677 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:53,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1889590311, now seen corresponding path program 1 times [2018-02-02 20:38:53,679 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:53,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:53,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:53,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:38:53,813 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:53,813 INFO L182 omatonBuilderFactory]: Interpolants [1589#true, 1590#false, 1591#(= |#valid| |old(#valid)|), 1592#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 1593#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 1594#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret2.base| (select |#valid| |entry_point_#t~ret2.base|))) (not (= 0 |entry_point_#t~ret2.base|)) (= (select |old(#valid)| |entry_point_#t~ret2.base|) 0)), 1595#(and (= (select |old(#valid)| entry_point_~array~0.base) 0) (not (= 0 entry_point_~array~0.base)) (= |#valid| (store |old(#valid)| entry_point_~array~0.base (select |#valid| entry_point_~array~0.base))))] [2018-02-02 20:38:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:53,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:53,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:53,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:53,814 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 7 states. [2018-02-02 20:38:53,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:53,902 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-02-02 20:38:53,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:38:53,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-02 20:38:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:53,903 INFO L225 Difference]: With dead ends: 67 [2018-02-02 20:38:53,903 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 20:38:53,903 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:38:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 20:38:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 20:38:53,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 20:38:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-02-02 20:38:53,906 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 32 [2018-02-02 20:38:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:53,907 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-02-02 20:38:53,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-02-02 20:38:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 20:38:53,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:53,907 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:53,908 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:53,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1399829189, now seen corresponding path program 1 times [2018-02-02 20:38:53,909 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:53,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:53,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:53,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:38:53,948 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:53,948 INFO L182 omatonBuilderFactory]: Interpolants [1728#(not (= 0 |ldv_malloc_#res.base|)), 1729#(not (= 0 |entry_point_#t~ret4.base|)), 1730#(not (= 0 entry_point_~p~0.base)), 1725#true, 1726#false, 1727#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-02 20:38:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:53,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:53,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:53,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:53,949 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 6 states. [2018-02-02 20:38:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:53,978 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-02-02 20:38:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:53,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-02-02 20:38:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:53,981 INFO L225 Difference]: With dead ends: 74 [2018-02-02 20:38:53,981 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 20:38:53,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 20:38:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2018-02-02 20:38:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 20:38:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-02 20:38:53,985 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2018-02-02 20:38:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:53,985 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-02 20:38:53,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-02 20:38:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:38:53,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:53,990 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:53,990 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash -172063678, now seen corresponding path program 1 times [2018-02-02 20:38:53,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:54,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:54,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:38:54,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,038 INFO L182 omatonBuilderFactory]: Interpolants [1864#true, 1865#false, 1866#(<= 10 entry_point_~len~0), 1867#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 1868#(<= (+ entry_point_~i~0 9) entry_point_~len~0)] [2018-02-02 20:38:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:54,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:54,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:54,039 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-02-02 20:38:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:54,062 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-02 20:38:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:54,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 20:38:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:54,063 INFO L225 Difference]: With dead ends: 85 [2018-02-02 20:38:54,063 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 20:38:54,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 20:38:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 58. [2018-02-02 20:38:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 20:38:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-02-02 20:38:54,066 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 35 [2018-02-02 20:38:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:54,066 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-02-02 20:38:54,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-02-02 20:38:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 20:38:54,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:54,068 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:38:54,068 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1801461727, now seen corresponding path program 1 times [2018-02-02 20:38:54,069 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:54,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:54,379 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:54,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:38:54,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,380 INFO L182 omatonBuilderFactory]: Interpolants [2016#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 2017#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 2018#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 2147483648 |ldv_malloc_#in~size|))), 2019#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 2020#(and (= 0 |entry_point_#t~ret2.offset|) (<= 40 (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 2021#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 2022#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 2023#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2024#(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|))), 2025#(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|))))), 2026#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2027#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 2028#(and (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) 36) (select |#length| entry_point_~array~0.base))), 2014#true, 2015#false] [2018-02-02 20:38:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:38:54,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:38:54,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:38:54,381 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 15 states. [2018-02-02 20:38:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:54,784 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2018-02-02 20:38:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:38:54,784 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-02-02 20:38:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:54,785 INFO L225 Difference]: With dead ends: 99 [2018-02-02 20:38:54,785 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 20:38:54,785 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:38:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 20:38:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2018-02-02 20:38:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 20:38:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-02-02 20:38:54,787 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 41 [2018-02-02 20:38:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:54,788 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-02-02 20:38:54,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:38:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-02-02 20:38:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 20:38:54,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:54,788 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:54,788 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:54,789 INFO L82 PathProgramCache]: Analyzing trace with hash -867371792, now seen corresponding path program 1 times [2018-02-02 20:38:54,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:54,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:54,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:38:54,840 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,840 INFO L182 omatonBuilderFactory]: Interpolants [2214#true, 2215#false, 2216#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2217#(and (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2218#(= |old(#length)| |#length|), 2219#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)))] [2018-02-02 20:38:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:54,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:54,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:54,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:54,841 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 6 states. [2018-02-02 20:38:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:54,900 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-02 20:38:54,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:54,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-02-02 20:38:54,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:54,901 INFO L225 Difference]: With dead ends: 64 [2018-02-02 20:38:54,901 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 20:38:54,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 20:38:54,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-02-02 20:38:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 20:38:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-02-02 20:38:54,904 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 42 [2018-02-02 20:38:54,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:54,904 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-02-02 20:38:54,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-02-02 20:38:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:38:54,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:54,905 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:54,905 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:54,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721778, now seen corresponding path program 1 times [2018-02-02 20:38:54,906 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:54,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:55,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:38:55,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:55,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:55,111 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:38:55,111 INFO L182 omatonBuilderFactory]: Interpolants [2348#true, 2349#false, 2350#(= 0 |ldv_malloc_#t~malloc1.offset|), 2351#(= 0 |ldv_malloc_#res.offset|), 2352#(= 0 |entry_point_#t~ret2.offset|), 2353#(= entry_point_~array~0.offset 0), 2354#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2355#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 2356#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 2357#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 2358#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 2359#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 2360#(= |entry_point_#t~mem7.offset| 0)] [2018-02-02 20:38:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:38:55,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:55,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:55,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:55,112 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 13 states. [2018-02-02 20:38:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:55,249 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-02 20:38:55,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:38:55,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-02-02 20:38:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:55,250 INFO L225 Difference]: With dead ends: 82 [2018-02-02 20:38:55,250 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 20:38:55,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:38:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 20:38:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2018-02-02 20:38:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 20:38:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-02-02 20:38:55,253 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 43 [2018-02-02 20:38:55,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:55,253 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-02-02 20:38:55,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-02-02 20:38:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 20:38:55,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:55,254 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:55,254 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1118721777, now seen corresponding path program 1 times [2018-02-02 20:38:55,256 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:55,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:55,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:55,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:38:55,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:55,433 INFO L182 omatonBuilderFactory]: Interpolants [2528#true, 2529#false, 2530#(= 0 |ldv_malloc_#t~malloc1.offset|), 2531#(= 0 |ldv_malloc_#res.offset|), 2532#(= 0 |entry_point_#t~ret2.offset|), 2533#(= entry_point_~array~0.offset 0), 2534#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2535#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2536#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2537#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2538#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2539#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 2540#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 2541#(= |#valid| |old(#valid)|), 2542#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 2543#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 20:38:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:55,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:38:55,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:38:55,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:55,434 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 16 states. [2018-02-02 20:38:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:55,659 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-02-02 20:38:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:38:55,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-02 20:38:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:55,660 INFO L225 Difference]: With dead ends: 76 [2018-02-02 20:38:55,660 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 20:38:55,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:38:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 20:38:55,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-02-02 20:38:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 20:38:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-02-02 20:38:55,662 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 43 [2018-02-02 20:38:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:55,662 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-02-02 20:38:55,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:38:55,663 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-02-02 20:38:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:38:55,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:55,663 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:55,663 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1351278396, now seen corresponding path program 1 times [2018-02-02 20:38:55,664 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:55,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:38:55,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:55,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:38:55,710 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:38:55,710 INFO L182 omatonBuilderFactory]: Interpolants [2707#true, 2708#false, 2709#(= entry_point_~i~0 0), 2710#(<= 1 entry_point_~i~0), 2711#(<= 0 entry_point_~j~0)] [2018-02-02 20:38:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:38:55,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:38:55,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:38:55,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:38:55,711 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 5 states. [2018-02-02 20:38:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:55,744 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2018-02-02 20:38:55,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:38:55,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-02-02 20:38:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:55,745 INFO L225 Difference]: With dead ends: 74 [2018-02-02 20:38:55,745 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 20:38:55,745 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:55,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 20:38:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-02 20:38:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 20:38:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-02-02 20:38:55,748 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 45 [2018-02-02 20:38:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:55,748 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-02-02 20:38:55,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:38:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-02-02 20:38:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:38:55,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:55,749 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:38:55,749 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:55,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811508, now seen corresponding path program 1 times [2018-02-02 20:38:55,750 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:55,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:56,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:56,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:38:56,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:56,087 INFO L182 omatonBuilderFactory]: Interpolants [2880#(= 1 (select |#valid| entry_point_~array~0.base)), 2862#true, 2863#false, 2864#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 2865#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 2866#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 2867#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 2868#(and (or (= 1 (select |#valid| entry_point_~array~0.base)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 2869#(= |#valid| |old(#valid)|), 2870#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 2871#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 2872#(and (or (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 2873#(and (= entry_point_~array~0.offset 0) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base entry_point_~p~0.base)))), 2874#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 2875#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= entry_point_~array~0.offset 0)), 2876#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))), 2877#(and (= 1 (select |#valid| entry_point_~array~0.base)) (or (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (<= 1 entry_point_~j~0))), 2878#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 2879#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0))] [2018-02-02 20:38:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:38:56,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:38:56,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:38:56,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:38:56,088 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 19 states. [2018-02-02 20:38:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:56,672 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2018-02-02 20:38:56,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:38:56,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-02-02 20:38:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:56,673 INFO L225 Difference]: With dead ends: 112 [2018-02-02 20:38:56,673 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 20:38:56,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=941, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 20:38:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 20:38:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2018-02-02 20:38:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 20:38:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2018-02-02 20:38:56,676 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 48 [2018-02-02 20:38:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:56,677 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2018-02-02 20:38:56,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:38:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2018-02-02 20:38:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:38:56,677 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:56,677 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:56,678 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1778811557, now seen corresponding path program 1 times [2018-02-02 20:38:56,678 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:56,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:38:56,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:56,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:38:56,779 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:38:56,779 INFO L182 omatonBuilderFactory]: Interpolants [3109#true, 3110#false, 3111#(= entry_point_~i~0 0), 3112#(<= entry_point_~i~0 1), 3113#(<= entry_point_~j~0 0), 3114#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 20:38:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-02 20:38:56,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:56,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:56,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:56,780 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand 6 states. [2018-02-02 20:38:56,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:56,809 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-02-02 20:38:56,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:56,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-02-02 20:38:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:56,812 INFO L225 Difference]: With dead ends: 82 [2018-02-02 20:38:56,812 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 20:38:56,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:56,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 20:38:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-02-02 20:38:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 20:38:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-02-02 20:38:56,815 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 48 [2018-02-02 20:38:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:56,815 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-02-02 20:38:56,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-02-02 20:38:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 20:38:56,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:56,816 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:38:56,816 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:56,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1145466009, now seen corresponding path program 1 times [2018-02-02 20:38:56,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:56,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:56,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:56,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:38:56,865 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:56,866 INFO L182 omatonBuilderFactory]: Interpolants [3280#false, 3281#(<= 10 entry_point_~len~0), 3282#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 3283#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 3284#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 3279#true] [2018-02-02 20:38:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:56,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:56,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:56,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:56,867 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 6 states. [2018-02-02 20:38:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:56,911 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2018-02-02 20:38:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:56,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-02-02 20:38:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:56,912 INFO L225 Difference]: With dead ends: 116 [2018-02-02 20:38:56,912 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 20:38:56,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 20:38:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 81. [2018-02-02 20:38:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 20:38:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-02-02 20:38:56,916 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 49 [2018-02-02 20:38:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:56,916 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-02-02 20:38:56,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-02-02 20:38:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 20:38:56,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:56,917 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:38:56,917 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1267150670, now seen corresponding path program 1 times [2018-02-02 20:38:56,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:56,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:38:57,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:57,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:38:57,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:38:57,770 INFO L182 omatonBuilderFactory]: Interpolants [3488#(= |#valid| |old(#valid)|), 3489#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3490#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 3491#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 3492#(and (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 3493#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= entry_point_~array~0.base 0)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)))) (= entry_point_~array~0.offset 0)), 3494#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 3495#(and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 3496#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3497#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 3498#(and (= entry_point_~array~0.offset 0) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 3499#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))) (= entry_point_~array~0.offset 0)), 3500#(and (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0)))), 3501#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3502#(and (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (not (= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0))) (= entry_point_~array~0.offset 0)), 3503#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 3504#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0)), 3486#true, 3487#false] [2018-02-02 20:38:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:38:57,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:38:57,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:38:57,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:38:57,771 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states. [2018-02-02 20:38:58,597 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 87 DAG size of output 74 [2018-02-02 20:38:59,169 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 107 DAG size of output 90 [2018-02-02 20:38:59,440 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 109 DAG size of output 92 [2018-02-02 20:38:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:59,463 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-02-02 20:38:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:38:59,463 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-02-02 20:38:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:59,464 INFO L225 Difference]: With dead ends: 99 [2018-02-02 20:38:59,464 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 20:38:59,464 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:38:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 20:38:59,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2018-02-02 20:38:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 20:38:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2018-02-02 20:38:59,465 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 51 [2018-02-02 20:38:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:59,466 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2018-02-02 20:38:59,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:38:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2018-02-02 20:38:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:38:59,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:59,466 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:59,466 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:38:59,466 INFO L82 PathProgramCache]: Analyzing trace with hash 498105172, now seen corresponding path program 2 times [2018-02-02 20:38:59,467 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:59,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:38:59,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:59,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:38:59,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:59,740 INFO L182 omatonBuilderFactory]: Interpolants [3712#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3713#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1)), 3714#(and (<= (+ (* 4 entry_point_~i~0) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3699#true, 3700#false, 3701#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 3702#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 3703#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 3704#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 3705#(and (= 0 |entry_point_#t~ret2.offset|) (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret2.base|)) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 3706#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 3707#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3708#(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|))), 3709#(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|))))), 3710#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 3711#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-02 20:38:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:38:59,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:38:59,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:38:59,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:59,741 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand 16 states. [2018-02-02 20:39:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:00,140 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2018-02-02 20:39:00,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:39:00,140 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-02-02 20:39:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:00,141 INFO L225 Difference]: With dead ends: 93 [2018-02-02 20:39:00,141 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 20:39:00,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:39:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 20:39:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2018-02-02 20:39:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 20:39:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-02 20:39:00,143 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 54 [2018-02-02 20:39:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:00,144 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-02 20:39:00,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-02 20:39:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:39:00,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:00,145 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:39:00,145 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash 486079299, now seen corresponding path program 2 times [2018-02-02 20:39:00,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:00,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:39:00,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:00,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:39:00,375 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 20:39:00,376 INFO L182 omatonBuilderFactory]: Interpolants [3904#(= 0 |ldv_malloc_#t~malloc1.offset|), 3905#(= 0 |ldv_malloc_#res.offset|), 3906#(= 0 |entry_point_#t~ret2.offset|), 3907#(= entry_point_~array~0.offset 0), 3908#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 3909#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 3910#(= 0 |entry_point_#t~ret4.offset|), 3911#(= 0 entry_point_~p~0.offset), 3912#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))), 3913#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))), 3914#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))), 3915#(= |entry_point_#t~mem7.offset| 0), 3902#true, 3903#false] [2018-02-02 20:39:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:39:00,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:39:00,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:39:00,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:39:00,377 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 14 states. [2018-02-02 20:39:00,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:00,656 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-02-02 20:39:00,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:39:00,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-02-02 20:39:00,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:00,657 INFO L225 Difference]: With dead ends: 69 [2018-02-02 20:39:00,657 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 20:39:00,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:39:00,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 20:39:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-02-02 20:39:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 20:39:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-02-02 20:39:00,660 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 56 [2018-02-02 20:39:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:00,660 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-02-02 20:39:00,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:39:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-02-02 20:39:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 20:39:00,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:00,661 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 20:39:00,661 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash 486079300, now seen corresponding path program 2 times [2018-02-02 20:39:00,662 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:00,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:39:00,888 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:00,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:39:00,888 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:39:00,888 INFO L182 omatonBuilderFactory]: Interpolants [4078#true, 4079#false, 4080#(= 0 |ldv_malloc_#t~malloc1.offset|), 4081#(= 0 |ldv_malloc_#res.offset|), 4082#(= 0 |entry_point_#t~ret2.offset|), 4083#(= entry_point_~array~0.offset 0), 4084#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4085#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4086#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 4087#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 4088#(= 1 (select |#valid| |entry_point_#t~ret4.base|)), 4089#(= 1 (select |#valid| entry_point_~p~0.base)), 4090#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 4091#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4)))))), 4092#(= |#valid| |old(#valid)|), 4093#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 4094#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 20:39:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:39:00,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:39:00,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:39:00,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:00,889 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 17 states. [2018-02-02 20:39:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:01,207 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-02-02 20:39:01,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:39:01,208 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-02-02 20:39:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:01,208 INFO L225 Difference]: With dead ends: 73 [2018-02-02 20:39:01,208 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 20:39:01,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=918, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:39:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 20:39:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-02 20:39:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 20:39:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-02-02 20:39:01,210 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 56 [2018-02-02 20:39:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:01,210 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-02-02 20:39:01,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:39:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-02-02 20:39:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:39:01,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:01,211 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2018-02-02 20:39:01,211 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash 43207056, now seen corresponding path program 2 times [2018-02-02 20:39:01,212 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:01,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:01,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:01,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:01,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:01,509 INFO L182 omatonBuilderFactory]: Interpolants [4288#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 4270#true, 4271#false, 4272#(= 0 |ldv_malloc_#t~malloc1.offset|), 4273#(= 0 |ldv_malloc_#res.offset|), 4274#(= 0 |entry_point_#t~ret2.offset|), 4275#(= entry_point_~array~0.offset 0), 4276#(= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0), 4277#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4278#(and (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 4279#(= (select |#valid| entry_point_~array~0.base) 1), 4280#(= |#valid| |old(#valid)|), 4281#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 4282#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 4283#(not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)), 4284#(not (= entry_point_~array~0.base entry_point_~p~0.base)), 4285#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 4286#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (+ (* 4 entry_point_~i~0) (- 4))))))), 4287#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))))] [2018-02-02 20:39:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:01,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:39:01,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:39:01,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:01,509 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 19 states. [2018-02-02 20:39:02,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:02,136 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-02-02 20:39:02,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:39:02,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-02-02 20:39:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:02,137 INFO L225 Difference]: With dead ends: 101 [2018-02-02 20:39:02,137 INFO L226 Difference]: Without dead ends: 101 [2018-02-02 20:39:02,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:39:02,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-02 20:39:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2018-02-02 20:39:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 20:39:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-02 20:39:02,139 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 61 [2018-02-02 20:39:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:02,139 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-02 20:39:02,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:39:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-02 20:39:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-02 20:39:02,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:02,139 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2018-02-02 20:39:02,140 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 43207057, now seen corresponding path program 1 times [2018-02-02 20:39:02,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:02,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:02,297 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 20:39:02,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:02,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:39:02,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:39:02,298 INFO L182 omatonBuilderFactory]: Interpolants [4504#true, 4505#false, 4506#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4507#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4508#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 4509#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 4510#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 4511#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))] [2018-02-02 20:39:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 20:39:02,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:39:02,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:39:02,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:39:02,298 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 8 states. [2018-02-02 20:39:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:02,353 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-02 20:39:02,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:39:02,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-02-02 20:39:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:02,354 INFO L225 Difference]: With dead ends: 74 [2018-02-02 20:39:02,354 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 20:39:02,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:39:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 20:39:02,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2018-02-02 20:39:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 20:39:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-02 20:39:02,356 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 61 [2018-02-02 20:39:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:02,356 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-02 20:39:02,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:39:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-02 20:39:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:39:02,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:02,356 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:02,356 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418765, now seen corresponding path program 1 times [2018-02-02 20:39:02,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:02,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:39:02,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:02,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:39:02,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 20:39:02,764 INFO L182 omatonBuilderFactory]: Interpolants [4672#(and (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4673#(and (or (<= (* 4 entry_point_~i~0) 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 4674#(and (<= entry_point_~j~0 1) (or (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4675#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~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_~j~0)))))), 4676#(= |entry_point_#t~mem7.offset| 0), 4661#true, 4662#false, 4663#(= 0 |ldv_malloc_#t~malloc1.offset|), 4664#(= 0 |ldv_malloc_#res.offset|), 4665#(= 0 |entry_point_#t~ret2.offset|), 4666#(= entry_point_~array~0.offset 0), 4667#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4668#(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))), 4669#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 4670#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 4671#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))] [2018-02-02 20:39:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-02 20:39:02,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:39:02,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:39:02,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:02,764 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 16 states. [2018-02-02 20:39:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:03,065 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-02 20:39:03,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 20:39:03,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2018-02-02 20:39:03,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:03,066 INFO L225 Difference]: With dead ends: 99 [2018-02-02 20:39:03,066 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 20:39:03,066 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:39:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 20:39:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-02-02 20:39:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 20:39:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-02-02 20:39:03,068 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 62 [2018-02-02 20:39:03,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:03,069 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-02-02 20:39:03,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:03,069 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-02-02 20:39:03,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-02 20:39:03,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:03,069 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:03,069 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:03,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1339418766, now seen corresponding path program 1 times [2018-02-02 20:39:03,070 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:03,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:03,866 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:03,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:39:03,866 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:03,867 INFO L182 omatonBuilderFactory]: Interpolants [4884#true, 4885#false, 4886#(= 0 |ldv_malloc_#t~malloc1.offset|), 4887#(= 0 |ldv_malloc_#res.offset|), 4888#(= 0 |entry_point_#t~ret2.offset|), 4889#(= entry_point_~array~0.offset 0), 4890#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4891#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 4892#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4893#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 4894#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| |entry_point_#t~ret4.base|) 1)), 4895#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 4896#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) 1)), 4897#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4898#(= |#valid| |old(#valid)|), 4899#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 4900#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4901#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 4902#(and (= entry_point_~array~0.offset 0) (or (and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))) (<= (* 4 entry_point_~i~0) 0))), 4903#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (* 4 entry_point_~i~0))))) (<= (* 4 entry_point_~i~0) 0))), 4904#(and (or (<= (* 4 entry_point_~i~0) 4) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 4905#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 4906#(and (or (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4907#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 4908#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 4909#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 20:39:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:39:03,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:39:03,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:39:03,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:39:03,868 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 26 states. [2018-02-02 20:39:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:04,640 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-02-02 20:39:04,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 20:39:04,641 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-02-02 20:39:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:04,641 INFO L225 Difference]: With dead ends: 94 [2018-02-02 20:39:04,641 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 20:39:04,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:39:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 20:39:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2018-02-02 20:39:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 20:39:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-02-02 20:39:04,643 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 62 [2018-02-02 20:39:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:04,643 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-02-02 20:39:04,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:39:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-02-02 20:39:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:39:04,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:04,644 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:04,644 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash 604576341, now seen corresponding path program 2 times [2018-02-02 20:39:04,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:04,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:39:05,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:05,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 20:39:05,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:05,079 INFO L182 omatonBuilderFactory]: Interpolants [5120#(= |#valid| |old(#valid)|), 5121#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 5122#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 5123#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 5124#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 5125#(and (or (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 5126#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 5127#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))))) (= entry_point_~array~0.offset 0)), 5128#(and (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.offset 0)), 5129#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5130#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5131#(and (= entry_point_~array~0.offset 0) (or (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))))), 5132#(or (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|))) (<= 1 entry_point_~j~0)), 5133#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 1 entry_point_~j~0)), 5134#(or (= 1 (select |#valid| entry_point_~array~0.base)) (<= 0 entry_point_~j~0)), 5135#(= 1 (select |#valid| entry_point_~array~0.base)), 5114#true, 5115#false, 5116#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5117#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5118#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 5119#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-02 20:39:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 20:39:05,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:39:05,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:39:05,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:39:05,080 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 22 states. [2018-02-02 20:39:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:06,996 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-02-02 20:39:06,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:39:06,996 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2018-02-02 20:39:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:06,998 INFO L225 Difference]: With dead ends: 133 [2018-02-02 20:39:06,998 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 20:39:06,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=671, Invalid=2521, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 20:39:06,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 20:39:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2018-02-02 20:39:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:39:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2018-02-02 20:39:07,001 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 67 [2018-02-02 20:39:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:07,001 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2018-02-02 20:39:07,002 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:39:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2018-02-02 20:39:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 20:39:07,002 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:07,002 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2018-02-02 20:39:07,002 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:07,003 INFO L82 PathProgramCache]: Analyzing trace with hash 604576390, now seen corresponding path program 3 times [2018-02-02 20:39:07,003 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:07,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 20:39:07,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:07,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:39:07,065 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 20:39:07,065 INFO L182 omatonBuilderFactory]: Interpolants [5440#(= entry_point_~i~0 0), 5441#(<= entry_point_~i~0 1), 5442#(<= entry_point_~i~0 2), 5443#(<= entry_point_~j~0 1), 5444#(<= entry_point_~j~0 0), 5445#(<= (+ entry_point_~j~0 1) 0), 5438#true, 5439#false] [2018-02-02 20:39:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 20:39:07,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:39:07,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:39:07,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:39:07,066 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 8 states. [2018-02-02 20:39:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:07,111 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2018-02-02 20:39:07,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:39:07,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2018-02-02 20:39:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:07,112 INFO L225 Difference]: With dead ends: 100 [2018-02-02 20:39:07,112 INFO L226 Difference]: Without dead ends: 100 [2018-02-02 20:39:07,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:39:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-02 20:39:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-02 20:39:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 20:39:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-02-02 20:39:07,115 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 67 [2018-02-02 20:39:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:07,115 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-02-02 20:39:07,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:39:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-02-02 20:39:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 20:39:07,116 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:07,116 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2018-02-02 20:39:07,116 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:07,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2021752934, now seen corresponding path program 1 times [2018-02-02 20:39:07,117 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:07,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-02 20:39:07,178 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:07,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:39:07,179 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:39:07,179 INFO L182 omatonBuilderFactory]: Interpolants [5648#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 5649#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 5650#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 5651#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 5645#true, 5646#false, 5647#(<= 10 entry_point_~len~0)] [2018-02-02 20:39:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-02-02 20:39:07,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:39:07,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:39:07,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:39:07,180 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 7 states. [2018-02-02 20:39:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:07,246 INFO L93 Difference]: Finished difference Result 139 states and 155 transitions. [2018-02-02 20:39:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:39:07,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-02-02 20:39:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:07,248 INFO L225 Difference]: With dead ends: 139 [2018-02-02 20:39:07,248 INFO L226 Difference]: Without dead ends: 139 [2018-02-02 20:39:07,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:39:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-02-02 20:39:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 99. [2018-02-02 20:39:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 20:39:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-02 20:39:07,251 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 68 [2018-02-02 20:39:07,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:07,251 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-02 20:39:07,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:39:07,251 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-02 20:39:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:39:07,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:07,252 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:07,252 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2135916493, now seen corresponding path program 2 times [2018-02-02 20:39:07,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:07,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:08,533 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 80 DAG size of output 49 [2018-02-02 20:39:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:10,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:10,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:39:10,015 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:10,016 INFO L182 omatonBuilderFactory]: Interpolants [5896#true, 5897#false, 5898#(= |#valid| |old(#valid)|), 5899#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5900#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5901#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 5902#(and (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= (select |#valid| entry_point_~array~0.base) 1) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 5903#(and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)), 5904#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 5905#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))), 5906#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))), 5907#(and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) |old(#valid)|) (= 1 (select |#valid| entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 5908#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= (select |#valid| entry_point_~array~0.base) 1) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))) (not (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0) (or (= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (< 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))), 5909#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 0 (div (+ (* (- 4) entry_point_~i~0) (+ (- entry_point_~array~0.offset) 3)) 4294967296)) (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select |#valid| entry_point_~array~0.base) 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))))), 5910#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (= |#valid| |old(#valid)|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))))), 5911#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 5912#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= (store |#valid| |ldv_malloc_#res.base| (select |old(#valid)| |ldv_malloc_#res.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)))), 5913#(and (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 |entry_point_#t~ret4.base|))))), 5914#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 entry_point_~p~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= entry_point_~array~0.base entry_point_~p~0.base)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5915#(and (= entry_point_~array~0.offset 0) (or (<= 5 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 5916#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= entry_point_~i~0 1) (<= 9 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5917#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5918#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~j~0 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (not (= entry_point_~array~0.base 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))), 5919#(and (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (<= 5 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5920#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base 0)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (= entry_point_~array~0.offset 0)), 5921#(and (or (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|) (not (= |entry_point_#t~mem7.base| entry_point_~array~0.base))) (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))) (= entry_point_~array~0.offset 0)), 5922#(and (= entry_point_~array~0.offset 0) (or (< 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))))), 5923#(and (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)))) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 3)))), 5924#(and (not (= entry_point_~array~0.base 0)) (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))) (= entry_point_~array~0.offset 0))] [2018-02-02 20:39:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 48 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:10,016 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:39:10,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:39:10,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:39:10,016 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 29 states. [2018-02-02 20:39:10,411 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-02-02 20:39:11,415 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 94 DAG size of output 94 [2018-02-02 20:39:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:12,356 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-02 20:39:12,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:39:12,356 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 70 [2018-02-02 20:39:12,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:12,357 INFO L225 Difference]: With dead ends: 103 [2018-02-02 20:39:12,357 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 20:39:12,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:39:12,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 20:39:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 20:39:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 20:39:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-02 20:39:12,359 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 70 [2018-02-02 20:39:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:12,359 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-02 20:39:12,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:39:12,359 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-02 20:39:12,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:39:12,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:12,360 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:12,360 INFO L371 AbstractCegarLoop]: === Iteration 36 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:12,360 INFO L82 PathProgramCache]: Analyzing trace with hash 872069176, now seen corresponding path program 2 times [2018-02-02 20:39:12,360 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:12,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-02 20:39:12,761 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:12,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:39:12,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-02 20:39:12,762 INFO L182 omatonBuilderFactory]: Interpolants [6146#true, 6147#false, 6148#(= 0 |ldv_malloc_#t~malloc1.offset|), 6149#(= 0 |ldv_malloc_#res.offset|), 6150#(= 0 |entry_point_#t~ret2.offset|), 6151#(= entry_point_~array~0.offset 0), 6152#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6153#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 6154#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 6155#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 6156#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 6157#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 6158#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 6159#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 6160#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 6161#(= |entry_point_#t~mem7.offset| 0)] [2018-02-02 20:39:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 11 proven. 52 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-02-02 20:39:12,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:39:12,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:39:12,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:39:12,762 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 16 states. [2018-02-02 20:39:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:13,245 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-02 20:39:13,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 20:39:13,246 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2018-02-02 20:39:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:13,246 INFO L225 Difference]: With dead ends: 83 [2018-02-02 20:39:13,247 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 20:39:13,247 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:39:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 20:39:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-02-02 20:39:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 20:39:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-02 20:39:13,249 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 75 [2018-02-02 20:39:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:13,249 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-02 20:39:13,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:39:13,250 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-02 20:39:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:39:13,250 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:13,250 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:13,250 INFO L371 AbstractCegarLoop]: === Iteration 37 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash 872069177, now seen corresponding path program 2 times [2018-02-02 20:39:13,251 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:13,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:14,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:14,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:39:14,048 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:14,048 INFO L182 omatonBuilderFactory]: Interpolants [6361#true, 6362#false, 6363#(= 0 |ldv_malloc_#t~malloc1.offset|), 6364#(= 0 |ldv_malloc_#res.offset|), 6365#(= 0 |entry_point_#t~ret2.offset|), 6366#(= entry_point_~array~0.offset 0), 6367#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6368#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6369#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6370#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6371#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0)), 6372#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 6373#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~array~0.offset 0)), 6374#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6375#(= |#valid| |old(#valid)|), 6376#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 6377#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6378#(and (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 |entry_point_#t~ret4.base|))), 6379#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6380#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 6381#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 6382#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6383#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 6384#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 6385#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0)), 6386#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 20:39:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 28 proven. 57 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:39:14,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:39:14,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:39:14,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:39:14,049 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 26 states. [2018-02-02 20:39:14,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:14,934 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-02-02 20:39:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:39:14,935 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-02-02 20:39:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:14,935 INFO L225 Difference]: With dead ends: 87 [2018-02-02 20:39:14,935 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 20:39:14,935 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=256, Invalid=2000, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 20:39:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 20:39:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-02-02 20:39:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 20:39:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-02-02 20:39:14,937 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 75 [2018-02-02 20:39:14,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:14,937 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-02-02 20:39:14,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:39:14,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-02-02 20:39:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:39:14,937 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:14,938 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:14,938 INFO L371 AbstractCegarLoop]: === Iteration 38 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239877, now seen corresponding path program 4 times [2018-02-02 20:39:14,938 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:14,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:15,399 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 20:39:15,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:15,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:39:15,400 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 20:39:15,400 INFO L182 omatonBuilderFactory]: Interpolants [6624#(= (select |#valid| entry_point_~array~0.base) 1), 6601#true, 6602#false, 6603#(= 0 |ldv_malloc_#t~malloc1.offset|), 6604#(= 0 |ldv_malloc_#res.offset|), 6605#(= 0 |entry_point_#t~ret2.offset|), 6606#(= entry_point_~array~0.offset 0), 6607#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 6608#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6609#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6610#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6611#(= |#valid| |old(#valid)|), 6612#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6613#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6614#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 6615#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 6616#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 6617#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= entry_point_~i~0 1)) (= entry_point_~array~0.offset 0)), 6618#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (<= entry_point_~i~0 2)) (= entry_point_~array~0.offset 0)), 6619#(and (or (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0)), 6620#(and (or (<= entry_point_~j~0 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))) (= entry_point_~array~0.offset 0)), 6621#(or (<= entry_point_~j~0 0) (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))), 6622#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 6623#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1))] [2018-02-02 20:39:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-02-02 20:39:15,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:39:15,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:39:15,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:39:15,401 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 24 states. [2018-02-02 20:39:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:16,095 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-02-02 20:39:16,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 20:39:16,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 80 [2018-02-02 20:39:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:16,096 INFO L225 Difference]: With dead ends: 121 [2018-02-02 20:39:16,096 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 20:39:16,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=1785, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 20:39:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 20:39:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2018-02-02 20:39:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 20:39:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2018-02-02 20:39:16,099 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 80 [2018-02-02 20:39:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:16,099 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2018-02-02 20:39:16,099 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:39:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2018-02-02 20:39:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-02-02 20:39:16,100 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:16,100 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:16,100 INFO L371 AbstractCegarLoop]: === Iteration 39 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1789239876, now seen corresponding path program 2 times [2018-02-02 20:39:16,101 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:16,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 20:39:16,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:16,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:39:16,175 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 20:39:16,175 INFO L182 omatonBuilderFactory]: Interpolants [6896#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6897#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6898#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 6899#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6900#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 6891#true, 6892#false, 6893#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6894#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 6895#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))] [2018-02-02 20:39:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 20:39:16,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:39:16,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:39:16,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:39:16,176 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand 10 states. [2018-02-02 20:39:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:16,298 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2018-02-02 20:39:16,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:39:16,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-02-02 20:39:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:16,299 INFO L225 Difference]: With dead ends: 110 [2018-02-02 20:39:16,299 INFO L226 Difference]: Without dead ends: 110 [2018-02-02 20:39:16,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:39:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-02-02 20:39:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 102. [2018-02-02 20:39:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 20:39:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2018-02-02 20:39:16,302 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 80 [2018-02-02 20:39:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:16,302 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-02-02 20:39:16,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:39:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2018-02-02 20:39:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:39:16,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:16,303 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:16,303 INFO L371 AbstractCegarLoop]: === Iteration 40 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash 368138690, now seen corresponding path program 3 times [2018-02-02 20:39:16,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:16,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:39:16,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:16,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:39:16,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-02-02 20:39:16,639 INFO L182 omatonBuilderFactory]: Interpolants [7136#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 7137#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 7138#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~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_~j~0)))))), 7139#(= |entry_point_#t~mem7.offset| 0), 7121#true, 7122#false, 7123#(= 0 |ldv_malloc_#t~malloc1.offset|), 7124#(= 0 |ldv_malloc_#res.offset|), 7125#(= 0 |entry_point_#t~ret2.offset|), 7126#(= entry_point_~array~0.offset 0), 7127#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7128#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 7129#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 7130#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 7131#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 7132#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))), 7133#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.offset) 0))), 7134#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 7135#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0))] [2018-02-02 20:39:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-02 20:39:16,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:39:16,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:39:16,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:39:16,639 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand 19 states. [2018-02-02 20:39:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:16,866 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-02 20:39:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:39:16,866 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-02-02 20:39:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:16,867 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:39:16,867 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:39:16,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:39:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:39:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2018-02-02 20:39:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 20:39:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-02-02 20:39:16,869 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 81 [2018-02-02 20:39:16,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:16,869 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-02-02 20:39:16,869 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:39:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-02-02 20:39:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:39:16,869 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:16,869 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:16,869 INFO L371 AbstractCegarLoop]: === Iteration 41 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:16,869 INFO L82 PathProgramCache]: Analyzing trace with hash 368138691, now seen corresponding path program 3 times [2018-02-02 20:39:16,870 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:16,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:39:18,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:18,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:39:18,073 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:39:18,073 INFO L182 omatonBuilderFactory]: Interpolants [7385#true, 7386#false, 7387#(= 0 |ldv_malloc_#t~malloc1.offset|), 7388#(= 0 |ldv_malloc_#res.offset|), 7389#(= 0 |entry_point_#t~ret2.offset|), 7390#(= entry_point_~array~0.offset 0), 7391#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7392#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 7393#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7394#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 7395#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7396#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7397#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 7398#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 7399#(= |#valid| |old(#valid)|), 7400#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 7401#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7402#(and (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 7403#(and (<= (* 4 entry_point_~i~0) 4) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0) entry_point_~p~0.base))), 7404#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (<= entry_point_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| 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~0)))))) (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 3))), 7405#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 8)))), 7406#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 7407#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7408#(and (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 7409#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 3) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 11)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))), 7410#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7))), 7411#(and (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (and (or (and (<= entry_point_~j~0 2) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0))) (not (= 0 |entry_point_#t~mem7.base|))), 7412#(and (or (and (<= entry_point_~j~0 2) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 7413#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 7414#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0)), 7415#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 7416#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 7417#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 20:39:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 20:39:18,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:39:18,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:39:18,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:39:18,074 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 33 states. [2018-02-02 20:39:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:19,161 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2018-02-02 20:39:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:39:19,161 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81 [2018-02-02 20:39:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:19,161 INFO L225 Difference]: With dead ends: 114 [2018-02-02 20:39:19,161 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 20:39:19,162 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=283, Invalid=2579, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 20:39:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 20:39:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2018-02-02 20:39:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-02 20:39:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-02-02 20:39:19,165 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 81 [2018-02-02 20:39:19,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:19,165 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-02-02 20:39:19,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:39:19,165 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-02-02 20:39:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-02-02 20:39:19,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:19,166 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-02-02 20:39:19,166 INFO L371 AbstractCegarLoop]: === Iteration 42 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:19,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1592489080, now seen corresponding path program 3 times [2018-02-02 20:39:19,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:19,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 20:39:19,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:19,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:39:19,228 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 20:39:19,228 INFO L182 omatonBuilderFactory]: Interpolants [7682#true, 7683#false, 7684#(= entry_point_~i~0 0), 7685#(<= 1 entry_point_~i~0), 7686#(<= 2 entry_point_~i~0), 7687#(<= 3 entry_point_~i~0), 7688#(<= 2 entry_point_~j~0), 7689#(<= 1 entry_point_~j~0), 7690#(<= 0 entry_point_~j~0)] [2018-02-02 20:39:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 20:39:19,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:39:19,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:39:19,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:39:19,229 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 9 states. [2018-02-02 20:39:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:19,295 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-02 20:39:19,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:39:19,295 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-02-02 20:39:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:19,296 INFO L225 Difference]: With dead ends: 107 [2018-02-02 20:39:19,296 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 20:39:19,296 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:39:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 20:39:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-02-02 20:39:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 20:39:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-02-02 20:39:19,299 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 83 [2018-02-02 20:39:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:19,299 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-02-02 20:39:19,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:39:19,299 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-02-02 20:39:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:39:19,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:19,300 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:19,300 INFO L371 AbstractCegarLoop]: === Iteration 43 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1913440706, now seen corresponding path program 1 times [2018-02-02 20:39:19,300 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:19,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:39:19,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:19,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:39:19,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:19,360 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-02-02 20:39:19,360 INFO L182 omatonBuilderFactory]: Interpolants [7911#true, 7912#false, 7913#(<= 10 entry_point_~len~0), 7914#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 7915#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 7916#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 7917#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 7918#(<= (+ entry_point_~i~0 6) entry_point_~len~0)] [2018-02-02 20:39:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-02 20:39:19,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:39:19,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:39:19,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:39:19,361 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 8 states. [2018-02-02 20:39:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:19,432 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2018-02-02 20:39:19,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:39:19,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2018-02-02 20:39:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:19,433 INFO L225 Difference]: With dead ends: 156 [2018-02-02 20:39:19,433 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 20:39:19,433 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:39:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 20:39:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2018-02-02 20:39:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 20:39:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2018-02-02 20:39:19,437 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 86 [2018-02-02 20:39:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:19,437 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2018-02-02 20:39:19,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:39:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2018-02-02 20:39:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:39:19,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:19,438 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:19,438 INFO L371 AbstractCegarLoop]: === Iteration 44 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash 618472000, now seen corresponding path program 3 times [2018-02-02 20:39:19,439 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:19,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:19,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:19,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:39:19,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:39:19,941 INFO L182 omatonBuilderFactory]: Interpolants [8196#true, 8197#false, 8198#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 8199#(and (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8200#(and (= 0 |entry_point_#t~ret2.offset|) (= 1 (select |#valid| |entry_point_#t~ret2.base|))), 8201#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 8202#(and (= 1 (select |#valid| entry_point_~array~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8203#(= |#valid| |old(#valid)|), 8204#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8205#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8206#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8207#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 8208#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 8209#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8210#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8211#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))), 8212#(and (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8213#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8214#(and (<= entry_point_~j~0 2) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8215#(and (<= entry_point_~j~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 8216#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 8217#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 8218#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:39:19,941 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-02 20:39:19,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:39:19,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:39:19,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:39:19,942 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 23 states. [2018-02-02 20:39:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:20,438 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-02 20:39:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:39:20,438 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-02-02 20:39:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:20,438 INFO L225 Difference]: With dead ends: 125 [2018-02-02 20:39:20,439 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 20:39:20,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:39:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 20:39:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 114. [2018-02-02 20:39:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 20:39:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2018-02-02 20:39:20,441 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 86 [2018-02-02 20:39:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:20,441 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2018-02-02 20:39:20,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:39:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2018-02-02 20:39:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:39:20,441 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:20,441 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:20,441 INFO L371 AbstractCegarLoop]: === Iteration 45 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:20,441 INFO L82 PathProgramCache]: Analyzing trace with hash 618472050, now seen corresponding path program 3 times [2018-02-02 20:39:20,442 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:20,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 20:39:20,514 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:20,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:39:20,515 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 20:39:20,515 INFO L182 omatonBuilderFactory]: Interpolants [8484#true, 8485#false, 8486#(= entry_point_~i~0 0), 8487#(<= entry_point_~i~0 1), 8488#(<= entry_point_~i~0 2), 8489#(<= entry_point_~i~0 3), 8490#(<= entry_point_~j~0 2), 8491#(<= entry_point_~j~0 1), 8492#(<= entry_point_~j~0 0), 8493#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 20:39:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 20:39:20,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:39:20,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:39:20,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:39:20,516 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 10 states. [2018-02-02 20:39:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:20,593 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-02-02 20:39:20,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:39:20,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-02-02 20:39:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:20,594 INFO L225 Difference]: With dead ends: 115 [2018-02-02 20:39:20,594 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 20:39:20,594 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:39:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 20:39:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-02-02 20:39:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-02 20:39:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-02 20:39:20,597 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 86 [2018-02-02 20:39:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:20,597 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-02 20:39:20,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:39:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-02 20:39:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:39:20,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:20,598 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:20,598 INFO L371 AbstractCegarLoop]: === Iteration 46 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash -510333950, now seen corresponding path program 4 times [2018-02-02 20:39:20,599 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:20,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:26,558 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 129 DAG size of output 47 [2018-02-02 20:39:26,787 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 137 DAG size of output 53 [2018-02-02 20:39:27,173 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 142 DAG size of output 55 [2018-02-02 20:39:27,420 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 133 DAG size of output 54 [2018-02-02 20:39:28,009 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 107 DAG size of output 61 [2018-02-02 20:39:28,175 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 101 DAG size of output 64 [2018-02-02 20:39:28,340 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 102 DAG size of output 63 [2018-02-02 20:39:28,506 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 110 DAG size of output 70 [2018-02-02 20:39:28,727 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 105 DAG size of output 64 [2018-02-02 20:39:28,912 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 125 DAG size of output 65 [2018-02-02 20:39:29,480 WARN L146 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 173 DAG size of output 60 [2018-02-02 20:39:30,336 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 178 DAG size of output 54 [2018-02-02 20:39:31,066 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 125 DAG size of output 54 [2018-02-02 20:39:31,452 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 138 DAG size of output 42 [2018-02-02 20:39:31,880 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 164 DAG size of output 42 [2018-02-02 20:39:32,444 WARN L146 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 164 DAG size of output 42 [2018-02-02 20:39:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:39:33,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:33,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-02-02 20:39:33,100 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:39:33,101 INFO L182 omatonBuilderFactory]: Interpolants [8730#true, 8731#false, 8732#(= |#valid| |old(#valid)|), 8733#(and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 8734#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (@diff |#valid| |old(#valid)|) |ldv_malloc_#res.base|))), 8735#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |old(#valid)| |entry_point_#t~ret2.base|)) (not (= 0 |entry_point_#t~ret2.base|)) (= (store |#valid| |entry_point_#t~ret2.base| (select |old(#valid)| |entry_point_#t~ret2.base|)) |old(#valid)|)), 8736#(and (or (= |#valid| |old(#valid)|) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|))) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (not (= 0 entry_point_~array~0.base))), 8737#(and (not (= entry_point_~array~0.base 0)) (or (= |#valid| |old(#valid)|) (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))), 8738#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 8739#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (store |#valid| |ldv_malloc_#t~malloc1.base| (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) |old(#valid)|) (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8740#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |ldv_malloc_#res.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 8741#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 8742#(and (= 1 (select |#valid| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (or (and (or (= entry_point_~array~0.base (@diff |#valid| |old(#valid)|)) (= entry_point_~p~0.base (@diff |#valid| |old(#valid)|))) (= (store (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (select |old(#valid)| (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (or (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (= entry_point_~p~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|)) (= entry_point_~array~0.base (@diff (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base entry_point_~p~0.base)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 8743#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))))), 8744#(and (<= (* 4 entry_point_~i~0) 4) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8745#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8746#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.base| (@diff |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8747#(and (or (and (<= entry_point_~i~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~ret4.base| 0) entry_point_~array~0.base) 0))) (<= (* 4 entry_point_~i~0) 0)) (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~ret4.base|))), 8748#(and (= 1 (select |#valid| entry_point_~p~0.base)) (not (= entry_point_~array~0.base 0)) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~i~0 1) (or (= (select (store |#valid| entry_point_~p~0.base 0) entry_point_~array~0.base) 0) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 0))), 8749#(and (= entry_point_~array~0.offset 0) (or (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) 0) entry_point_~array~0.base) 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (not (= entry_point_~array~0.base 0)) (<= entry_point_~i~0 1) (= (select |#valid| entry_point_~array~0.base) 1)) (<= (* 4 entry_point_~i~0) 3))), 8750#(and (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select |#valid| entry_point_~array~0.base) 1) (or (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))))) (<= (* 4 entry_point_~i~0) 7))), 8751#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8752#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= 0 |ldv_malloc_#res.base|))), 8753#(and (or (<= (* 4 entry_point_~i~0) 7) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (or (= (select (store (store |#valid| |entry_point_#t~ret4.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~ret4.base| (select |old(#valid)| |entry_point_#t~ret4.base|))) (= 0 (select |old(#valid)| |entry_point_#t~ret4.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))))) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8) (not (= 0 |entry_point_#t~ret4.base|))), 8754#(and (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (or (and (not (= entry_point_~array~0.base 0)) (or (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select (store (store |#valid| entry_point_~p~0.base 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0)) (and (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (or (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base) (and (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (or (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)) (and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~p~0.base)) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) entry_point_~p~0.base (select |old(#valid)| entry_point_~p~0.base))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))))))))) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 8755#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) 0) entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (<= (* 4 entry_point_~i~0) 8)), 8756#(and (or (<= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 11) (and (<= (* 4 entry_point_~i~0) 12) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (or (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) 0) entry_point_~array~0.base) 0) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset (- 4))))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))))))))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset))))), 8757#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (and (<= entry_point_~j~0 2) (or (= (select (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|))))) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 8758#(and (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |old(#valid)| (store (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|))) (= 0 (select |old(#valid)| entry_point_~array~0.base))))) (= (select (store (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))))), 8759#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 7) (and (<= entry_point_~j~0 2) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= |old(#valid)| (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (and (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))))) (= entry_point_~array~0.offset 0)), 8760#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) 0) entry_point_~array~0.base) 0))))), 8761#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) |old(#valid)|)) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)) (not (= |entry_point_#t~mem7.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (not (= 0 |entry_point_#t~mem7.base|))))), 8762#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= |old(#valid)| (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))))) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)) 0)))))) (= entry_point_~array~0.offset 0)), 8763#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 1) 0) (and (not (= entry_point_~array~0.base 0)) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))))) (= entry_point_~array~0.offset 0)), 8764#(and (or (= (select |#valid| entry_point_~array~0.base) 0) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) 0) (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))) (and (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 0 (select |old(#valid)| entry_point_~array~0.base)))))) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0)), 8765#(and (or (= (select |#valid| |entry_point_#t~mem7.base|) 0) (and (= (select (store |#valid| |entry_point_#t~mem7.base| 0) |entry_point_#t~mem7.base|) (select |old(#valid)| |entry_point_#t~mem7.base|)) (= 0 (select |old(#valid)| entry_point_~array~0.base)) (= (store (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |entry_point_#t~mem7.base| (select |old(#valid)| |entry_point_#t~mem7.base|)) |old(#valid)|)) (= (select (store |#valid| |entry_point_#t~mem7.base| 0) entry_point_~array~0.base) 0)) (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|))), 8766#(and (not (= entry_point_~array~0.base 0)) (= entry_point_~array~0.offset 0) (or (= (select |#valid| entry_point_~array~0.base) 0) (and (= (select (store |#valid| entry_point_~array~0.base 0) entry_point_~array~0.base) (select |old(#valid)| entry_point_~array~0.base)) (= (select (store |#valid| entry_point_~array~0.base 0) (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~array~0.base (select |old(#valid)| entry_point_~array~0.base)) |old(#valid)|))))))] [2018-02-02 20:39:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 5 proven. 88 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:39:33,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 20:39:33,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 20:39:33,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1225, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:39:33,102 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 37 states. [2018-02-02 20:39:34,657 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 143 DAG size of output 101 [2018-02-02 20:39:35,077 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 130 DAG size of output 112 [2018-02-02 20:39:35,992 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-02 20:39:36,220 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-02 20:39:36,443 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 143 DAG size of output 86 [2018-02-02 20:39:36,667 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 152 DAG size of output 75 [2018-02-02 20:39:36,973 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 105 DAG size of output 73 [2018-02-02 20:39:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:37,254 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-02-02 20:39:37,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:39:37,254 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-02-02 20:39:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:37,255 INFO L225 Difference]: With dead ends: 116 [2018-02-02 20:39:37,255 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 20:39:37,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=336, Invalid=3570, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 20:39:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 20:39:37,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-02-02 20:39:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 20:39:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-02 20:39:37,257 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 89 [2018-02-02 20:39:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:37,257 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-02 20:39:37,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 20:39:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-02 20:39:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 20:39:37,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:37,257 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:37,257 INFO L371 AbstractCegarLoop]: === Iteration 47 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:37,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1582872742, now seen corresponding path program 5 times [2018-02-02 20:39:37,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:37,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:37,475 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 55 proven. 41 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 20:39:37,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:37,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:39:37,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-02-02 20:39:37,476 INFO L182 omatonBuilderFactory]: Interpolants [9024#true, 9025#false, 9026#(= (select |#valid| entry_point_~array~0.base) 1), 9027#(= |#valid| |old(#valid)|), 9028#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 9029#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 9030#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (not (= 0 |entry_point_#t~ret4.base|))), 9031#(and (not (= 0 entry_point_~p~0.base)) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 9032#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))))), 9033#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))), 9034#(and (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))), 9035#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))), 9036#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 9037#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)) (not (= 0 |entry_point_#t~mem7.base|)))] [2018-02-02 20:39:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 55 proven. 41 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 20:39:37,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:39:37,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:39:37,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:39:37,477 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 14 states. [2018-02-02 20:39:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:37,993 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-02 20:39:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:39:37,993 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 93 [2018-02-02 20:39:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:37,994 INFO L225 Difference]: With dead ends: 119 [2018-02-02 20:39:37,994 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 20:39:37,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 20:39:37,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 20:39:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 89. [2018-02-02 20:39:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 20:39:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-02-02 20:39:37,996 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 93 [2018-02-02 20:39:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:37,996 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-02-02 20:39:37,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:39:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-02-02 20:39:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:39:37,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:37,996 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:37,996 INFO L371 AbstractCegarLoop]: === Iteration 48 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:37,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1824414775, now seen corresponding path program 4 times [2018-02-02 20:39:37,997 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:38,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 14 proven. 93 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-02 20:39:38,449 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:38,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 20:39:38,449 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-02-02 20:39:38,449 INFO L182 omatonBuilderFactory]: Interpolants [9293#true, 9294#false, 9295#(= 0 |ldv_malloc_#t~malloc1.offset|), 9296#(= 0 |ldv_malloc_#res.offset|), 9297#(= 0 |entry_point_#t~ret2.offset|), 9298#(= entry_point_~array~0.offset 0), 9299#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 9300#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 9301#(and (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|)), 9302#(and (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 9303#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 9304#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))), 9305#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9306#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12)))) (= entry_point_~array~0.offset 0)), 9307#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))) (= entry_point_~array~0.offset 0)), 9308#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))) (= entry_point_~array~0.offset 0)), 9309#(and (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))), 9310#(= |entry_point_#t~mem7.offset| 0)] [2018-02-02 20:39:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 14 proven. 93 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-02-02 20:39:38,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:39:38,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:39:38,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:39:38,450 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 18 states. [2018-02-02 20:39:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:38,854 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-02-02 20:39:38,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:39:38,854 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-02-02 20:39:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:38,855 INFO L225 Difference]: With dead ends: 93 [2018-02-02 20:39:38,855 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 20:39:38,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 20:39:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 20:39:38,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-02-02 20:39:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 20:39:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2018-02-02 20:39:38,857 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 94 [2018-02-02 20:39:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:38,858 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-02-02 20:39:38,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:39:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-02-02 20:39:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:39:38,858 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:38,859 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:38,859 INFO L371 AbstractCegarLoop]: === Iteration 49 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:38,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1824414776, now seen corresponding path program 4 times [2018-02-02 20:39:38,860 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:38,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 42 proven. 102 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:40,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:40,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 20:39:40,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:40,201 INFO L182 omatonBuilderFactory]: Interpolants [9538#true, 9539#false, 9540#(= 0 (select |#valid| 0)), 9541#(= (select |old(#valid)| 0) (select |#valid| 0)), 9542#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 9543#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0))), 9544#(and (= 0 |entry_point_#t~ret2.offset|) (= 0 (select |#valid| 0))), 9545#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9546#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9547#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (= (select |old(#valid)| 0) (select |#valid| 0)))) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 9548#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (<= 4294967296 |ldv_malloc_#in~size|)), 9549#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 9550#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 9551#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9552#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0))), 9553#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0)), 9554#(and (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9555#(= |#valid| |old(#valid)|), 9556#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 9557#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9558#(and (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 |entry_point_#t~ret4.base|))), 9559#(and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9560#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 0 (select |#valid| 0)) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))), 9561#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (= 0 (select |#valid| 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9562#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 9563#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 9564#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) |entry_point_#t~ret4.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 |entry_point_#t~ret4.base|))), 9565#(and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))) entry_point_~p~0.base)) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9566#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8)))))), 9567#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~i~0 (- 2))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (= entry_point_~array~0.offset 0)), 9568#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))), 9569#(and (= entry_point_~array~0.offset 0) (or (and (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))) (and (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (not (= |entry_point_#t~mem7.base| 0))))), 9570#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (= entry_point_~array~0.offset 0) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 (+ entry_point_~j~0 (- 1))) entry_point_~array~0.offset)) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))), 9571#(and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9572#(and (= entry_point_~array~0.offset 0) (not (= 0 |entry_point_#t~mem7.base|)) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9573#(and (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))), 9574#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= entry_point_~array~0.offset 0)), 9575#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 20:39:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 42 proven. 102 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:39:40,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 20:39:40,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 20:39:40,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1283, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:39:40,202 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 38 states. [2018-02-02 20:39:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:42,364 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-02-02 20:39:42,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 20:39:42,365 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 94 [2018-02-02 20:39:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:42,365 INFO L225 Difference]: With dead ends: 96 [2018-02-02 20:39:42,365 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 20:39:42,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1248 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=682, Invalid=5018, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 20:39:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 20:39:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2018-02-02 20:39:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 20:39:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2018-02-02 20:39:42,368 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 94 [2018-02-02 20:39:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:42,369 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2018-02-02 20:39:42,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 20:39:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2018-02-02 20:39:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:39:42,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:42,369 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:42,369 INFO L371 AbstractCegarLoop]: === Iteration 50 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:42,370 INFO L82 PathProgramCache]: Analyzing trace with hash 931684587, now seen corresponding path program 4 times [2018-02-02 20:39:42,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:42,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 20:39:42,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:42,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:39:42,472 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 20:39:42,473 INFO L182 omatonBuilderFactory]: Interpolants [9840#(= entry_point_~i~0 0), 9841#(<= 1 entry_point_~i~0), 9842#(<= 2 entry_point_~i~0), 9843#(<= 3 entry_point_~i~0), 9844#(<= 4 entry_point_~i~0), 9845#(<= 3 entry_point_~j~0), 9846#(<= 2 entry_point_~j~0), 9847#(<= 1 entry_point_~j~0), 9848#(<= 0 entry_point_~j~0), 9838#true, 9839#false] [2018-02-02 20:39:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 20:39:42,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:39:42,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:39:42,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:39:42,473 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand 11 states. [2018-02-02 20:39:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:42,555 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-02 20:39:42,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:39:42,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-02-02 20:39:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:42,555 INFO L225 Difference]: With dead ends: 94 [2018-02-02 20:39:42,555 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 20:39:42,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:39:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 20:39:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-02-02 20:39:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 20:39:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-02-02 20:39:42,557 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 99 [2018-02-02 20:39:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:42,557 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-02-02 20:39:42,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:39:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-02-02 20:39:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:39:42,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:42,558 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:42,558 INFO L371 AbstractCegarLoop]: === Iteration 51 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash 931684636, now seen corresponding path program 6 times [2018-02-02 20:39:42,559 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:42,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-02 20:39:43,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:43,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:39:43,071 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-02-02 20:39:43,072 INFO L182 omatonBuilderFactory]: Interpolants [10048#(= 0 |ldv_malloc_#res.offset|), 10049#(= 0 |entry_point_#t~ret2.offset|), 10050#(= entry_point_~array~0.offset 0), 10051#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10052#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 10053#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10054#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10055#(= |#valid| |old(#valid)|), 10056#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10057#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10058#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 10059#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 10060#(and (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 10061#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (<= entry_point_~i~0 1)) (= entry_point_~array~0.offset 0)), 10062#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (<= entry_point_~i~0 2)) (= entry_point_~array~0.offset 0)), 10063#(and (= entry_point_~array~0.offset 0) (or (<= entry_point_~i~0 3) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))))), 10064#(and (or (<= entry_point_~j~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8)))))) (= entry_point_~array~0.offset 0)), 10065#(and (or (<= entry_point_~j~0 1) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (= entry_point_~array~0.offset 0)), 10066#(and (or (<= entry_point_~j~0 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0)))))) (= entry_point_~array~0.offset 0)), 10067#(or (<= entry_point_~j~0 0) (and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|)))), 10068#(or (<= entry_point_~j~0 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10069#(or (<= (+ entry_point_~j~0 1) 0) (= (select |#valid| entry_point_~array~0.base) 1)), 10070#(= (select |#valid| entry_point_~array~0.base) 1), 10045#true, 10046#false, 10047#(= 0 |ldv_malloc_#t~malloc1.offset|)] [2018-02-02 20:39:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 9 proven. 126 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-02 20:39:43,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:39:43,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:39:43,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:39:43,072 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 26 states. [2018-02-02 20:39:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:43,842 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-02-02 20:39:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 20:39:43,842 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 99 [2018-02-02 20:39:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:43,842 INFO L225 Difference]: With dead ends: 138 [2018-02-02 20:39:43,842 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 20:39:43,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=2299, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:39:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 20:39:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2018-02-02 20:39:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 20:39:43,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2018-02-02 20:39:43,844 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 99 [2018-02-02 20:39:43,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:43,845 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2018-02-02 20:39:43,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:39:43,845 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2018-02-02 20:39:43,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:39:43,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:43,845 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:43,845 INFO L371 AbstractCegarLoop]: === Iteration 52 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash 931684637, now seen corresponding path program 4 times [2018-02-02 20:39:43,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:43,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 20:39:43,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:43,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 20:39:43,949 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 20:39:43,949 INFO L182 omatonBuilderFactory]: Interpolants [10384#(<= 8 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10385#(<= 12 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10386#(<= 16 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10387#(<= 12 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10388#(<= 8 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10389#(<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)), 10390#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 4) (select |#length| entry_point_~array~0.base)) (<= 4 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 10391#(and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset 8) (select |#length| entry_point_~array~0.base)) (<= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))), 10380#true, 10381#false, 10382#(<= 0 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)), 10383#(<= 4 (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset))] [2018-02-02 20:39:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 20:39:43,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:39:43,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:39:43,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:39:43,950 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 12 states. [2018-02-02 20:39:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:44,104 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-02 20:39:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:39:44,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2018-02-02 20:39:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:44,105 INFO L225 Difference]: With dead ends: 126 [2018-02-02 20:39:44,105 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 20:39:44,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 20:39:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2018-02-02 20:39:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-02 20:39:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-02-02 20:39:44,108 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 99 [2018-02-02 20:39:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:44,108 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-02-02 20:39:44,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:39:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-02-02 20:39:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:39:44,109 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:44,109 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:44,109 INFO L371 AbstractCegarLoop]: === Iteration 53 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:44,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1182547327, now seen corresponding path program 5 times [2018-02-02 20:39:44,110 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:44,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 20:39:44,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:44,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 20:39:44,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-02-02 20:39:44,553 INFO L182 omatonBuilderFactory]: Interpolants [10656#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 entry_point_~p~0.offset)), 10657#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))), 10658#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0)), 10659#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~0) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2)), 10660#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0))), 10661#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (= 0 (select (store (select |#memory_$Pointer$.offset| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.offset) 0))), 10662#(and (<= entry_point_~i~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10663#(and (<= entry_point_~i~0 4) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10664#(and (<= entry_point_~j~0 3) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10665#(and (<= entry_point_~j~0 2) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10666#(and (<= entry_point_~j~0 1) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~array~0.base) 0)) (= entry_point_~array~0.offset 0)), 10667#(and (= entry_point_~array~0.offset 0) (or (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~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_~j~0)))))), 10668#(= |entry_point_#t~mem7.offset| 0), 10648#true, 10649#false, 10650#(= 0 |ldv_malloc_#t~malloc1.offset|), 10651#(= 0 |ldv_malloc_#res.offset|), 10652#(= 0 |entry_point_#t~ret2.offset|), 10653#(= entry_point_~array~0.offset 0), 10654#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10655#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= 0 |entry_point_#t~ret4.offset|))] [2018-02-02 20:39:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-02-02 20:39:44,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 20:39:44,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 20:39:44,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:39:44,553 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 21 states. [2018-02-02 20:39:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:44,871 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2018-02-02 20:39:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:39:44,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-02-02 20:39:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:44,872 INFO L225 Difference]: With dead ends: 136 [2018-02-02 20:39:44,872 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 20:39:44,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:39:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 20:39:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2018-02-02 20:39:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:39:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-02-02 20:39:44,874 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 100 [2018-02-02 20:39:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:44,874 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-02-02 20:39:44,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 20:39:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-02-02 20:39:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:39:44,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:44,875 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:44,875 INFO L371 AbstractCegarLoop]: === Iteration 54 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:44,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1182547326, now seen corresponding path program 5 times [2018-02-02 20:39:44,875 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:44,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 35 proven. 116 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:39:46,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:46,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-02-02 20:39:46,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:39:46,611 INFO L182 omatonBuilderFactory]: Interpolants [10953#true, 10954#false, 10955#(= 0 |ldv_malloc_#t~malloc1.offset|), 10956#(= 0 |ldv_malloc_#res.offset|), 10957#(= 0 |entry_point_#t~ret2.offset|), 10958#(= entry_point_~array~0.offset 0), 10959#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10960#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= (+ (div ldv_malloc_~size 4294967296) 1) 0) (and (<= ldv_malloc_~size |ldv_malloc_#in~size|) (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))))), 10961#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 10962#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)), 10963#(and (= 1 (select |#valid| |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10964#(and (= 1 (select |#valid| entry_point_~p~0.base)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10965#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 10966#(and (<= (* 4 entry_point_~i~0) 4) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 10967#(= |#valid| |old(#valid)|), 10968#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 10969#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10970#(and (<= (* 4 entry_point_~i~0) 4) (not (= |entry_point_#t~ret4.base| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (= entry_point_~array~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~ret4.base|))), 10971#(and (<= (* 4 entry_point_~i~0) 4) (not (= entry_point_~p~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)) entry_point_~p~0.base) 0))) (<= (+ (div (+ (- entry_point_~array~0.offset) 0) 4) 1) entry_point_~i~0) (not (= 0 entry_point_~p~0.base)) (= entry_point_~array~0.offset 0)), 10972#(and (= entry_point_~array~0.offset 0) (or (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0))))) (<= entry_point_~i~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 3))), 10973#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 10974#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= 0 |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= (select |old(#valid)| (@diff |old(#valid)| |#valid|)) 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 10975#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 7)) (<= (* 4 entry_point_~i~0) 8)), 10976#(and (or (and (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base)) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= 0 entry_point_~p~0.base)) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 4)))))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 10977#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 7)) (= entry_point_~array~0.offset 0) (<= (* 4 entry_point_~i~0) 8)), 10978#(and (<= (* 4 entry_point_~i~0) 12) (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| 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~0 (- 1))))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 11))), 10979#(and (or (and (<= entry_point_~i~0 3) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| 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~0 (- 1))))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) |entry_point_#t~ret4.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~ret4.base|))) (<= (* 4 entry_point_~i~0) 11)) (= entry_point_~array~0.offset 0)), 10980#(and (= entry_point_~array~0.offset 0) (or (and (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (= 1 (select |#valid| (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) entry_point_~p~0.base)) (<= entry_point_~i~0 3) (not (= 0 (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0))) (not (= 0 entry_point_~p~0.base)) (not (= (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0) (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1)))))))) (<= (* 4 entry_point_~i~0) 11))), 10981#(and (or (and (<= entry_point_~i~0 3) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| 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~0 (- 1))))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (* 4 entry_point_~i~0) 11)) (= entry_point_~array~0.offset 0)), 10982#(and (or (and (not (= (select (select |#memory_$Pointer$.base| 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~0 (- 2))))))) (<= entry_point_~i~0 4) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| 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~0 (- 1))))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) (- 12))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~i~0 (- 2)))))))) (<= (* 4 entry_point_~i~0) 15)) (= entry_point_~array~0.offset 0)), 10983#(and (or (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 3) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1)))))))) (<= (* 4 entry_point_~j~0) 11)) (= entry_point_~array~0.offset 0)), 10984#(and (<= (* 4 entry_point_~j~0) 12) (or (<= (* 4 entry_point_~j~0) 11) (and (or (= 0 (select |#valid| |entry_point_#t~mem7.base|)) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (or (not (= 1 (select |#valid| |entry_point_#t~mem7.base|))) (and (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))))))) (not (= 0 |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0)), 10985#(and (or (<= (* 4 entry_point_~j~0) 11) (and (<= entry_point_~j~0 3) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 8))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 (+ entry_point_~j~0 (- 1))))))))) (= entry_point_~array~0.offset 0)), 10986#(and (or (and (<= entry_point_~j~0 2) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 10987#(and (or (and (<= entry_point_~j~0 2) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7)) (= entry_point_~array~0.offset 0)), 10988#(and (= entry_point_~array~0.offset 0) (or (and (<= entry_point_~j~0 2) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~j~0) (- 4)))))) (<= (* 4 entry_point_~j~0) 7))), 10989#(and (= entry_point_~array~0.offset 0) (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))))), 10990#(and (or (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3) (and (<= entry_point_~j~0 1) (= 1 (select (store |#valid| |entry_point_#t~mem7.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0))) (not (= 0 |entry_point_#t~mem7.base|)))) (= entry_point_~array~0.offset 0)), 10991#(and (or (and (<= entry_point_~j~0 1) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))) (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 3)) (= entry_point_~array~0.offset 0)), 10992#(and (= entry_point_~array~0.offset 0) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset)))))), 10993#(= 1 (select |#valid| |entry_point_#t~mem7.base|))] [2018-02-02 20:39:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 35 proven. 116 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:39:46,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 20:39:46,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 20:39:46,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:39:46,612 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 41 states. [2018-02-02 20:39:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:47,881 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2018-02-02 20:39:47,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 20:39:47,881 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 100 [2018-02-02 20:39:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:47,882 INFO L225 Difference]: With dead ends: 132 [2018-02-02 20:39:47,882 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 20:39:47,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=484, Invalid=2822, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 20:39:47,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 20:39:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2018-02-02 20:39:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 20:39:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2018-02-02 20:39:47,884 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 100 [2018-02-02 20:39:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:47,884 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2018-02-02 20:39:47,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 20:39:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2018-02-02 20:39:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 20:39:47,885 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:47,885 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:47,885 INFO L371 AbstractCegarLoop]: === Iteration 55 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:47,885 INFO L82 PathProgramCache]: Analyzing trace with hash 99123107, now seen corresponding path program 2 times [2018-02-02 20:39:47,886 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:47,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-02 20:39:47,936 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:47,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:39:47,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-02-02 20:39:47,936 INFO L182 omatonBuilderFactory]: Interpolants [11286#true, 11287#false, 11288#(<= 10 entry_point_~len~0), 11289#(and (<= 10 entry_point_~len~0) (= entry_point_~i~0 0)), 11290#(<= (+ entry_point_~i~0 9) entry_point_~len~0), 11291#(<= (+ entry_point_~i~0 8) entry_point_~len~0), 11292#(<= (+ entry_point_~i~0 7) entry_point_~len~0), 11293#(<= (+ entry_point_~i~0 6) entry_point_~len~0), 11294#(<= (+ entry_point_~i~0 5) entry_point_~len~0)] [2018-02-02 20:39:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-02-02 20:39:47,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:39:47,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:39:47,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:39:47,937 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand 9 states. [2018-02-02 20:39:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:47,999 INFO L93 Difference]: Finished difference Result 181 states and 196 transitions. [2018-02-02 20:39:47,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:39:47,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2018-02-02 20:39:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:48,000 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:39:48,000 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:39:48,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:39:48,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:39:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 132. [2018-02-02 20:39:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 20:39:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2018-02-02 20:39:48,003 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 105 [2018-02-02 20:39:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:48,004 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2018-02-02 20:39:48,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:39:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2018-02-02 20:39:48,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 20:39:48,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:48,004 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:48,004 INFO L371 AbstractCegarLoop]: === Iteration 56 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1434887967, now seen corresponding path program 5 times [2018-02-02 20:39:48,005 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:48,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 124 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 20:39:48,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:48,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 20:39:48,711 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-02-02 20:39:48,712 INFO L182 omatonBuilderFactory]: Interpolants [11618#true, 11619#false, 11620#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= 0 |ldv_malloc_#t~malloc1.offset|)), 11621#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11622#(and (= 0 |entry_point_#t~ret2.offset|) (= (select |#valid| |entry_point_#t~ret2.base|) 1)), 11623#(and (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 11624#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (= (select |#valid| entry_point_~array~0.base) 1)), 11625#(= |#valid| |old(#valid)|), 11626#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 11627#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11628#(and (not (= entry_point_~array~0.base |entry_point_#t~ret4.base|)) (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0)), 11629#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base entry_point_~p~0.base))), 11630#(and (= entry_point_~i~0 0) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~i~0)))))), 11631#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 1) entry_point_~i~0) (<= entry_point_~i~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11632#(and (<= (+ (div (+ 0 (- entry_point_~array~0.offset)) 4) 2) entry_point_~i~0) (= entry_point_~array~0.offset 0) (<= entry_point_~i~0 2) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11633#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (not (= (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) 0)) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11634#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (store (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ (* 4 entry_point_~i~0) entry_point_~array~0.offset) entry_point_~p~0.base) 0)))), 11635#(and (<= entry_point_~i~0 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11636#(and (<= entry_point_~i~0 4) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11637#(and (<= entry_point_~j~0 3) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11638#(and (<= entry_point_~j~0 2) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11639#(and (<= entry_point_~j~0 1) (= entry_point_~array~0.offset 0) (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) 0)))), 11640#(and (or (not (= entry_point_~array~0.base (select (select |#memory_$Pointer$.base| entry_point_~array~0.base) (+ entry_point_~array~0.offset (* 4 entry_point_~j~0))))) (and (<= (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset) 0) (not (= 0 (+ (* 4 entry_point_~j~0) entry_point_~array~0.offset))))) (= entry_point_~array~0.offset 0)), 11641#(and (= 1 (select |#valid| entry_point_~array~0.base)) (not (= entry_point_~array~0.base |entry_point_#t~mem7.base|))), 11642#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 20:39:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 21 proven. 124 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-02-02 20:39:48,712 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 20:39:48,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 20:39:48,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:39:48,713 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand 25 states. [2018-02-02 20:39:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:49,375 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2018-02-02 20:39:49,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:39:49,375 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2018-02-02 20:39:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:49,376 INFO L225 Difference]: With dead ends: 144 [2018-02-02 20:39:49,376 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 20:39:49,376 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 20:39:49,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 20:39:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 133. [2018-02-02 20:39:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-02 20:39:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2018-02-02 20:39:49,380 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 105 [2018-02-02 20:39:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:49,380 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2018-02-02 20:39:49,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 20:39:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2018-02-02 20:39:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 20:39:49,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:49,381 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:49,382 INFO L371 AbstractCegarLoop]: === Iteration 57 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:49,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1434887917, now seen corresponding path program 5 times [2018-02-02 20:39:49,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:49,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:39:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 48 proven. 62 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 20:39:49,445 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:39:49,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:39:49,445 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:39:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-02-02 20:39:49,445 INFO L182 omatonBuilderFactory]: Interpolants [11952#true, 11953#false, 11954#(= entry_point_~i~0 0), 11955#(<= entry_point_~i~0 1), 11956#(<= entry_point_~i~0 2), 11957#(<= entry_point_~i~0 3), 11958#(<= entry_point_~i~0 4), 11959#(<= entry_point_~j~0 3), 11960#(<= entry_point_~j~0 2), 11961#(<= entry_point_~j~0 1), 11962#(<= entry_point_~j~0 0), 11963#(<= (+ entry_point_~j~0 1) 0)] [2018-02-02 20:39:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 48 proven. 62 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-02-02 20:39:49,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:39:49,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:39:49,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:39:49,446 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 12 states. [2018-02-02 20:39:49,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:39:49,508 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-02-02 20:39:49,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:39:49,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-02-02 20:39:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:39:49,509 INFO L225 Difference]: With dead ends: 134 [2018-02-02 20:39:49,509 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 20:39:49,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:39:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 20:39:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-02-02 20:39:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-02 20:39:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-02-02 20:39:49,512 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 105 [2018-02-02 20:39:49,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:39:49,512 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-02-02 20:39:49,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:39:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-02-02 20:39:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-02 20:39:49,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:39:49,513 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:39:49,513 INFO L371 AbstractCegarLoop]: === Iteration 58 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 20:39:49,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1062086081, now seen corresponding path program 5 times [2018-02-02 20:39:49,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:39:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:39:49,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:40:02,003 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 20:40:02,007 INFO L168 Benchmark]: Toolchain (without parser) took 70999.13 ms. Allocated memory was 391.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 347.8 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 20:40:02,008 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 391.1 MB. Free memory is still 353.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:40:02,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.88 ms. Allocated memory is still 391.1 MB. Free memory was 347.8 MB in the beginning and 334.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:40:02,009 INFO L168 Benchmark]: Boogie Preprocessor took 30.71 ms. Allocated memory is still 391.1 MB. Free memory was 334.6 MB in the beginning and 332.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:40:02,009 INFO L168 Benchmark]: RCFGBuilder took 195.12 ms. Allocated memory is still 391.1 MB. Free memory was 332.0 MB in the beginning and 314.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-02 20:40:02,009 INFO L168 Benchmark]: TraceAbstraction took 70605.17 ms. Allocated memory was 391.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 312.1 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. [2018-02-02 20:40:02,011 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.17 ms. Allocated memory is still 391.1 MB. Free memory is still 353.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.88 ms. Allocated memory is still 391.1 MB. Free memory was 347.8 MB in the beginning and 334.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.71 ms. Allocated memory is still 391.1 MB. Free memory was 334.6 MB in the beginning and 332.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 195.12 ms. Allocated memory is still 391.1 MB. Free memory was 332.0 MB in the beginning and 314.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 70605.17 ms. Allocated memory was 391.1 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 312.1 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-40-02-018.csv Completed graceful shutdown