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_test10_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:21:41,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:21:41,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:21:41,044 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:21:41,044 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:21:41,045 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:21:41,045 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:21:41,047 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:21:41,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:21:41,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:21:41,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:21:41,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:21:41,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:21:41,052 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:21:41,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:21:41,054 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:21:41,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:21:41,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:21:41,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:21:41,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:21:41,061 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:21:41,061 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:21:41,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:21:41,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:21:41,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:21:41,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:21:41,064 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:21:41,064 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:21:41,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:21:41,064 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:21:41,065 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:21:41,065 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-04 16:21:41,074 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:21:41,074 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:21:41,075 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:21:41,075 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:21:41,075 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:21:41,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:21:41,076 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:21:41,077 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:21:41,077 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:21:41,077 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:21:41,077 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:21:41,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:21:41,077 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:21:41,077 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:21:41,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:21:41,113 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:21:41,115 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:21:41,115 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:21:41,116 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:21:41,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_false-valid-memtrack_true-termination.i [2018-02-04 16:21:41,249 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:21:41,250 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:21:41,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:21:41,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:21:41,256 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:21:41,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41, skipping insertion in model container [2018-02-04 16:21:41,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,273 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:21:41,311 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:21:41,396 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:21:41,409 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:21:41,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41 WrapperNode [2018-02-04 16:21:41,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:21:41,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:21:41,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:21:41,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:21:41,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (1/1) ... [2018-02-04 16:21:41,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:21:41,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:21:41,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:21:41,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:21:41,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (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-04 16:21:41,495 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:21:41,495 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:21:41,495 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 16:21:41,495 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-02-04 16:21:41,496 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 16:21:41,496 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:21:41,496 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 16:21:41,496 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 16:21:41,496 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:21:41,496 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:21:41,496 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:21:41,496 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:21:41,497 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:21:41,708 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:21:41,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:21:41 BoogieIcfgContainer [2018-02-04 16:21:41,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:21:41,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:21:41,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:21:41,711 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:21:41,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:21:41" (1/3) ... [2018-02-04 16:21:41,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c13ed78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:21:41, skipping insertion in model container [2018-02-04 16:21:41,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:21:41" (2/3) ... [2018-02-04 16:21:41,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c13ed78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:21:41, skipping insertion in model container [2018-02-04 16:21:41,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:21:41" (3/3) ... [2018-02-04 16:21:41,713 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test10_false-valid-memtrack_true-termination.i [2018-02-04 16:21:41,718 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:21:41,723 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-02-04 16:21:41,746 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:21:41,746 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:21:41,746 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:21:41,746 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:21:41,746 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:21:41,746 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:21:41,747 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:21:41,747 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:21:41,748 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:21:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states. [2018-02-04 16:21:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 16:21:41,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:41,769 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:41,770 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:41,774 INFO L82 PathProgramCache]: Analyzing trace with hash 178224559, now seen corresponding path program 1 times [2018-02-04 16:21:41,816 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:41,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:41,920 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-04 16:21:41,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:21:41,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:21:41,924 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:41,925 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-04 16:21:41,925 INFO L182 omatonBuilderFactory]: Interpolants [84#true, 85#false, 86#(= |#valid| |old(#valid)|)] [2018-02-04 16:21:41,926 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-04 16:21:41,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:21:41,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:21:41,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:21:41,941 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 3 states. [2018-02-04 16:21:42,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:42,155 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2018-02-04 16:21:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:21:42,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 16:21:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:42,167 INFO L225 Difference]: With dead ends: 137 [2018-02-04 16:21:42,167 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 16:21:42,169 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-04 16:21:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 16:21:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 82. [2018-02-04 16:21:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 16:21:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-02-04 16:21:42,209 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 16 [2018-02-04 16:21:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:42,210 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-02-04 16:21:42,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:21:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-02-04 16:21:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 16:21:42,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:42,211 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:42,212 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash 892424113, now seen corresponding path program 1 times [2018-02-04 16:21:42,213 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:42,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:42,276 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-04 16:21:42,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:21:42,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:21:42,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:42,277 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-04 16:21:42,277 INFO L182 omatonBuilderFactory]: Interpolants [306#true, 307#false, 308#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 309#(not (= 0 |ldv_malloc_#res.base|)), 310#(not (= 0 |entry_point_#t~ret6.base|)), 311#(not (= 0 entry_point_~a10~0.base))] [2018-02-04 16:21:42,277 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-04 16:21:42,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:21:42,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:21:42,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:21:42,279 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 6 states. [2018-02-04 16:21:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:42,382 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-02-04 16:21:42,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:21:42,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 16:21:42,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:42,384 INFO L225 Difference]: With dead ends: 128 [2018-02-04 16:21:42,384 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 16:21:42,385 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-04 16:21:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 16:21:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 78. [2018-02-04 16:21:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 16:21:42,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-02-04 16:21:42,392 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 18 [2018-02-04 16:21:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:42,393 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-02-04 16:21:42,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:21:42,393 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-02-04 16:21:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 16:21:42,393 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:42,394 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:42,394 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2038882856, now seen corresponding path program 1 times [2018-02-04 16:21:42,395 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:42,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:42,447 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-04 16:21:42,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:42,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-04 16:21:42,448 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:42,449 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-04 16:21:42,449 INFO L182 omatonBuilderFactory]: Interpolants [520#true, 521#false, 522#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 523#(and (= 0 |entry_point_#t~ret6.base|) (= 0 |entry_point_#t~ret6.offset|)), 524#(and (= entry_point_~a10~0.base 0) (= 0 entry_point_~a10~0.offset))] [2018-02-04 16:21:42,449 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-04 16:21:42,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:21:42,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:21:42,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:21:42,450 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 5 states. [2018-02-04 16:21:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:42,483 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-02-04 16:21:42,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:21:42,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 16:21:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:42,484 INFO L225 Difference]: With dead ends: 82 [2018-02-04 16:21:42,484 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 16:21:42,484 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-04 16:21:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 16:21:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 16:21:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 16:21:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 16:21:42,488 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 19 [2018-02-04 16:21:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:42,488 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 16:21:42,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:21:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 16:21:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 16:21:42,489 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:42,489 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:42,489 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1489811686, now seen corresponding path program 1 times [2018-02-04 16:21:42,490 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:42,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:42,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:42,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:21:42,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:42,542 INFO L182 omatonBuilderFactory]: Interpolants [688#false, 689#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 690#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 691#(= 1 (select |#valid| |entry_point_#t~ret6.base|)), 692#(= 1 (select |#valid| entry_point_~a10~0.base)), 693#(= |#valid| |old(#valid)|), 687#true] [2018-02-04 16:21:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:42,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:21:42,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:21:42,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:21:42,543 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2018-02-04 16:21:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:42,749 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-02-04 16:21:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:21:42,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-04 16:21:42,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:42,751 INFO L225 Difference]: With dead ends: 98 [2018-02-04 16:21:42,751 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 16:21:42,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:21:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 16:21:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2018-02-04 16:21:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 16:21:42,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2018-02-04 16:21:42,756 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 21 [2018-02-04 16:21:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:42,756 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2018-02-04 16:21:42,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:21:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2018-02-04 16:21:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 16:21:42,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:42,757 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:42,757 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1489811687, now seen corresponding path program 1 times [2018-02-04 16:21:42,758 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:42,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:42,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:42,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:42,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:21:42,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:42,957 INFO L182 omatonBuilderFactory]: Interpolants [883#true, 884#false, 885#(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))))), 886#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 887#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 888#(and (= 0 |entry_point_#t~ret6.offset|) (<= 4 (select |#length| |entry_point_#t~ret6.base|))), 889#(and (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 890#(= |old(#length)| |#length|)] [2018-02-04 16:21:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:42,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:21:42,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:21:42,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:21:42,958 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 8 states. [2018-02-04 16:21:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:43,273 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-04 16:21:43,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:21:43,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 16:21:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:43,275 INFO L225 Difference]: With dead ends: 126 [2018-02-04 16:21:43,275 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 16:21:43,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:21:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 16:21:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-02-04 16:21:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-04 16:21:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2018-02-04 16:21:43,282 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 21 [2018-02-04 16:21:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:43,283 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2018-02-04 16:21:43,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:21:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2018-02-04 16:21:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 16:21:43,283 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:43,283 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:43,284 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:43,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1393839336, now seen corresponding path program 1 times [2018-02-04 16:21:43,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:43,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:43,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:43,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:21:43,378 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:43,378 INFO L182 omatonBuilderFactory]: Interpolants [1136#(= (select |#valid| |ldv_malloc_#res.base|) 1), 1137#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 1138#(= 1 (select |#valid| entry_point_~a10~0.base)), 1139#(= |#valid| |old(#valid)|), 1140#(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|)), 1141#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1133#true, 1134#false, 1135#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))] [2018-02-04 16:21:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:21:43,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:21:43,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:21:43,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:21:43,379 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand 9 states. [2018-02-04 16:21:43,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:43,626 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2018-02-04 16:21:43,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 16:21:43,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-04 16:21:43,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:43,628 INFO L225 Difference]: With dead ends: 122 [2018-02-04 16:21:43,628 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 16:21:43,628 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:21:43,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 16:21:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2018-02-04 16:21:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-04 16:21:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 132 transitions. [2018-02-04 16:21:43,633 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 132 transitions. Word has length 23 [2018-02-04 16:21:43,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:43,634 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 132 transitions. [2018-02-04 16:21:43,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:21:43,634 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 132 transitions. [2018-02-04 16:21:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 16:21:43,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:43,634 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:43,634 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:43,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1393839337, now seen corresponding path program 1 times [2018-02-04 16:21:43,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:43,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:43,819 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-04 16:21:43,820 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:43,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:21:43,820 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:43,820 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-04 16:21:43,820 INFO L182 omatonBuilderFactory]: Interpolants [1376#false, 1377#(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))), 1378#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|))) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 1379#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)) (<= 2147483648 |ldv_malloc_#in~size|))), 1380#(and (= 0 |entry_point_#t~ret6.offset|) (<= 4 (select |#length| |entry_point_#t~ret6.base|)) (= (select |#valid| |entry_point_#t~ret6.base|) 1)), 1381#(and (= (select |#valid| entry_point_~a10~0.base) 1) (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 1382#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1383#(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|))), 1384#(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|))))), 1385#(and (= entry_point_~a10~0.offset 0) (<= 4 (select |#length| entry_point_~a10~0.base))), 1375#true] [2018-02-04 16:21:43,820 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-04 16:21:43,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:21:43,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:21:43,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:21:43,821 INFO L87 Difference]: Start difference. First operand 103 states and 132 transitions. Second operand 11 states. [2018-02-04 16:21:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:44,201 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-02-04 16:21:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 16:21:44,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 16:21:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:44,203 INFO L225 Difference]: With dead ends: 120 [2018-02-04 16:21:44,203 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 16:21:44,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:21:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 16:21:44,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 70. [2018-02-04 16:21:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 16:21:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 16:21:44,205 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 23 [2018-02-04 16:21:44,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:44,206 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 16:21:44,206 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:21:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 16:21:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 16:21:44,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:44,206 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] [2018-02-04 16:21:44,207 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2074519941, now seen corresponding path program 1 times [2018-02-04 16:21:44,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:44,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:44,285 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-04 16:21:44,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:44,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:21:44,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:44,286 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-04 16:21:44,286 INFO L182 omatonBuilderFactory]: Interpolants [1588#true, 1589#false, 1590#(= |#valid| |old(#valid)|), 1591#(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)), 1592#(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|))), 1593#(and (= (select |old(#valid)| |entry_point_#t~ret6.base|) 0) (not (= 0 |entry_point_#t~ret6.base|)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret6.base| (select |#valid| |entry_point_#t~ret6.base|)))), 1594#(and (= (select |old(#valid)| entry_point_~a10~0.base) 0) (not (= 0 entry_point_~a10~0.base)) (= |#valid| (store |old(#valid)| entry_point_~a10~0.base (select |#valid| entry_point_~a10~0.base))))] [2018-02-04 16:21:44,286 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-04 16:21:44,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:21:44,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:21:44,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:21:44,287 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 7 states. [2018-02-04 16:21:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:44,448 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-04 16:21:44,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:21:44,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-04 16:21:44,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:44,450 INFO L225 Difference]: With dead ends: 107 [2018-02-04 16:21:44,450 INFO L226 Difference]: Without dead ends: 103 [2018-02-04 16:21:44,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:21:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-04 16:21:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2018-02-04 16:21:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 16:21:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 16:21:44,453 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 28 [2018-02-04 16:21:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:44,454 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 16:21:44,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:21:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 16:21:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 16:21:44,454 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:44,454 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] [2018-02-04 16:21:44,454 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1176134599, now seen corresponding path program 1 times [2018-02-04 16:21:44,455 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:44,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:44,499 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-04 16:21:44,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:21:44,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 16:21:44,500 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:44,500 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-04 16:21:44,500 INFO L182 omatonBuilderFactory]: Interpolants [1780#true, 1781#false, 1782#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 1783#(not (= 0 |ldv_malloc_#res.base|)), 1784#(not (= 0 |entry_point_#t~ret7.base|)), 1785#(not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 1786#(not (= 0 |entry_point_#t~mem9.base|))] [2018-02-04 16:21:44,500 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-04 16:21:44,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:21:44,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:21:44,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:21:44,501 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-02-04 16:21:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:44,562 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-02-04 16:21:44,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:21:44,562 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-04 16:21:44,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:44,563 INFO L225 Difference]: With dead ends: 78 [2018-02-04 16:21:44,563 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 16:21:44,563 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:21:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 16:21:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2018-02-04 16:21:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 16:21:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 16:21:44,567 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 30 [2018-02-04 16:21:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:44,567 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 16:21:44,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:21:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 16:21:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 16:21:44,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:44,568 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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-04 16:21:44,568 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1793953534, now seen corresponding path program 1 times [2018-02-04 16:21:44,569 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:44,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 16:21:44,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:44,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 16:21:44,623 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:44,623 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-04 16:21:44,623 INFO L182 omatonBuilderFactory]: Interpolants [1940#true, 1941#false, 1942#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1943#(and (= 0 |entry_point_#t~ret7.offset|) (= 0 |entry_point_#t~ret7.base|)), 1944#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 1945#(and (= |entry_point_#t~mem9.base| 0) (= |entry_point_#t~mem9.offset| 0))] [2018-02-04 16:21:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 16:21:44,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:21:44,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:21:44,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:21:44,624 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 6 states. [2018-02-04 16:21:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:44,655 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-02-04 16:21:44,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 16:21:44,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 16:21:44,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:44,657 INFO L225 Difference]: With dead ends: 73 [2018-02-04 16:21:44,657 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 16:21:44,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:21:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 16:21:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 16:21:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 16:21:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 16:21:44,660 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 31 [2018-02-04 16:21:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:44,661 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 16:21:44,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:21:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 16:21:44,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 16:21:44,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:44,662 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:44,662 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash -644511616, now seen corresponding path program 2 times [2018-02-04 16:21:44,663 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:44,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:44,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:44,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 16:21:44,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:44,726 INFO L182 omatonBuilderFactory]: Interpolants [2096#(= 1 (select |#valid| |entry_point_#t~ret7.base|)), 2097#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 2098#(= 1 (select |#valid| |entry_point_#t~mem10.base|)), 2099#(= |#valid| |old(#valid)|), 2092#true, 2093#false, 2094#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2095#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-04 16:21:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:44,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 16:21:44,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 16:21:44,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:21:44,727 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 8 states. [2018-02-04 16:21:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:44,896 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 16:21:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:21:44,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-04 16:21:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:44,905 INFO L225 Difference]: With dead ends: 77 [2018-02-04 16:21:44,905 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 16:21:44,905 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:21:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 16:21:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-02-04 16:21:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 16:21:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 16:21:44,908 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 33 [2018-02-04 16:21:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:44,908 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 16:21:44,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 16:21:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 16:21:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 16:21:44,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:44,909 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:44,909 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -644511615, now seen corresponding path program 1 times [2018-02-04 16:21:44,911 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:44,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:45,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:45,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:21:45,057 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:45,058 INFO L182 omatonBuilderFactory]: Interpolants [2256#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 2257#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 2258#(and (= 0 |entry_point_#t~ret7.offset|) (<= 4 (select |#length| |entry_point_#t~ret7.base|))), 2259#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 2260#(and (<= 4 (select |#length| |entry_point_#t~mem10.base|)) (= |entry_point_#t~mem10.offset| 0)), 2261#(= |old(#length)| |#length|), 2253#true, 2254#false, 2255#(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)))))] [2018-02-04 16:21:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:45,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:21:45,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:21:45,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:21:45,059 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-02-04 16:21:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:45,326 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 16:21:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:21:45,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-04 16:21:45,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:45,327 INFO L225 Difference]: With dead ends: 77 [2018-02-04 16:21:45,327 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 16:21:45,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:21:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 16:21:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-02-04 16:21:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 16:21:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-02-04 16:21:45,330 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 33 [2018-02-04 16:21:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:45,331 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-02-04 16:21:45,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:21:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-02-04 16:21:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 16:21:45,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:45,331 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:45,332 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:45,332 INFO L82 PathProgramCache]: Analyzing trace with hash -991528574, now seen corresponding path program 1 times [2018-02-04 16:21:45,333 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:45,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:45,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:45,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:45,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 16:21:45,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:45,428 INFO L182 omatonBuilderFactory]: Interpolants [2420#true, 2421#false, 2422#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2423#(= (select |#valid| |ldv_malloc_#res.base|) 1), 2424#(= (select |#valid| |entry_point_#t~ret7.base|) 1), 2425#(= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1), 2426#(= (select |#valid| |entry_point_#t~mem10.base|) 1), 2427#(= |#valid| |old(#valid)|), 2428#(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|)), 2429#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-04 16:21:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:45,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 16:21:45,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 16:21:45,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:21:45,429 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 10 states. [2018-02-04 16:21:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:45,610 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-02-04 16:21:45,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 16:21:45,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-02-04 16:21:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:45,610 INFO L225 Difference]: With dead ends: 75 [2018-02-04 16:21:45,611 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 16:21:45,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:21:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 16:21:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-02-04 16:21:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 16:21:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 16:21:45,613 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 35 [2018-02-04 16:21:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:45,613 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 16:21:45,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 16:21:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 16:21:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 16:21:45,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:45,613 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:45,613 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash -991528573, now seen corresponding path program 1 times [2018-02-04 16:21:45,614 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:45,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:45,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:45,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:21:45,828 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:45,828 INFO L182 omatonBuilderFactory]: Interpolants [2592#(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|))))), 2593#(and (<= 4 (select |#length| |entry_point_#t~mem10.base|)) (= |entry_point_#t~mem10.offset| 0)), 2582#true, 2583#false, 2584#(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))), 2585#(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|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 2586#(and (= 0 |ldv_malloc_#res.offset|) (= (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|))), 2587#(and (= 0 |entry_point_#t~ret7.offset|) (<= 4 (select |#length| |entry_point_#t~ret7.base|)) (= (select |#valid| |entry_point_#t~ret7.base|) 1)), 2588#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 2589#(and (<= 4 (select |#length| |entry_point_#t~mem10.base|)) (= (select |#valid| |entry_point_#t~mem10.base|) 1) (= |entry_point_#t~mem10.offset| 0)), 2590#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 2591#(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|)))] [2018-02-04 16:21:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:45,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:21:45,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:21:45,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:21:45,829 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 12 states. [2018-02-04 16:21:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:46,179 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-04 16:21:46,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:21:46,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-04 16:21:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:46,180 INFO L225 Difference]: With dead ends: 74 [2018-02-04 16:21:46,180 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 16:21:46,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:21:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 16:21:46,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-02-04 16:21:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 16:21:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-02-04 16:21:46,182 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 35 [2018-02-04 16:21:46,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:46,182 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-02-04 16:21:46,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:21:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-02-04 16:21:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 16:21:46,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:46,182 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:46,182 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:46,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2141714276, now seen corresponding path program 1 times [2018-02-04 16:21:46,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:46,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:46,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:46,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:21:46,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:46,299 INFO L182 omatonBuilderFactory]: Interpolants [2752#(= |#valid| |old(#valid)|), 2753#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 2754#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 2755#(and (= 1 (select |#valid| |entry_point_#t~ret7.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 2756#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 2757#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 2758#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 2759#(= 1 (select |#valid| |entry_point_#t~mem13.base|)), 2746#true, 2747#false, 2748#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 2749#(= (select |#valid| |ldv_malloc_#res.base|) 1), 2750#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 2751#(= (select |#valid| entry_point_~a10~0.base) 1)] [2018-02-04 16:21:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:46,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:21:46,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:21:46,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:21:46,300 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-02-04 16:21:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:46,600 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-02-04 16:21:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:21:46,600 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-04 16:21:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:46,600 INFO L225 Difference]: With dead ends: 85 [2018-02-04 16:21:46,600 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 16:21:46,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:21:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 16:21:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-02-04 16:21:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 16:21:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-04 16:21:46,603 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 36 [2018-02-04 16:21:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:46,604 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-04 16:21:46,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:21:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-04 16:21:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 16:21:46,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:46,605 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:46,605 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:46,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2141714275, now seen corresponding path program 1 times [2018-02-04 16:21:46,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:46,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:46,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:46,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:21:46,739 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:46,739 INFO L182 omatonBuilderFactory]: Interpolants [2928#true, 2929#false, 2930#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 2931#(= (select |#valid| |ldv_malloc_#res.base|) 1), 2932#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 2933#(= (select |#valid| entry_point_~a10~0.base) 1), 2934#(= |#valid| |old(#valid)|), 2935#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 2936#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 2937#(and (= 0 |entry_point_#t~ret7.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 2938#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 2939#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 2940#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 2941#(and (= |entry_point_#t~mem13.offset| 0) (<= 4 (select |#length| |entry_point_#t~mem13.base|)))] [2018-02-04 16:21:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:46,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:21:46,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:21:46,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:21:46,740 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 14 states. [2018-02-04 16:21:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:46,987 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-02-04 16:21:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 16:21:46,987 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-04 16:21:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:46,988 INFO L225 Difference]: With dead ends: 85 [2018-02-04 16:21:46,988 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 16:21:46,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:21:46,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 16:21:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2018-02-04 16:21:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 16:21:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-02-04 16:21:46,991 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 36 [2018-02-04 16:21:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:46,991 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-02-04 16:21:46,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:21:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-02-04 16:21:46,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 16:21:46,992 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:46,992 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:46,992 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2137628582, now seen corresponding path program 1 times [2018-02-04 16:21:46,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:47,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:47,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:47,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:21:47,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:47,127 INFO L182 omatonBuilderFactory]: Interpolants [3118#true, 3119#false, 3120#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 3121#(= (select |#valid| |ldv_malloc_#res.base|) 1), 3122#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 3123#(= (select |#valid| entry_point_~a10~0.base) 1), 3124#(= |#valid| |old(#valid)|), 3125#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 3126#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 3127#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 3128#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3129#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 3130#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3131#(= 1 (select |#valid| |entry_point_#t~mem13.base|))] [2018-02-04 16:21:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:47,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:21:47,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:21:47,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:21:47,128 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 14 states. [2018-02-04 16:21:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:47,403 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-02-04 16:21:47,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:21:47,403 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-02-04 16:21:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:47,404 INFO L225 Difference]: With dead ends: 84 [2018-02-04 16:21:47,404 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 16:21:47,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:21:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 16:21:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 65. [2018-02-04 16:21:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 16:21:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 16:21:47,408 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2018-02-04 16:21:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:47,408 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 16:21:47,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:21:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 16:21:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 16:21:47,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:47,409 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:47,409 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash -2070779991, now seen corresponding path program 1 times [2018-02-04 16:21:47,411 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:47,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:47,512 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:47,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:47,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-04 16:21:47,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:47,513 INFO L182 omatonBuilderFactory]: Interpolants [3301#true, 3302#false, 3303#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 3304#(= (select |#valid| |ldv_malloc_#res.base|) 1), 3305#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 3306#(= (select |#valid| entry_point_~a10~0.base) 1), 3307#(= |#valid| |old(#valid)|), 3308#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3309#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 3310#(and (= 0 |entry_point_#t~ret7.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 3311#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3312#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 3313#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 3314#(= |entry_point_#t~mem17.offset| 0)] [2018-02-04 16:21:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 16:21:47,513 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 16:21:47,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 16:21:47,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-04 16:21:47,513 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 14 states. [2018-02-04 16:21:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:47,727 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-04 16:21:47,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 16:21:47,728 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-02-04 16:21:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:47,728 INFO L225 Difference]: With dead ends: 82 [2018-02-04 16:21:47,728 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 16:21:47,728 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:21:47,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 16:21:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2018-02-04 16:21:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 16:21:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-02-04 16:21:47,730 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 39 [2018-02-04 16:21:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:47,730 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-02-04 16:21:47,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 16:21:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-02-04 16:21:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 16:21:47,731 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:47,731 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:47,731 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2070779990, now seen corresponding path program 1 times [2018-02-04 16:21:47,732 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:47,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 16:21:47,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:21:47,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:21:47,761 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:47,761 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-04 16:21:47,761 INFO L182 omatonBuilderFactory]: Interpolants [3480#true, 3481#false, 3482#(= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 3483#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3484#(= 1 (select |#valid| |entry_point_#t~mem17.base|))] [2018-02-04 16:21:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 16:21:47,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:21:47,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:21:47,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:21:47,761 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 5 states. [2018-02-04 16:21:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:47,814 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 16:21:47,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:21:47,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-04 16:21:47,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:47,816 INFO L225 Difference]: With dead ends: 66 [2018-02-04 16:21:47,816 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 16:21:47,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:21:47,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 16:21:47,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 16:21:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 16:21:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-02-04 16:21:47,818 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 39 [2018-02-04 16:21:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:47,818 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-02-04 16:21:47,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:21:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-02-04 16:21:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 16:21:47,818 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:47,818 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:47,818 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash 230411716, now seen corresponding path program 1 times [2018-02-04 16:21:47,819 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:47,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:21:47,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:21:47,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:21:47,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:47,867 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-04 16:21:47,867 INFO L182 omatonBuilderFactory]: Interpolants [3621#true, 3622#false, 3623#(= 1 (select |#valid| entry_point_~a10~0.base)), 3624#(= |#valid| |old(#valid)|), 3625#(= 1 (select |#valid| |alloc_10_#in~a.base|)), 3626#(= 1 (select |#valid| alloc_10_~a.base))] [2018-02-04 16:21:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:21:47,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 16:21:47,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 16:21:47,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 16:21:47,868 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 6 states. [2018-02-04 16:21:47,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:47,966 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-02-04 16:21:47,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 16:21:47,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-04 16:21:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:47,967 INFO L225 Difference]: With dead ends: 75 [2018-02-04 16:21:47,967 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 16:21:47,967 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 16:21:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 16:21:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-02-04 16:21:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 16:21:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 16:21:47,969 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 40 [2018-02-04 16:21:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:47,969 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 16:21:47,969 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 16:21:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 16:21:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 16:21:47,970 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:47,970 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:47,970 INFO L371 AbstractCegarLoop]: === Iteration 21 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash 230411717, now seen corresponding path program 1 times [2018-02-04 16:21:47,971 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:47,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 16:21:48,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:48,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 16:21:48,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:48,050 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-04 16:21:48,050 INFO L182 omatonBuilderFactory]: Interpolants [3776#(= 0 entry_point_~a10~0.offset), 3777#(and (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 3778#(and (<= 4 (select |#length| |alloc_10_#in~a.base|)) (= 0 |alloc_10_#in~a.offset|)), 3779#(and (= alloc_10_~a.offset 0) (<= 4 (select |#length| alloc_10_~a.base))), 3771#true, 3772#false, 3773#(= 0 |ldv_malloc_#t~malloc1.offset|), 3774#(= 0 |ldv_malloc_#res.offset|), 3775#(= 0 |entry_point_#t~ret6.offset|)] [2018-02-04 16:21:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 16:21:48,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 16:21:48,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 16:21:48,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 16:21:48,051 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 9 states. [2018-02-04 16:21:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:48,136 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 16:21:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 16:21:48,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-02-04 16:21:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:48,137 INFO L225 Difference]: With dead ends: 64 [2018-02-04 16:21:48,137 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 16:21:48,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:21:48,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 16:21:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 16:21:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 16:21:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 16:21:48,138 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 40 [2018-02-04 16:21:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:48,139 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 16:21:48,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 16:21:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 16:21:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 16:21:48,139 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:48,139 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:48,140 INFO L371 AbstractCegarLoop]: === Iteration 22 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:48,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1447171422, now seen corresponding path program 1 times [2018-02-04 16:21:48,140 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:48,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 16:21:48,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:21:48,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:21:48,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:48,194 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-04 16:21:48,194 INFO L182 omatonBuilderFactory]: Interpolants [3912#true, 3913#false, 3914#(= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 3915#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3916#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 3917#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset))), 3918#(= 1 (select |#valid| |alloc_10_#t~mem2.base|))] [2018-02-04 16:21:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 16:21:48,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:21:48,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:21:48,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:21:48,195 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 7 states. [2018-02-04 16:21:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:48,295 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-04 16:21:48,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:21:48,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 16:21:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:48,298 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:21:48,298 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 16:21:48,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:21:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 16:21:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 16:21:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 16:21:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-02-04 16:21:48,302 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 41 [2018-02-04 16:21:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:48,302 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-02-04 16:21:48,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:21:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-02-04 16:21:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 16:21:48,303 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:48,303 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:48,303 INFO L371 AbstractCegarLoop]: === Iteration 23 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:48,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1447171421, now seen corresponding path program 1 times [2018-02-04 16:21:48,304 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:48,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:48,368 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 16:21:48,369 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:21:48,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 16:21:48,369 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:48,369 INFO L182 omatonBuilderFactory]: Interpolants [4051#true, 4052#false, 4053#(and (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4054#(and (<= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 4055#(and (<= 0 (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))), 4056#(and (<= 0 (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset)) (<= (+ (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)))), 4057#(and (<= 0 |alloc_10_#t~mem2.offset|) (<= (+ |alloc_10_#t~mem2.offset| 4) (select |#length| |alloc_10_#t~mem2.base|)))] [2018-02-04 16:21:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 16:21:48,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 16:21:48,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 16:21:48,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:21:48,370 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 7 states. [2018-02-04 16:21:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:48,482 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-04 16:21:48,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 16:21:48,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-04 16:21:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:48,483 INFO L225 Difference]: With dead ends: 67 [2018-02-04 16:21:48,483 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 16:21:48,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 16:21:48,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 16:21:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 16:21:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 16:21:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-02-04 16:21:48,487 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 41 [2018-02-04 16:21:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:48,487 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-02-04 16:21:48,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 16:21:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-02-04 16:21:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 16:21:48,488 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:48,488 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:48,488 INFO L371 AbstractCegarLoop]: === Iteration 24 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:48,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1449711540, now seen corresponding path program 1 times [2018-02-04 16:21:48,489 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:48,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:48,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:48,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 16:21:48,643 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:48,644 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-04 16:21:48,644 INFO L182 omatonBuilderFactory]: Interpolants [4193#true, 4194#false, 4195#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4196#(and (= 0 |ldv_malloc_#res.offset|) (not (= 0 |ldv_malloc_#res.base|))), 4197#(and (= 0 |entry_point_#t~ret6.offset|) (not (= 0 |entry_point_#t~ret6.base|))), 4198#(and (not (= 0 entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0)), 4199#(and (not (= 0 entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0) (= 1 (select |#valid| entry_point_~a10~0.base))), 4200#(= |#valid| |old(#valid)|), 4201#(and (not (= 0 entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 1 (select |#valid| entry_point_~a10~0.base)) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4202#(and (not (= 0 entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) |entry_point_#t~mem14.base|) (= 1 (select |#valid| entry_point_~a10~0.base))), 4203#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0) (= 1 (select |#valid| entry_point_~a10~0.base))), 4204#(and (or (= entry_point_~a10~0.base |entry_point_#t~mem17.base|) (= 1 (select |#valid| entry_point_~a10~0.base))) (or (not (= |entry_point_#t~mem17.offset| 0)) (not (= entry_point_~a10~0.base |entry_point_#t~mem17.base|)))), 4205#(= 1 (select |#valid| entry_point_~a10~0.base))] [2018-02-04 16:21:48,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:48,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 16:21:48,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 16:21:48,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-04 16:21:48,645 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 13 states. [2018-02-04 16:21:48,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:48,868 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-04 16:21:48,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:21:48,868 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-02-04 16:21:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:48,868 INFO L225 Difference]: With dead ends: 74 [2018-02-04 16:21:48,868 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 16:21:48,869 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:21:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 16:21:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-02-04 16:21:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 16:21:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 16:21:48,871 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 41 [2018-02-04 16:21:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:48,871 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 16:21:48,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 16:21:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 16:21:48,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 16:21:48,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:48,872 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:48,872 INFO L371 AbstractCegarLoop]: === Iteration 25 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:48,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1834670273, now seen corresponding path program 1 times [2018-02-04 16:21:48,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:48,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:49,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:49,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 16:21:49,283 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:49,283 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-04 16:21:49,283 INFO L182 omatonBuilderFactory]: Interpolants [4354#true, 4355#false, 4356#(= |#valid| |old(#valid)|), 4357#(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)), 4358#(and (= 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)), 4359#(and (= 0 (select |old(#valid)| |entry_point_#t~ret6.base|)) (= (select |#valid| |entry_point_#t~ret6.base|) 1) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |entry_point_#t~ret6.base|))), 4360#(and (not (= 0 entry_point_~a10~0.base)) (= (select |#valid| entry_point_~a10~0.base) 1) (= (store |#valid| entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 4361#(and (not (= entry_point_~a10~0.base 0)) (not (= 0 |entry_point_#t~ret7.base|)) (= (store (store |#valid| |entry_point_#t~ret7.base| (select |old(#valid)| |entry_point_#t~ret7.base|)) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret7.base|)) (= (select |#valid| |entry_point_#t~ret7.base|) 1) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 4362#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 4363#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|)) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 4364#(and (= (select (store |#valid| |entry_point_#t~mem17.base| 0) |entry_point_#t~mem17.base|) (select |old(#valid)| |entry_point_#t~mem17.base|)) (not (= 0 |entry_point_#t~mem17.base|)) (not (= entry_point_~a10~0.base 0)) (not (= entry_point_~a10~0.base |entry_point_#t~mem17.base|)) (= (select |#valid| |entry_point_#t~mem17.base|) 1) (= (store (store |#valid| entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |entry_point_#t~mem17.base| (select |old(#valid)| |entry_point_#t~mem17.base|)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 4365#(and (= (select (store |#valid| entry_point_~a10~0.base 0) entry_point_~a10~0.base) (select |old(#valid)| entry_point_~a10~0.base)) (not (= entry_point_~a10~0.base 0)) (= (select (store |#valid| entry_point_~a10~0.base 0) (@diff (store |#valid| entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|))))] [2018-02-04 16:21:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:49,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 16:21:49,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 16:21:49,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-02-04 16:21:49,284 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 12 states. [2018-02-04 16:21:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:49,630 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-02-04 16:21:49,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 16:21:49,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-02-04 16:21:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:49,631 INFO L225 Difference]: With dead ends: 83 [2018-02-04 16:21:49,631 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 16:21:49,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-02-04 16:21:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 16:21:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-02-04 16:21:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 16:21:49,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-02-04 16:21:49,633 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 44 [2018-02-04 16:21:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:49,633 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-02-04 16:21:49,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 16:21:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-02-04 16:21:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 16:21:49,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:49,634 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:49,634 INFO L371 AbstractCegarLoop]: === Iteration 26 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -81360860, now seen corresponding path program 1 times [2018-02-04 16:21:49,635 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:49,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:49,855 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:21:49,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:49,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:21:49,855 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:21:49,856 INFO L182 omatonBuilderFactory]: Interpolants [4526#true, 4527#false, 4528#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4529#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4530#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 4531#(= (select |#valid| entry_point_~a10~0.base) 1), 4532#(= |#valid| |old(#valid)|), 4533#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 4534#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 4535#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 4536#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4537#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 4538#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 4539#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 |entry_point_#t~ret11.offset|) (= 0 |entry_point_#t~ret11.base|) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 4540#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 4541#(and (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~mem13.base|) |entry_point_#t~mem13.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~mem13.base|) |entry_point_#t~mem13.offset|))), 4542#(and (= |entry_point_#t~mem14.offset| 0) (= |entry_point_#t~mem14.base| 0))] [2018-02-04 16:21:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:21:49,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 16:21:49,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 16:21:49,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 16:21:49,856 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 17 states. [2018-02-04 16:21:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:50,140 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-02-04 16:21:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 16:21:50,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-04 16:21:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:50,141 INFO L225 Difference]: With dead ends: 78 [2018-02-04 16:21:50,141 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 16:21:50,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:21:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 16:21:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2018-02-04 16:21:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 16:21:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 16:21:50,143 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 47 [2018-02-04 16:21:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:50,143 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 16:21:50,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 16:21:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 16:21:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 16:21:50,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:50,144 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:50,144 INFO L371 AbstractCegarLoop]: === Iteration 27 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:50,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1675849089, now seen corresponding path program 1 times [2018-02-04 16:21:50,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:50,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:50,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:50,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-04 16:21:50,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:50,333 INFO L182 omatonBuilderFactory]: Interpolants [4708#true, 4709#false, 4710#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4711#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4712#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 4713#(= (select |#valid| entry_point_~a10~0.base) 1), 4714#(= |#valid| |old(#valid)|), 4715#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4716#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 4717#(and (= 0 |entry_point_#t~ret7.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 4718#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4719#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| 0) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 4720#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 4721#(not (= 0 |ldv_malloc_#res.base|)), 4722#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| 0) (not (= 0 |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 4723#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))), 4724#(and (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0)))), 4725#(or (not (= 0 |entry_point_#t~mem14.base|)) (not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0))), 4726#(not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)), 4727#(not (= |entry_point_#t~mem17.offset| 0))] [2018-02-04 16:21:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:50,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:21:50,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:21:50,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:21:50,334 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 20 states. [2018-02-04 16:21:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:50,690 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-02-04 16:21:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 16:21:50,690 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-02-04 16:21:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:50,691 INFO L225 Difference]: With dead ends: 67 [2018-02-04 16:21:50,692 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 16:21:50,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2018-02-04 16:21:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 16:21:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-02-04 16:21:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 16:21:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-04 16:21:50,694 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 46 [2018-02-04 16:21:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:50,695 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-04 16:21:50,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:21:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-04 16:21:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 16:21:50,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:50,695 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:50,695 INFO L371 AbstractCegarLoop]: === Iteration 28 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash 489983398, now seen corresponding path program 2 times [2018-02-04 16:21:50,696 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:50,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 16:21:50,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:50,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 16:21:50,853 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 16:21:50,853 INFO L182 omatonBuilderFactory]: Interpolants [4896#(= 1 (select |#valid| |alloc_10_#t~mem3.base|)), 4879#true, 4880#false, 4881#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4882#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4883#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 4884#(= (select |#valid| entry_point_~a10~0.base) 1), 4885#(= |#valid| |old(#valid)|), 4886#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 4887#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 4888#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 4889#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4890#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 4891#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|)) (= 1 (select |#valid| |entry_point_#t~ret11.base|))), 4892#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 4893#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))), 4894#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)) (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset)))), 4895#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|)))] [2018-02-04 16:21:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 16:21:50,853 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 16:21:50,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 16:21:50,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:21:50,854 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 18 states. [2018-02-04 16:21:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:51,164 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-02-04 16:21:51,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 16:21:51,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-04 16:21:51,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:51,164 INFO L225 Difference]: With dead ends: 66 [2018-02-04 16:21:51,164 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 16:21:51,165 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-02-04 16:21:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 16:21:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-04 16:21:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 16:21:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 16:21:51,166 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 49 [2018-02-04 16:21:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:51,166 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 16:21:51,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 16:21:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 16:21:51,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 16:21:51,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:51,167 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:51,167 INFO L371 AbstractCegarLoop]: === Iteration 29 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:51,167 INFO L82 PathProgramCache]: Analyzing trace with hash 489983399, now seen corresponding path program 1 times [2018-02-04 16:21:51,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:51,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:51,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:51,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:21:51,548 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:51,548 INFO L182 omatonBuilderFactory]: Interpolants [5056#(= |#valid| |old(#valid)|), 5057#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 5058#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 5059#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 5060#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5061#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5062#(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))), 5063#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5064#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 5065#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= 4 (select |#length| |entry_point_#t~ret11.base|)) (= 0 |entry_point_#t~ret11.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5066#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 5067#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))))), 5068#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)) (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)) (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset))))), 5069#(and (= 0 (select (select |#memory_$Pointer$.offset| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|)))), 5070#(and (= |alloc_10_#t~mem3.offset| 0) (<= 4 (select |#length| |alloc_10_#t~mem3.base|))), 5071#(= |old(#length)| |#length|), 5050#true, 5051#false, 5052#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5053#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5054#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 5055#(= (select |#valid| entry_point_~a10~0.base) 1)] [2018-02-04 16:21:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:51,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:21:51,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:21:51,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:21:51,549 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 22 states. [2018-02-04 16:21:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:52,284 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-04 16:21:52,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 16:21:52,284 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-02-04 16:21:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:52,285 INFO L225 Difference]: With dead ends: 65 [2018-02-04 16:21:52,285 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 16:21:52,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 16:21:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 16:21:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-02-04 16:21:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 16:21:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-02-04 16:21:52,288 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 49 [2018-02-04 16:21:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:52,288 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-02-04 16:21:52,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:21:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-02-04 16:21:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 16:21:52,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:52,289 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:52,289 INFO L371 AbstractCegarLoop]: === Iteration 30 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:52,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1663113944, now seen corresponding path program 1 times [2018-02-04 16:21:52,289 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:52,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 16:21:52,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:52,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-04 16:21:52,536 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 16:21:52,536 INFO L182 omatonBuilderFactory]: Interpolants [5248#(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|)), 5249#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5230#true, 5231#false, 5232#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5233#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5234#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 5235#(= (select |#valid| entry_point_~a10~0.base) 1), 5236#(= |#valid| |old(#valid)|), 5237#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 5238#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 5239#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 5240#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5241#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5242#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|)) (= 1 (select |#valid| |entry_point_#t~ret11.base|))), 5243#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 5244#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) 1), 5245#(= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)) (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset))) 1), 5246#(= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|)) 1), 5247#(= (select |#valid| |alloc_10_#t~mem3.base|) 1)] [2018-02-04 16:21:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 16:21:52,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 16:21:52,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 16:21:52,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-04 16:21:52,536 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 20 states. [2018-02-04 16:21:52,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:52,944 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-02-04 16:21:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:21:52,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-02-04 16:21:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:52,987 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:21:52,987 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 16:21:52,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 16:21:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 16:21:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-02-04 16:21:52,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 16:21:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-04 16:21:52,989 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 51 [2018-02-04 16:21:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:52,989 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-04 16:21:52,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 16:21:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-04 16:21:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 16:21:52,990 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:52,990 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:52,990 INFO L371 AbstractCegarLoop]: === Iteration 31 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1663113943, now seen corresponding path program 1 times [2018-02-04 16:21:52,991 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:53,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:53,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:53,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:21:53,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:53,405 INFO L182 omatonBuilderFactory]: Interpolants [5409#true, 5410#false, 5411#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5412#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5413#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 5414#(= (select |#valid| entry_point_~a10~0.base) 1), 5415#(= |#valid| |old(#valid)|), 5416#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 5417#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 5418#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 5419#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5420#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5421#(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))), 5422#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|))) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5423#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)) (<= 2147483648 |ldv_malloc_#in~size|))), 5424#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= 4 (select |#length| |entry_point_#t~ret11.base|)) (= 0 |entry_point_#t~ret11.offset|) (= (select |#valid| |entry_point_#t~ret11.base|) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5425#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))) 1)), 5426#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) 1) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))))), 5427#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)) (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)) (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset)) (select (select |#memory_$Pointer$.offset| alloc_10_~a.base) alloc_10_~a.offset))) 1)), 5428#(and (= 0 (select (select |#memory_$Pointer$.offset| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|)) 1)), 5429#(and (= (select |#valid| |alloc_10_#t~mem3.base|) 1) (= |alloc_10_#t~mem3.offset| 0) (<= 4 (select |#length| |alloc_10_#t~mem3.base|))), 5430#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 5431#(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|))), 5432#(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|))))), 5433#(and (= |alloc_10_#t~mem3.offset| 0) (<= 4 (select |#length| |alloc_10_#t~mem3.base|)))] [2018-02-04 16:21:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 16:21:53,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:21:53,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:21:53,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:21:53,406 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 25 states. [2018-02-04 16:21:54,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:54,054 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-02-04 16:21:54,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 16:21:54,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2018-02-04 16:21:54,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:54,055 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:21:54,055 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 16:21:54,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 16:21:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 16:21:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-02-04 16:21:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 16:21:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-02-04 16:21:54,056 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 51 [2018-02-04 16:21:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:54,056 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-02-04 16:21:54,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:21:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-02-04 16:21:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 16:21:54,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:54,057 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:54,057 INFO L371 AbstractCegarLoop]: === Iteration 32 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:54,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1194508568, now seen corresponding path program 1 times [2018-02-04 16:21:54,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:54,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:54,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:54,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 16:21:54,395 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:54,395 INFO L182 omatonBuilderFactory]: Interpolants [5600#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 5601#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 5602#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| entry_point_~a10~0.base) 1)), 5603#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5604#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5605#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 5606#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5607#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 5608#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 5609#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 5610#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= |#valid| |old(#valid)|) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)))), 5611#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)))), 5612#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5613#(= 1 (select |#valid| |entry_point_#t~mem15.base|)), 5592#true, 5593#false, 5594#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5595#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5596#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 5597#(= (select |#valid| entry_point_~a10~0.base) 1), 5598#(= |#valid| |old(#valid)|), 5599#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))] [2018-02-04 16:21:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:54,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 16:21:54,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 16:21:54,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 16:21:54,396 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 22 states. [2018-02-04 16:21:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:54,878 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-02-04 16:21:54,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:21:54,878 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-02-04 16:21:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:54,878 INFO L225 Difference]: With dead ends: 68 [2018-02-04 16:21:54,878 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 16:21:54,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:21:54,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 16:21:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2018-02-04 16:21:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 16:21:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 16:21:54,880 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 54 [2018-02-04 16:21:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:54,881 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 16:21:54,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 16:21:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 16:21:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 16:21:54,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:54,881 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:54,881 INFO L371 AbstractCegarLoop]: === Iteration 33 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1194508567, now seen corresponding path program 1 times [2018-02-04 16:21:54,882 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:54,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:55,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:55,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 16:21:55,247 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:55,247 INFO L182 omatonBuilderFactory]: Interpolants [5772#true, 5773#false, 5774#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5775#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5776#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 5777#(= (select |#valid| entry_point_~a10~0.base) 1), 5778#(= |#valid| |old(#valid)|), 5779#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5780#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 5781#(and (= 0 |entry_point_#t~ret7.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 5782#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1)), 5783#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5784#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 5785#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 5786#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5787#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 5788#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 5789#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 5790#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5791#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 5792#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|)), 5793#(or (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)) (= |old(#length)| |#length|) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|)), 5794#(= |old(#length)| |#length|), 5795#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) |alloc_10_#in~a.base|)) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)) (= |old(#length)| |#length|))), 5796#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)) (= |old(#length)| |#length|))), 5797#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 5798#(and (= |entry_point_#t~mem15.offset| 0) (<= 4 (select |#length| |entry_point_#t~mem15.base|)))] [2018-02-04 16:21:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:55,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:21:55,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:21:55,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:21:55,248 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 27 states. [2018-02-04 16:21:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:55,834 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-02-04 16:21:55,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 16:21:55,834 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2018-02-04 16:21:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:55,834 INFO L225 Difference]: With dead ends: 78 [2018-02-04 16:21:55,834 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 16:21:55,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:21:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 16:21:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-02-04 16:21:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 16:21:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-02-04 16:21:55,836 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 54 [2018-02-04 16:21:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:55,836 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-02-04 16:21:55,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:21:55,837 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-02-04 16:21:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 16:21:55,837 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:55,837 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:55,837 INFO L371 AbstractCegarLoop]: === Iteration 34 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1624940100, now seen corresponding path program 1 times [2018-02-04 16:21:55,838 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:55,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:21:56,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:56,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 16:21:56,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:21:56,158 INFO L182 omatonBuilderFactory]: Interpolants [5972#true, 5973#false, 5974#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5975#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5976#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 5977#(= (select |#valid| entry_point_~a10~0.base) 1), 5978#(= |#valid| |old(#valid)|), 5979#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 5980#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 5981#(and (= (select |#valid| |entry_point_#t~ret7.base|) 1) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 5982#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= (select |#valid| entry_point_~a10~0.base) 1)), 5983#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5984#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5985#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 5986#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret11.base|)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (= 0 |entry_point_#t~ret11.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 5987#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 5988#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5989#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5990#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 5991#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (not (= |alloc_10_#t~mem3.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))))) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 5992#(or (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) |alloc_10_#in~a.base|)) (= (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 5993#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.offset)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 5994#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5995#(= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|)), 5996#(= |entry_point_#t~mem16.offset| 0)] [2018-02-04 16:21:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:21:56,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 16:21:56,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 16:21:56,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2018-02-04 16:21:56,159 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 25 states. [2018-02-04 16:21:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:56,787 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-02-04 16:21:56,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 16:21:56,787 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-02-04 16:21:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:56,787 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:21:56,787 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 16:21:56,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1701, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 16:21:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 16:21:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 16:21:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 16:21:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-02-04 16:21:56,789 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 55 [2018-02-04 16:21:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:56,789 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-02-04 16:21:56,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 16:21:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-02-04 16:21:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 16:21:56,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:56,790 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:56,790 INFO L371 AbstractCegarLoop]: === Iteration 35 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1624940101, now seen corresponding path program 1 times [2018-02-04 16:21:56,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:56,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:57,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:57,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 16:21:57,090 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:57,090 INFO L182 omatonBuilderFactory]: Interpolants [6176#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 6177#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6178#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 6179#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6180#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)) (or (and (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (not (= |alloc_10_#t~mem3.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))))), 6181#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) |alloc_10_#in~a.base|)) (= |#valid| |old(#valid)|) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 6182#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (and (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)))), 6183#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 6184#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|))), 6185#(= 1 (select |#valid| |entry_point_#t~mem16.base|)), 6163#true, 6164#false, 6165#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 6166#(= (select |#valid| |ldv_malloc_#res.base|) 1), 6167#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 6168#(= (select |#valid| entry_point_~a10~0.base) 1), 6169#(= |#valid| |old(#valid)|), 6170#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 6171#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 6172#(and (= (select |#valid| |entry_point_#t~ret7.base|) 1) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 6173#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= (select |#valid| entry_point_~a10~0.base) 1)), 6174#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6175#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret11.base|)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|)) (= 1 (select |#valid| |entry_point_#t~ret11.base|)))] [2018-02-04 16:21:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 16:21:57,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 16:21:57,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 16:21:57,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2018-02-04 16:21:57,091 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 23 states. [2018-02-04 16:21:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:57,619 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-04 16:21:57,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:21:57,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2018-02-04 16:21:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:57,620 INFO L225 Difference]: With dead ends: 64 [2018-02-04 16:21:57,620 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 16:21:57,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 16:21:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 16:21:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 16:21:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 16:21:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-02-04 16:21:57,622 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 55 [2018-02-04 16:21:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:57,622 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-02-04 16:21:57,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 16:21:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-02-04 16:21:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 16:21:57,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:57,623 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:57,623 INFO L371 AbstractCegarLoop]: === Iteration 36 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash -958969690, now seen corresponding path program 1 times [2018-02-04 16:21:57,623 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:57,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 16:21:58,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:58,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:21:58,119 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 16:21:58,120 INFO L182 omatonBuilderFactory]: Interpolants [6338#true, 6339#false, 6340#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 6341#(= (select |#valid| |ldv_malloc_#res.base|) 1), 6342#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 6343#(= (select |#valid| entry_point_~a10~0.base) 1), 6344#(= |#valid| |old(#valid)|), 6345#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6346#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6347#(not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)), 6348#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| entry_point_~a10~0.base) 1)), 6349#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6350#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6351#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 6352#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6353#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 6354#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6355#(and (or (and (= |#valid| |old(#valid)|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#t~mem3.base|)), 6356#(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|)), 6357#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6358#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#t~mem3.base|) (or (and (or (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|))), 6359#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))))), 6360#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 6361#(= (select |#valid| |entry_point_#t~mem15.base|) 1)] [2018-02-04 16:21:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-04 16:21:58,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:21:58,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:21:58,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:21:58,121 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 24 states. [2018-02-04 16:21:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:21:58,760 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-02-04 16:21:58,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:21:58,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-02-04 16:21:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:21:58,761 INFO L225 Difference]: With dead ends: 63 [2018-02-04 16:21:58,761 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 16:21:58,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:21:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 16:21:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 16:21:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 16:21:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-02-04 16:21:58,762 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 56 [2018-02-04 16:21:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:21:58,762 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-02-04 16:21:58,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:21:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-02-04 16:21:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 16:21:58,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:21:58,763 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:21:58,763 INFO L371 AbstractCegarLoop]: === Iteration 37 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:21:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash -958969689, now seen corresponding path program 1 times [2018-02-04 16:21:58,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:21:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:21:58,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:21:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:59,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:21:59,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 16:21:59,313 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:21:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:59,314 INFO L182 omatonBuilderFactory]: Interpolants [6528#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 6529#(= (select |#valid| entry_point_~a10~0.base) 1), 6530#(= |#valid| |old(#valid)|), 6531#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 6532#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 6533#(and (= 0 |entry_point_#t~ret7.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 6534#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1)), 6535#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6536#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6537#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6538#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6539#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 6540#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6541#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 6542#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6543#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= |#valid| |old(#valid)|) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 6544#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 6545#(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|))), 6546#(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|))))), 6547#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) |alloc_10_#in~a.base|)) (or (= 0 (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (<= 4 (select |#length| (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)))), 6548#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (or (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)))), 6549#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 6550#(and (= |entry_point_#t~mem15.offset| 0) (<= 4 (select |#length| |entry_point_#t~mem15.base|))), 6524#true, 6525#false, 6526#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 6527#(= (select |#valid| |ldv_malloc_#res.base|) 1)] [2018-02-04 16:21:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 16:21:59,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:21:59,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:21:59,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:21:59,314 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 27 states. [2018-02-04 16:22:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:00,088 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-02-04 16:22:00,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:22:00,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 56 [2018-02-04 16:22:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:00,088 INFO L225 Difference]: With dead ends: 62 [2018-02-04 16:22:00,088 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 16:22:00,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1945, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 16:22:00,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 16:22:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 16:22:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 16:22:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-02-04 16:22:00,090 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 56 [2018-02-04 16:22:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:00,090 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-02-04 16:22:00,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:22:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-02-04 16:22:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 16:22:00,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:00,091 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:00,091 INFO L371 AbstractCegarLoop]: === Iteration 38 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash 336710727, now seen corresponding path program 1 times [2018-02-04 16:22:00,092 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:22:00,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:22:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:22:00,419 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:22:00,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:22:00,419 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:22:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:22:00,420 INFO L182 omatonBuilderFactory]: Interpolants [6720#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 6721#(= (select |#valid| entry_point_~a10~0.base) 1), 6722#(= |#valid| |old(#valid)|), 6723#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 6724#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 6725#(and (= (select |#valid| |entry_point_#t~ret7.base|) 1) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 6726#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= (select |#valid| entry_point_~a10~0.base) 1)), 6727#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6728#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6729#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6730#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret11.base|)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6731#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 6732#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6733#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 6734#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem2.offset| (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6735#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#t~mem3.base|) (or (and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (= |alloc_10_#t~mem3.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|))), 6736#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))))), 6737#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 6738#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|))), 6739#(= 1 (select |#valid| |entry_point_#t~mem16.base|)), 6716#true, 6717#false, 6718#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 6719#(= (select |#valid| |ldv_malloc_#res.base|) 1)] [2018-02-04 16:22:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:22:00,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:22:00,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:22:00,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:22:00,421 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 24 states. [2018-02-04 16:22:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:00,984 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-02-04 16:22:00,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 16:22:00,985 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-02-04 16:22:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:00,985 INFO L225 Difference]: With dead ends: 61 [2018-02-04 16:22:00,985 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 16:22:00,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 16:22:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 16:22:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-02-04 16:22:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 16:22:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-02-04 16:22:00,988 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 57 [2018-02-04 16:22:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:00,988 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-02-04 16:22:00,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:22:00,988 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-02-04 16:22:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 16:22:00,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:00,989 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:00,989 INFO L371 AbstractCegarLoop]: === Iteration 39 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1800658138, now seen corresponding path program 1 times [2018-02-04 16:22:00,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:22:01,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:22:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 16:22:01,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:22:01,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-04 16:22:01,531 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:22:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 16:22:01,531 INFO L182 omatonBuilderFactory]: Interpolants [6912#(and (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= |#valid| |old(#valid)|)), 6913#(and (= 1 (select |#valid| entry_point_~a10~0.base)) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 6914#(and (= 1 (select |#valid| entry_point_~a10~0.base)) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|)))), 6915#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem16.base|)) (= 1 (select |#valid| entry_point_~a10~0.base))), 6890#true, 6891#false, 6892#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 6893#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6894#(= 1 (select |#valid| |entry_point_#t~ret6.base|)), 6895#(= 1 (select |#valid| entry_point_~a10~0.base)), 6896#(= |#valid| |old(#valid)|), 6897#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 6898#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 6899#(and (= 1 (select |#valid| |entry_point_#t~ret7.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 6900#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| entry_point_~a10~0.base) 1)), 6901#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6902#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6903#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6904#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret11.base|)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 6905#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 6906#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (= 1 (select |#valid| entry_point_~a10~0.base)) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 6907#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 6908#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 6909#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 6910#(and (= |#valid| |old(#valid)|) (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)) (not (= |alloc_10_#t~mem3.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))), 6911#(and (= |#valid| |old(#valid)|) (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) |alloc_10_#in~a.base|)) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))))] [2018-02-04 16:22:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 16:22:01,532 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 16:22:01,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 16:22:01,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2018-02-04 16:22:01,532 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 26 states. [2018-02-04 16:22:02,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:02,054 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-02-04 16:22:02,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 16:22:02,054 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-02-04 16:22:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:02,055 INFO L225 Difference]: With dead ends: 66 [2018-02-04 16:22:02,055 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 16:22:02,055 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 16:22:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 16:22:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-02-04 16:22:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 16:22:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-02-04 16:22:02,057 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 57 [2018-02-04 16:22:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:02,057 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-02-04 16:22:02,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 16:22:02,057 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-02-04 16:22:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 16:22:02,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:02,057 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:02,057 INFO L371 AbstractCegarLoop]: === Iteration 40 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:02,057 INFO L82 PathProgramCache]: Analyzing trace with hash 14172622, now seen corresponding path program 1 times [2018-02-04 16:22:02,058 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:22:02,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:22:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:22:02,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:22:02,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:22:02,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:22:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:22:02,505 INFO L182 omatonBuilderFactory]: Interpolants [7072#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 7073#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 7074#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 7075#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 7076#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 7077#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7078#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 7079#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7080#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 7081#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) |alloc_10_#in~a.base|))), 7082#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|))), 7083#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 7084#(= |entry_point_#t~mem17.offset| 0), 7061#true, 7062#false, 7063#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 7064#(= (select |#valid| |ldv_malloc_#res.base|) 1), 7065#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 7066#(= (select |#valid| entry_point_~a10~0.base) 1), 7067#(= |#valid| |old(#valid)|), 7068#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 7069#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 7070#(and (= 0 |entry_point_#t~ret7.offset|) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 7071#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1))] [2018-02-04 16:22:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:22:02,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:22:02,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:22:02,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:22:02,506 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 24 states. [2018-02-04 16:22:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:03,361 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-02-04 16:22:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:22:03,362 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 58 [2018-02-04 16:22:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:03,362 INFO L225 Difference]: With dead ends: 62 [2018-02-04 16:22:03,363 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 16:22:03,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=1537, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:22:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 16:22:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 16:22:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 16:22:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-02-04 16:22:03,366 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 58 [2018-02-04 16:22:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:03,366 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-02-04 16:22:03,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:22:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-02-04 16:22:03,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 16:22:03,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:03,367 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:03,367 INFO L371 AbstractCegarLoop]: === Iteration 41 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash 14172623, now seen corresponding path program 1 times [2018-02-04 16:22:03,368 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:22:03,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:22:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:22:03,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:22:03,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 16:22:03,757 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:22:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:22:03,757 INFO L182 omatonBuilderFactory]: Interpolants [7247#true, 7248#false, 7249#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 7250#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 7251#(= 1 (select |#valid| |entry_point_#t~ret6.base|)), 7252#(= 1 (select |#valid| entry_point_~a10~0.base)), 7253#(= |#valid| |old(#valid)|), 7254#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 7255#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 7256#(and (= 1 (select |#valid| |entry_point_#t~ret7.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 7257#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| entry_point_~a10~0.base) 1)), 7258#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 7259#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 7260#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 7261#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret11.base|)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 7262#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 7263#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7264#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 7265#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7266#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (or (and (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)) (not (= |alloc_10_#t~mem3.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 7267#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select (store |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|)) |alloc_10_#in~a.base|)) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 7268#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 7269#(not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 7270#(and (= |entry_point_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (= |entry_point_#t~mem15.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 7271#(= 1 (select (store |#valid| |entry_point_#t~mem16.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 7272#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 7273#(= 1 (select |#valid| |entry_point_#t~mem17.base|))] [2018-02-04 16:22:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 16:22:03,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 16:22:03,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 16:22:03,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-02-04 16:22:03,758 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 27 states. [2018-02-04 16:22:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:04,472 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-02-04 16:22:04,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 16:22:04,472 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-02-04 16:22:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:04,473 INFO L225 Difference]: With dead ends: 61 [2018-02-04 16:22:04,473 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 16:22:04,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=2026, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 16:22:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 16:22:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 16:22:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 16:22:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-02-04 16:22:04,475 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 58 [2018-02-04 16:22:04,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:04,475 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-02-04 16:22:04,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 16:22:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-02-04 16:22:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 16:22:04,476 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:04,476 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:04,476 INFO L371 AbstractCegarLoop]: === Iteration 42 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1456461992, now seen corresponding path program 1 times [2018-02-04 16:22:04,477 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:22:04,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:22:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:22:04,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:22:04,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 16:22:04,913 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:22:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:22:04,914 INFO L182 omatonBuilderFactory]: Interpolants [7456#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7457#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 7458#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7459#(and (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#t~mem3.base|) (or (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|) (= (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7460#(and (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (= (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= (select (select |old(#memory_$Pointer$.base)| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))), 7461#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))), 7462#(and (= 1 (select |#valid| entry_point_~a10~0.base)) (not (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|)))), 7463#(and (not (= 0 |entry_point_#t~mem16.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem16.base|)) (= 1 (select |#valid| entry_point_~a10~0.base))), 7440#true, 7441#false, 7442#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 7443#(= (select |#valid| |ldv_malloc_#res.base|) 1), 7444#(= (select |#valid| |entry_point_#t~ret6.base|) 1), 7445#(= (select |#valid| entry_point_~a10~0.base) 1), 7446#(= |#valid| |old(#valid)|), 7447#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 7448#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 7449#(and (= (select |#valid| |entry_point_#t~ret7.base|) 1) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|))), 7450#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= (select |#valid| entry_point_~a10~0.base) 1)), 7451#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 7452#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 7453#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 7454#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret11.base|)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= 0 |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|))), 7455#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))))] [2018-02-04 16:22:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 16:22:04,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 16:22:04,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 16:22:04,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-04 16:22:04,914 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 24 states. [2018-02-04 16:22:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:05,428 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-02-04 16:22:05,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 16:22:05,428 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-02-04 16:22:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:05,429 INFO L225 Difference]: With dead ends: 60 [2018-02-04 16:22:05,429 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 16:22:05,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=1391, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 16:22:05,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 16:22:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-02-04 16:22:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 16:22:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 16:22:05,431 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 59 [2018-02-04 16:22:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:05,431 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 16:22:05,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 16:22:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 16:22:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 16:22:05,432 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:05,432 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:05,432 INFO L371 AbstractCegarLoop]: === Iteration 43 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash 734989617, now seen corresponding path program 1 times [2018-02-04 16:22:05,433 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:22:05,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:22:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 16:22:05,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:22:05,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 16:22:05,587 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:22:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 16:22:05,587 INFO L182 omatonBuilderFactory]: Interpolants [7616#(and (not (= 0 entry_point_~a10~0.base)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))) 0) (= entry_point_~a10~0.offset 0)) (and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0)))), 7617#(and (= 1 (select |#valid| entry_point_~a10~0.base)) (or (and (not (= 0 |entry_point_#t~mem17.offset|)) (not (= 0 entry_point_~a10~0.base))) (not (= entry_point_~a10~0.base |entry_point_#t~mem17.base|)))), 7618#(= 1 (select |#valid| entry_point_~a10~0.base)), 7608#true, 7609#false, 7610#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= |ldv_malloc_#t~malloc1.offset| 0)), 7611#(and (not (= 0 |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| 0)), 7612#(and (= |entry_point_#t~ret6.offset| 0) (not (= 0 |entry_point_#t~ret6.base|))), 7613#(and (not (= 0 entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0)), 7614#(and (= |entry_point_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= 0 entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0) (= |entry_point_#t~mem15.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 7615#(and (not (= 0 entry_point_~a10~0.base)) (= entry_point_~a10~0.offset 0) (= |entry_point_#t~mem16.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))))] [2018-02-04 16:22:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 16:22:05,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 16:22:05,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 16:22:05,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 16:22:05,588 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 11 states. [2018-02-04 16:22:05,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:05,762 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-02-04 16:22:05,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 16:22:05,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-02-04 16:22:05,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:05,763 INFO L225 Difference]: With dead ends: 50 [2018-02-04 16:22:05,763 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 16:22:05,763 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2018-02-04 16:22:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 16:22:05,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 16:22:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 16:22:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 16:22:05,764 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 60 [2018-02-04 16:22:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:05,764 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 16:22:05,764 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 16:22:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 16:22:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 16:22:05,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:05,765 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:05,765 INFO L371 AbstractCegarLoop]: === Iteration 44 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:05,765 INFO L82 PathProgramCache]: Analyzing trace with hash 332434876, now seen corresponding path program 1 times [2018-02-04 16:22:05,765 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:22:05,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:22:06,644 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 70 DAG size of output 36 [2018-02-04 16:22:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 16:22:07,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 16:22:07,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 16:22:07,607 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:22:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 16:22:07,608 INFO L182 omatonBuilderFactory]: Interpolants [7744#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= |entry_point_#t~mem10.offset| 0) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 7745#(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|))), 7746#(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|))), 7747#(and (= |entry_point_#t~mem10.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select |old(#valid)| |entry_point_#t~ret11.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret11.base|)) (= |entry_point_#t~mem10.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0) (not (= 0 |entry_point_#t~ret11.base|)) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base |entry_point_#t~ret11.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem10.base|)) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |entry_point_#t~ret11.base| (select |old(#valid)| |entry_point_#t~ret11.base|)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 7748#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= entry_point_~a10~0.base 0)) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 7749#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7750#(and (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#valid| |old(#valid)|) (= (select |old(#memory_$Pointer$.offset)| alloc_10_~a.base) (select |#memory_$Pointer$.offset| alloc_10_~a.base)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= alloc_10_~a.offset |alloc_10_#in~a.offset|)), 7751#(and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |alloc_10_#t~mem2.offset| (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 7752#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (or (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= |alloc_10_#t~mem3.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 7753#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= |#valid| |old(#valid)|) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) (select (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (select (store |#memory_$Pointer$.base| |alloc_10_#t~mem3.base| (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|)) |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 7754#(or (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) |alloc_10_#in~a.base|) (and (= |#valid| |old(#valid)|) (= (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|))) (= (select (select |old(#memory_$Pointer$.base)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 7755#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0) (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0)))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 7756#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (or (not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|))) |old(#valid)|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) |entry_point_#t~mem15.offset|))) (= 0 (select |old(#valid)| entry_point_~a10~0.base)))) (= |entry_point_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) 0))) (not (= entry_point_~a10~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select (select |#memory_$Pointer$.base| |entry_point_#t~mem15.base|) 0))) (= |entry_point_#t~mem15.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 7757#(or (not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)) (and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (not (= 0 |entry_point_#t~mem16.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~mem16.base|)) (not (= |entry_point_#t~mem16.base| entry_point_~a10~0.base)) (= (select (store |#valid| |entry_point_#t~mem16.base| 0) |entry_point_#t~mem16.base|) (select |old(#valid)| |entry_point_#t~mem16.base|)) (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |entry_point_#t~mem16.base| (select |old(#valid)| |entry_point_#t~mem16.base|))) (= 0 (select |old(#valid)| entry_point_~a10~0.base)))), 7758#(or (and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base))) (not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0))), 7759#(or (not (= |entry_point_#t~mem17.offset| 0)) (and (= (select (store |#valid| |entry_point_#t~mem17.base| 0) |entry_point_#t~mem17.base|) (select |old(#valid)| |entry_point_#t~mem17.base|)) (not (= 0 |entry_point_#t~mem17.base|)) (not (= entry_point_~a10~0.base 0)) (not (= entry_point_~a10~0.base |entry_point_#t~mem17.base|)) (= (store (store |#valid| |entry_point_#t~mem17.base| (select |old(#valid)| |entry_point_#t~mem17.base|)) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base)))), 7760#(and (= (select (store |#valid| entry_point_~a10~0.base 0) entry_point_~a10~0.base) (select |old(#valid)| entry_point_~a10~0.base)) (not (= entry_point_~a10~0.base 0)) (= (select (store |#valid| entry_point_~a10~0.base 0) (@diff (store |#valid| entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|)) (select |old(#valid)| (@diff (store |#valid| entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|)))), 7733#true, 7734#false, 7735#(= |#valid| |old(#valid)|), 7736#(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)), 7737#(and (= 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)), 7738#(and (= 0 (select |old(#valid)| |entry_point_#t~ret6.base|)) (= (select |#valid| |entry_point_#t~ret6.base|) 1) (= (store |#valid| (@diff |#valid| |old(#valid)|) (select |old(#valid)| (@diff |#valid| |old(#valid)|))) |old(#valid)|) (not (= 0 |entry_point_#t~ret6.base|))), 7739#(and (not (= 0 entry_point_~a10~0.base)) (= (select |#valid| entry_point_~a10~0.base) 1) (= (store |#valid| entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 7740#(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) (= |ldv_malloc_#t~malloc1.offset| 0)), 7741#(and (= 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) (= |ldv_malloc_#res.offset| 0)), 7742#(and (not (= entry_point_~a10~0.base 0)) (not (= 0 |entry_point_#t~ret7.base|)) (= (store (store |#valid| |entry_point_#t~ret7.base| (select |old(#valid)| |entry_point_#t~ret7.base|)) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| |entry_point_#t~ret7.base|)) (= (select |#valid| |entry_point_#t~ret7.base|) 1) (not (= entry_point_~a10~0.base |entry_point_#t~ret7.base|)) (= |entry_point_#t~ret7.offset| 0) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 7743#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= entry_point_~a10~0.base 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 1) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base)) |old(#valid)|) (= 0 (select |old(#valid)| entry_point_~a10~0.base)))] [2018-02-04 16:22:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 16:22:07,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 16:22:07,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 16:22:07,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2018-02-04 16:22:07,609 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 28 states. [2018-02-04 16:22:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:22:08,630 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-02-04 16:22:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 16:22:08,630 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-02-04 16:22:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:22:08,630 INFO L225 Difference]: With dead ends: 65 [2018-02-04 16:22:08,630 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 16:22:08,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=162, Invalid=1560, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 16:22:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 16:22:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 16:22:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 16:22:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 16:22:08,631 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 63 [2018-02-04 16:22:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:22:08,632 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 16:22:08,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 16:22:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 16:22:08,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 16:22:08,632 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:22:08,632 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:22:08,632 INFO L371 AbstractCegarLoop]: === Iteration 45 === [alloc_10Err5RequiresViolation, alloc_10Err2RequiresViolation, alloc_10Err3RequiresViolation, alloc_10Err4RequiresViolation, alloc_10Err1RequiresViolation, alloc_10Err0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr23RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr21RequiresViolation, entry_pointErr22RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr20RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation]=== [2018-02-04 16:22:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 344103358, now seen corresponding path program 1 times [2018-02-04 16:22:08,633 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:22:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:22:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:22:08,674 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 16:22:08,689 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 16:22:08,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:22:08 BoogieIcfgContainer [2018-02-04 16:22:08,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:22:08,706 INFO L168 Benchmark]: Toolchain (without parser) took 27457.01 ms. Allocated memory was 405.8 MB in the beginning and 1.0 GB in the end (delta: 615.5 MB). Free memory was 362.4 MB in the beginning and 857.9 MB in the end (delta: -495.4 MB). Peak memory consumption was 120.1 MB. Max. memory is 5.3 GB. [2018-02-04 16:22:08,708 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.8 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:22:08,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.91 ms. Allocated memory is still 405.8 MB. Free memory was 362.4 MB in the beginning and 349.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 16:22:08,708 INFO L168 Benchmark]: Boogie Preprocessor took 27.17 ms. Allocated memory is still 405.8 MB. Free memory was 349.2 MB in the beginning and 347.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:22:08,709 INFO L168 Benchmark]: RCFGBuilder took 265.27 ms. Allocated memory is still 405.8 MB. Free memory was 347.9 MB in the beginning and 322.7 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-02-04 16:22:08,709 INFO L168 Benchmark]: TraceAbstraction took 26996.49 ms. Allocated memory was 405.8 MB in the beginning and 1.0 GB in the end (delta: 615.5 MB). Free memory was 322.7 MB in the beginning and 857.9 MB in the end (delta: -535.2 MB). Peak memory consumption was 80.4 MB. Max. memory is 5.3 GB. [2018-02-04 16:22:08,710 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.13 ms. Allocated memory is still 405.8 MB. Free memory is still 369.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.91 ms. Allocated memory is still 405.8 MB. Free memory was 362.4 MB in the beginning and 349.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.17 ms. Allocated memory is still 405.8 MB. Free memory was 349.2 MB in the beginning and 347.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 265.27 ms. Allocated memory is still 405.8 MB. Free memory was 347.9 MB in the beginning and 322.7 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 26996.49 ms. Allocated memory was 405.8 MB in the beginning and 1.0 GB in the end (delta: 615.5 MB). Free memory was 322.7 MB in the beginning and 857.9 MB in the end (delta: -535.2 MB). Peak memory consumption was 80.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1472]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1473] CALL entry_point() [L1455] CALL, EXPR ldv_malloc(sizeof(struct A10)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, malloc(size)={7:0}, size=4] [L1455] EXPR ldv_malloc(sizeof(struct A10)) VAL [ldv_malloc(sizeof(struct A10))={7:0}] [L1455] struct A10 *a10 = (struct A10 *)ldv_malloc(sizeof(struct A10)); [L1456] COND FALSE !(!a10) VAL [a10={7:0}] [L1457] CALL, EXPR ldv_malloc(sizeof(struct B10)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={9:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={9:0}, malloc(size)={9:0}, size=4] [L1457] EXPR ldv_malloc(sizeof(struct B10)) VAL [a10={7:0}, ldv_malloc(sizeof(struct B10))={9:0}] [L1457] FCALL a10->b = (struct B10 *)ldv_malloc(sizeof(struct B10)) VAL [a10={7:0}, ldv_malloc(sizeof(struct B10))={9:0}] [L1458] EXPR, FCALL a10->b VAL [a10={7:0}, a10->b={9:0}] [L1458] COND FALSE !(!a10->b) [L1459] EXPR, FCALL a10->b VAL [a10={7:0}, a10->b={9:0}] [L1459] CALL, EXPR ldv_malloc(sizeof(struct C10)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={5:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={5:0}, malloc(size)={5:0}, size=4] [L1459] EXPR ldv_malloc(sizeof(struct C10)) VAL [a10={7:0}, a10->b={9:0}, ldv_malloc(sizeof(struct C10))={5:0}] [L1459] FCALL a10->b->c = (struct C10 *)ldv_malloc(sizeof(struct C10)) VAL [a10={7:0}, a10->b={9:0}, ldv_malloc(sizeof(struct C10))={5:0}] [L1460] EXPR, FCALL a10->b VAL [a10={7:0}, a10->b={9:0}] [L1460] EXPR, FCALL a10->b->c VAL [a10={7:0}, a10->b={9:0}, a10->b->c={5:0}] [L1460] COND FALSE !(!a10->b->c) [L1462] CALL alloc_10(a10) VAL [a={7:0}] [L1447] EXPR, FCALL a->b VAL [a={7:0}, a={7:0}, a->b={9:0}] [L1447] EXPR, FCALL a->b->c VAL [a={7:0}, a={7:0}, a->b={9:0}, a->b->c={5:0}] [L1447] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={8:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={8:0}, malloc(size)={8:0}, size=4] [L1447] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a->b={9:0}, a->b->c={5:0}, ldv_malloc(sizeof(int))={8:0}] [L1447] RET, FCALL a->b->c->p = (int *)ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a->b={9:0}, a->b->c={5:0}, ldv_malloc(sizeof(int))={8:0}] [L1462] alloc_10(a10) VAL [a10={7:0}] [L1465] EXPR, FCALL a10->b VAL [a10={7:0}, a10->b={9:0}] [L1465] EXPR, FCALL a10->b->c VAL [a10={7:0}, a10->b={9:0}, a10->b->c={5:0}] [L1465] FCALL free(a10->b->c) VAL [a10={7:0}, a10->b={9:0}, a10->b->c={5:0}] [L1467] EXPR, FCALL a10->b VAL [a10={7:0}, a10->b={9:0}] [L1467] FCALL free(a10->b) VAL [a10={7:0}, a10->b={9:0}] [L1469] FCALL free(a10) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 81 locations, 31 error locations. UNSAFE Result, 26.9s OverallTime, 45 OverallIterations, 4 TraceHistogramMax, 15.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1919 SDtfs, 2022 SDslu, 10480 SDs, 0 SdLazy, 18924 SolverSat, 1004 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 128 SyntacticMatches, 26 SemanticMatches, 948 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4328 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 482/858 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 44 MinimizatonAttempts, 424 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1901 NumberOfCodeBlocks, 1901 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 980449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 7 PerfectInterpolantSequences, 482/858 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-22-08-716.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-22-08-716.csv Received shutdown request...