java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:20:46,440 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:20:46,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:20:46,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:20:46,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:20:46,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:20:46,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:20:46,455 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:20:46,457 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:20:46,458 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:20:46,458 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:20:46,459 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:20:46,459 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:20:46,460 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:20:46,461 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:20:46,463 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:20:46,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:20:46,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:20:46,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:20:46,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:20:46,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:20:46,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:20:46,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:20:46,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:20:46,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:20:46,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:20:46,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:20:46,472 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:20:46,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:20:46,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:20:46,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:20:46,473 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 10:20:46,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:20:46,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:20:46,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:20:46,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:20:46,484 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:20:46,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:20:46,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:20:46,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:20:46,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:20:46,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:20:46,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:20:46,485 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:20:46,486 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:20:46,486 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:20:46,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:20:46,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:20:46,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:20:46,486 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:20:46,487 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:20:46,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:20:46,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:20:46,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:20:46,487 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:20:46,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:20:46,529 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:20:46,532 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:20:46,534 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:20:46,534 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:20:46,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test10_true-valid-memsafety_true-termination.i [2018-02-02 10:20:46,700 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:20:46,702 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:20:46,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:20:46,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:20:46,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:20:46,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46, skipping insertion in model container [2018-02-02 10:20:46,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,728 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:20:46,764 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:20:46,845 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:20:46,857 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:20:46,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46 WrapperNode [2018-02-02 10:20:46,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:20:46,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:20:46,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:20:46,864 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:20:46,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... [2018-02-02 10:20:46,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:20:46,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:20:46,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:20:46,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:20:46,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:20:46,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:20:46,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:20:46,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:20:46,929 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_10 [2018-02-02 10:20:46,929 INFO L136 BoogieDeclarations]: Found implementation of procedure free_10 [2018-02-02 10:20:46,929 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:20:46,929 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_10 [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure free_10 [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:20:46,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:20:46,931 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:20:47,144 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:20:47,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:20:47 BoogieIcfgContainer [2018-02-02 10:20:47,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:20:47,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:20:47,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:20:47,147 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:20:47,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:20:46" (1/3) ... [2018-02-02 10:20:47,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7a850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:20:47, skipping insertion in model container [2018-02-02 10:20:47,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:20:46" (2/3) ... [2018-02-02 10:20:47,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7a850c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:20:47, skipping insertion in model container [2018-02-02 10:20:47,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:20:47" (3/3) ... [2018-02-02 10:20:47,149 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test10_true-valid-memsafety_true-termination.i [2018-02-02 10:20:47,155 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:20:47,159 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-02-02 10:20:47,183 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:20:47,183 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:20:47,184 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:20:47,184 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:20:47,184 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:20:47,184 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:20:47,184 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:20:47,184 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:20:47,185 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:20:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-02-02 10:20:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 10:20:47,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:47,205 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:47,205 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1784809794, now seen corresponding path program 1 times [2018-02-02 10:20:47,264 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:47,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:47,383 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:47,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:20:47,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:47,385 INFO L182 omatonBuilderFactory]: Interpolants [101#true, 102#false, 103#(= |#valid| |old(#valid)|)] [2018-02-02 10:20:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:47,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:20:47,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:20:47,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:20:47,395 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2018-02-02 10:20:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:47,676 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2018-02-02 10:20:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:20:47,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 10:20:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:47,689 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:20:47,689 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:20:47,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:20:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:20:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2018-02-02 10:20:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 10:20:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2018-02-02 10:20:47,737 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 16 [2018-02-02 10:20:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:47,738 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2018-02-02 10:20:47,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:20:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2018-02-02 10:20:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 10:20:47,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:47,740 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-02 10:20:47,740 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:47,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1808064800, now seen corresponding path program 1 times [2018-02-02 10:20:47,741 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:47,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:47,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:47,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:20:47,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:47,804 INFO L182 omatonBuilderFactory]: Interpolants [352#(not (= 0 |ldv_malloc_#res.base|)), 353#(not (= 0 |entry_point_#t~ret9.base|)), 354#(not (= 0 entry_point_~a10~0.base)), 349#true, 350#false, 351#(not (= 0 |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:20:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:47,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:20:47,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:20:47,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:47,807 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand 6 states. [2018-02-02 10:20:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:47,964 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2018-02-02 10:20:47,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:20:47,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 10:20:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:47,968 INFO L225 Difference]: With dead ends: 146 [2018-02-02 10:20:47,968 INFO L226 Difference]: Without dead ends: 146 [2018-02-02 10:20:47,969 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-02-02 10:20:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2018-02-02 10:20:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:20:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-02-02 10:20:47,980 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 18 [2018-02-02 10:20:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:47,980 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-02-02 10:20:47,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:20:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-02-02 10:20:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:20:47,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:47,981 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:20:47,981 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1556713239, now seen corresponding path program 1 times [2018-02-02 10:20:47,983 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:47,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:20:48,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:48,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:20:48,046 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:20:48,046 INFO L182 omatonBuilderFactory]: Interpolants [598#true, 599#false, 600#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 601#(and (= 0 |entry_point_#t~ret9.base|) (= 0 |entry_point_#t~ret9.offset|)), 602#(and (= entry_point_~a10~0.base 0) (= 0 entry_point_~a10~0.offset))] [2018-02-02 10:20:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:20:48,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:20:48,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:20:48,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:20:48,047 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 5 states. [2018-02-02 10:20:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:48,088 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-02-02 10:20:48,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:20:48,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-02 10:20:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:48,090 INFO L225 Difference]: With dead ends: 99 [2018-02-02 10:20:48,090 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 10:20:48,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:20:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 10:20:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-02 10:20:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:20:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2018-02-02 10:20:48,097 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 19 [2018-02-02 10:20:48,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:48,097 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2018-02-02 10:20:48,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:20:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2018-02-02 10:20:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:20:48,098 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:48,098 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-02 10:20:48,099 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:48,099 INFO L82 PathProgramCache]: Analyzing trace with hash 256564149, now seen corresponding path program 1 times [2018-02-02 10:20:48,100 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:48,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:48,165 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-02 10:20:48,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:48,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:20:48,165 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:48,166 INFO L182 omatonBuilderFactory]: Interpolants [800#false, 801#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 802#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 803#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 804#(= 1 (select |#valid| entry_point_~a10~0.base)), 805#(= |#valid| |old(#valid)|), 799#true] [2018-02-02 10:20:48,166 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-02 10:20:48,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:48,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:48,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:48,167 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 7 states. [2018-02-02 10:20:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:48,446 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-02-02 10:20:48,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:20:48,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-02-02 10:20:48,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:48,448 INFO L225 Difference]: With dead ends: 114 [2018-02-02 10:20:48,448 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 10:20:48,448 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-02 10:20:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 10:20:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2018-02-02 10:20:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:20:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-02-02 10:20:48,455 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 21 [2018-02-02 10:20:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:48,455 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-02-02 10:20:48,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-02-02 10:20:48,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:20:48,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:48,456 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-02 10:20:48,456 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash 256564150, now seen corresponding path program 1 times [2018-02-02 10:20:48,458 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:48,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:48,661 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-02 10:20:48,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:48,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:20:48,662 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:48,662 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-02 10:20:48,662 INFO L182 omatonBuilderFactory]: Interpolants [1024#false, 1025#(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))), 1026#(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|)), 1027#(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|))), 1028#(and (<= 4 (select |#length| |entry_point_#t~ret9.base|)) (= 0 |entry_point_#t~ret9.offset|)), 1029#(and (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 1030#(= |old(#length)| |#length|), 1023#true] [2018-02-02 10:20:48,663 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-02 10:20:48,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:20:48,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:20:48,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:48,664 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 8 states. [2018-02-02 10:20:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:49,075 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-02-02 10:20:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:49,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 10:20:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:49,077 INFO L225 Difference]: With dead ends: 144 [2018-02-02 10:20:49,077 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 10:20:49,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 10:20:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2018-02-02 10:20:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 10:20:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2018-02-02 10:20:49,086 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 21 [2018-02-02 10:20:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:49,086 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2018-02-02 10:20:49,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:20:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2018-02-02 10:20:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:20:49,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:49,087 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-02 10:20:49,087 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1653900695, now seen corresponding path program 1 times [2018-02-02 10:20:49,088 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:49,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:49,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:49,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:49,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:20:49,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:49,195 INFO L182 omatonBuilderFactory]: Interpolants [1312#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 1313#(= 1 (select |#valid| entry_point_~a10~0.base)), 1314#(= |#valid| |old(#valid)|), 1315#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 1316#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 1308#true, 1309#false, 1310#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 1311#(= 1 (select |#valid| |ldv_malloc_#res.base|))] [2018-02-02 10:20:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:49,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:20:49,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:20:49,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:20:49,196 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand 9 states. [2018-02-02 10:20:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:49,436 INFO L93 Difference]: Finished difference Result 136 states and 162 transitions. [2018-02-02 10:20:49,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:20:49,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 10:20:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:49,439 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:20:49,439 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:20:49,439 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:20:49,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2018-02-02 10:20:49,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:20:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2018-02-02 10:20:49,444 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 23 [2018-02-02 10:20:49,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:49,445 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2018-02-02 10:20:49,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:20:49,445 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2018-02-02 10:20:49,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:20:49,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:49,445 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-02 10:20:49,446 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1653900696, now seen corresponding path program 1 times [2018-02-02 10:20:49,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:49,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:49,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:49,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:20:49,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:49,667 INFO L182 omatonBuilderFactory]: Interpolants [1584#(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|)), 1585#(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|))), 1586#(and (<= 4 (select |#length| |entry_point_#t~ret9.base|)) (= (select |#valid| |entry_point_#t~ret9.base|) 1) (= 0 |entry_point_#t~ret9.offset|)), 1587#(and (= (select |#valid| entry_point_~a10~0.base) 1) (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 1588#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 1589#(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|))), 1590#(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|))))), 1591#(and (= entry_point_~a10~0.offset 0) (<= 4 (select |#length| entry_point_~a10~0.base))), 1581#true, 1582#false, 1583#(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)))] [2018-02-02 10:20:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:20:49,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:20:49,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:20:49,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:20:49,668 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand 11 states. [2018-02-02 10:20:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:50,207 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2018-02-02 10:20:50,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:20:50,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:20:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:50,208 INFO L225 Difference]: With dead ends: 140 [2018-02-02 10:20:50,208 INFO L226 Difference]: Without dead ends: 140 [2018-02-02 10:20:50,209 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-02 10:20:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-02 10:20:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 88. [2018-02-02 10:20:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:20:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-02-02 10:20:50,214 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 23 [2018-02-02 10:20:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:50,214 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-02-02 10:20:50,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:20:50,214 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-02-02 10:20:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 10:20:50,215 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:50,215 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-02 10:20:50,215 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:50,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1058360171, now seen corresponding path program 1 times [2018-02-02 10:20:50,216 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:50,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:20:50,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:50,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:20:50,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:20:50,303 INFO L182 omatonBuilderFactory]: Interpolants [1832#true, 1833#false, 1834#(= |#valid| |old(#valid)|), 1835#(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)), 1836#(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|))), 1837#(and (= |#valid| (store |old(#valid)| |entry_point_#t~ret9.base| (select |#valid| |entry_point_#t~ret9.base|))) (not (= 0 |entry_point_#t~ret9.base|)) (= (select |old(#valid)| |entry_point_#t~ret9.base|) 0)), 1838#(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-02 10:20:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:20:50,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:50,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:50,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:50,304 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 7 states. [2018-02-02 10:20:50,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:50,505 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-02-02 10:20:50,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:50,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-02-02 10:20:50,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:50,506 INFO L225 Difference]: With dead ends: 119 [2018-02-02 10:20:50,507 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 10:20:50,507 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-02 10:20:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 10:20:50,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2018-02-02 10:20:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 10:20:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-02-02 10:20:50,511 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 28 [2018-02-02 10:20:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:50,511 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-02-02 10:20:50,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-02-02 10:20:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:20:50,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:50,512 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-02 10:20:50,512 INFO L371 AbstractCegarLoop]: === Iteration 9 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:50,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1290461367, now seen corresponding path program 1 times [2018-02-02 10:20:50,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:50,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:20:50,558 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:50,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:20:50,558 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:20:50,559 INFO L182 omatonBuilderFactory]: Interpolants [2054#true, 2055#false, 2056#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 2057#(not (= 0 |ldv_malloc_#res.base|)), 2058#(not (= 0 |entry_point_#t~ret10.base|)), 2059#(not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 2060#(not (= 0 |entry_point_#t~mem12.base|))] [2018-02-02 10:20:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:20:50,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:50,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:50,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:50,560 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 7 states. [2018-02-02 10:20:50,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:50,629 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-02-02 10:20:50,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:50,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:20:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:50,631 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:20:50,631 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 10:20:50,632 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-02 10:20:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 10:20:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-02-02 10:20:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:20:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-02-02 10:20:50,636 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 30 [2018-02-02 10:20:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:50,636 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-02-02 10:20:50,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-02-02 10:20:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 10:20:50,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:50,637 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-02 10:20:50,637 INFO L371 AbstractCegarLoop]: === Iteration 10 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1396904661, now seen corresponding path program 1 times [2018-02-02 10:20:50,638 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:50,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:50,685 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-02 10:20:50,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:50,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:20:50,686 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:20:50,686 INFO L182 omatonBuilderFactory]: Interpolants [2250#true, 2251#false, 2252#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 2253#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 2254#(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))), 2255#(and (= |entry_point_#t~mem12.offset| 0) (= |entry_point_#t~mem12.base| 0))] [2018-02-02 10:20:50,687 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-02 10:20:50,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:20:50,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:20:50,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:50,687 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 6 states. [2018-02-02 10:20:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:50,728 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-02-02 10:20:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:20:50,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-02 10:20:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:50,729 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:20:50,729 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:20:50,729 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-02 10:20:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:20:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-02 10:20:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:20:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-02 10:20:50,732 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 31 [2018-02-02 10:20:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:50,733 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-02 10:20:50,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:20:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-02 10:20:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:20:50,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:50,734 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-02 10:20:50,734 INFO L371 AbstractCegarLoop]: === Iteration 11 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1532156787, now seen corresponding path program 2 times [2018-02-02 10:20:50,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:50,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:50,793 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-02 10:20:50,793 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:50,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:20:50,793 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:50,794 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-02 10:20:50,794 INFO L182 omatonBuilderFactory]: Interpolants [2438#true, 2439#false, 2440#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2441#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2442#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 2443#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 2444#(= 1 (select |#valid| |entry_point_#t~mem13.base|)), 2445#(= |#valid| |old(#valid)|)] [2018-02-02 10:20:50,794 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-02 10:20:50,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:20:50,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:20:50,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:50,795 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 8 states. [2018-02-02 10:20:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:50,983 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-02 10:20:50,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:50,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-02-02 10:20:50,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:50,984 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:20:50,984 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:20:50,984 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-02 10:20:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:20:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-02 10:20:50,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:20:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-02-02 10:20:50,986 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 33 [2018-02-02 10:20:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:50,987 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-02-02 10:20:50,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:20:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-02-02 10:20:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 10:20:50,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:50,987 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-02 10:20:50,987 INFO L371 AbstractCegarLoop]: === Iteration 12 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1532156786, now seen corresponding path program 1 times [2018-02-02 10:20:50,988 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:51,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:51,126 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-02 10:20:51,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:51,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:20:51,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:51,127 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-02 10:20:51,127 INFO L182 omatonBuilderFactory]: Interpolants [2640#(and (<= 4 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 2641#(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)))), 2642#(and (= |entry_point_#t~mem13.offset| 0) (<= 4 (select |#length| |entry_point_#t~mem13.base|))), 2643#(= |old(#length)| |#length|), 2635#true, 2636#false, 2637#(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))), 2638#(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|)), 2639#(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|)))] [2018-02-02 10:20:51,127 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-02 10:20:51,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:20:51,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:20:51,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:20:51,128 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 9 states. [2018-02-02 10:20:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:51,464 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-02 10:20:51,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:20:51,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-02 10:20:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:51,466 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:20:51,466 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:20:51,466 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-02 10:20:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:20:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-02-02 10:20:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:20:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-02 10:20:51,469 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 33 [2018-02-02 10:20:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:51,469 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-02 10:20:51,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:20:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-02 10:20:51,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:20:51,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:51,470 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-02 10:20:51,470 INFO L371 AbstractCegarLoop]: === Iteration 13 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:51,471 INFO L82 PathProgramCache]: Analyzing trace with hash 679924719, now seen corresponding path program 1 times [2018-02-02 10:20:51,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:51,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:20:51,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:51,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:20:51,563 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:20:51,564 INFO L182 omatonBuilderFactory]: Interpolants [2838#true, 2839#false, 2840#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 2841#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 2842#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 2843#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 2844#(= 1 (select |#valid| |entry_point_#t~mem13.base|)), 2845#(= |#valid| |old(#valid)|), 2846#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 2847#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 10:20:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 10:20:51,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:20:51,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:20:51,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:20:51,564 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 10 states. [2018-02-02 10:20:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:51,769 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-02-02 10:20:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:20:51,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-02-02 10:20:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:51,770 INFO L225 Difference]: With dead ends: 93 [2018-02-02 10:20:51,770 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:20:51,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:20:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:20:51,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2018-02-02 10:20:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:20:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-02 10:20:51,772 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 35 [2018-02-02 10:20:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:51,772 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-02 10:20:51,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:20:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-02 10:20:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:20:51,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:51,773 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-02 10:20:51,773 INFO L371 AbstractCegarLoop]: === Iteration 14 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:51,773 INFO L82 PathProgramCache]: Analyzing trace with hash 679924720, now seen corresponding path program 1 times [2018-02-02 10:20:51,773 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:51,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:52,081 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-02 10:20:52,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:52,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:20:52,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:52,083 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-02 10:20:52,083 INFO L182 omatonBuilderFactory]: Interpolants [3040#(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)))), 3041#(and (= (select |#valid| |entry_point_#t~mem13.base|) 1) (= |entry_point_#t~mem13.offset| 0) (<= 4 (select |#length| |entry_point_#t~mem13.base|))), 3042#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 3043#(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|))), 3044#(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|))))), 3045#(and (= |entry_point_#t~mem13.offset| 0) (<= 4 (select |#length| |entry_point_#t~mem13.base|))), 3034#true, 3035#false, 3036#(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))), 3037#(and (= 0 |ldv_malloc_#t~malloc1.offset|) (or (<= 4294967296 |ldv_malloc_#in~size|) (and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|))))), 3038#(and (or (and (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))) (<= 4294967296 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#res.offset|)), 3039#(and (<= 4 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|) (= (select |#valid| |entry_point_#t~ret10.base|) 1))] [2018-02-02 10:20:52,083 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-02 10:20:52,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:20:52,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:20:52,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:20:52,084 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 12 states. [2018-02-02 10:20:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:52,498 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-02-02 10:20:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:20:52,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-02-02 10:20:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:52,499 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:20:52,499 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:20:52,499 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-02 10:20:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:20:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-02-02 10:20:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 10:20:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-02 10:20:52,502 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 35 [2018-02-02 10:20:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:52,507 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-02 10:20:52,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:20:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-02 10:20:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:20:52,508 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:52,508 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-02 10:20:52,508 INFO L371 AbstractCegarLoop]: === Iteration 15 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1865347170, now seen corresponding path program 1 times [2018-02-02 10:20:52,509 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:52,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:52,643 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-02 10:20:52,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:52,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:52,645 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:52,645 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-02 10:20:52,645 INFO L182 omatonBuilderFactory]: Interpolants [3234#true, 3235#false, 3236#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 3237#(= (select |#valid| |ldv_malloc_#res.base|) 1), 3238#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 3239#(= (select |#valid| entry_point_~a10~0.base) 1), 3240#(= |#valid| |old(#valid)|), 3241#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 3242#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 3243#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 3244#(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)))), 3245#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 3246#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3247#(= 1 (select |#valid| |entry_point_#t~mem16.base|))] [2018-02-02 10:20:52,645 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-02 10:20:52,645 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:52,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:52,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:52,646 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 14 states. [2018-02-02 10:20:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:52,971 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-02-02 10:20:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:20:52,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-02 10:20:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:52,972 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:20:52,972 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:20:52,973 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-02 10:20:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:20:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2018-02-02 10:20:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:20:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-02-02 10:20:52,976 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2018-02-02 10:20:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:52,977 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-02-02 10:20:52,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-02-02 10:20:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 10:20:52,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:52,978 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-02 10:20:52,978 INFO L371 AbstractCegarLoop]: === Iteration 16 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:52,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1865347169, now seen corresponding path program 1 times [2018-02-02 10:20:52,979 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:52,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:53,130 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-02 10:20:53,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:53,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:53,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:53,131 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-02 10:20:53,131 INFO L182 omatonBuilderFactory]: Interpolants [3456#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 3457#(= (select |#valid| entry_point_~a10~0.base) 1), 3458#(= |#valid| |old(#valid)|), 3459#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 3460#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 3461#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 3462#(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))), 3463#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 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))), 3464#(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)))), 3465#(and (= |entry_point_#t~mem16.offset| 0) (<= 4 (select |#length| |entry_point_#t~mem16.base|))), 3452#true, 3453#false, 3454#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 3455#(= (select |#valid| |ldv_malloc_#res.base|) 1)] [2018-02-02 10:20:53,131 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-02 10:20:53,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:53,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:53,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:53,132 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 14 states. [2018-02-02 10:20:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:53,481 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-02-02 10:20:53,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 10:20:53,481 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-02-02 10:20:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:53,481 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:20:53,482 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:20:53,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:20:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:20:53,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2018-02-02 10:20:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:20:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-02-02 10:20:53,484 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 36 [2018-02-02 10:20:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:53,485 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-02-02 10:20:53,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-02-02 10:20:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:20:53,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:53,485 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-02 10:20:53,485 INFO L371 AbstractCegarLoop]: === Iteration 17 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:53,485 INFO L82 PathProgramCache]: Analyzing trace with hash 571575548, now seen corresponding path program 1 times [2018-02-02 10:20:53,486 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:53,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:53,602 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-02 10:20:53,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:53,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:53,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:53,603 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-02 10:20:53,603 INFO L182 omatonBuilderFactory]: Interpolants [3680#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 3681#(= (select |#valid| |ldv_malloc_#res.base|) 1), 3682#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 3683#(= (select |#valid| entry_point_~a10~0.base) 1), 3684#(= |#valid| |old(#valid)|), 3685#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 3686#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 3687#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 3688#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3689#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3690#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 3691#(= 1 (select |#valid| |entry_point_#t~mem16.base|)), 3678#true, 3679#false] [2018-02-02 10:20:53,603 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-02 10:20:53,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:53,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:53,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:53,603 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 14 states. [2018-02-02 10:20:53,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:53,874 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-02-02 10:20:53,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:20:53,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-02-02 10:20:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:53,875 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:20:53,875 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 10:20:53,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:20:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 10:20:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2018-02-02 10:20:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:20:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-02 10:20:53,877 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 38 [2018-02-02 10:20:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:53,877 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-02 10:20:53,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-02 10:20:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:20:53,878 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:53,878 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-02 10:20:53,878 INFO L371 AbstractCegarLoop]: === Iteration 18 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:53,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1669557913, now seen corresponding path program 1 times [2018-02-02 10:20:53,879 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:53,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:53,920 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-02 10:20:53,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:53,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:20:53,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 10:20:53,921 INFO L182 omatonBuilderFactory]: Interpolants [3897#true, 3898#false, 3899#(= (select |#valid| entry_point_~a10~0.base) 1), 3900#(= |#valid| |old(#valid)|), 3901#(= 1 (select |#valid| |alloc_10_#in~a.base|)), 3902#(= 1 (select |#valid| alloc_10_~a.base))] [2018-02-02 10:20:53,921 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-02 10:20:53,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:20:53,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:20:53,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:20:53,922 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-02-02 10:20:54,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:54,022 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-02-02 10:20:54,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:20:54,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-02-02 10:20:54,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:54,023 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:20:54,023 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:20:54,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:20:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:20:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-02-02 10:20:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:20:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-02-02 10:20:54,026 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 40 [2018-02-02 10:20:54,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:54,026 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-02-02 10:20:54,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:20:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-02-02 10:20:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 10:20:54,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:54,027 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-02 10:20:54,027 INFO L371 AbstractCegarLoop]: === Iteration 19 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:54,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1669557912, now seen corresponding path program 1 times [2018-02-02 10:20:54,028 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:54,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:54,079 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-02 10:20:54,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:54,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:20:54,079 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:20:54,079 INFO L182 omatonBuilderFactory]: Interpolants [4081#true, 4082#false, 4083#(= 0 |ldv_malloc_#t~malloc1.offset|), 4084#(= 0 |ldv_malloc_#res.offset|), 4085#(= 0 |entry_point_#t~ret9.offset|), 4086#(= 0 entry_point_~a10~0.offset), 4087#(and (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 4088#(and (<= 4 (select |#length| |alloc_10_#in~a.base|)) (= 0 |alloc_10_#in~a.offset|)), 4089#(and (= alloc_10_~a.offset 0) (<= 4 (select |#length| alloc_10_~a.base)))] [2018-02-02 10:20:54,079 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-02 10:20:54,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:20:54,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:20:54,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:20:54,080 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 9 states. [2018-02-02 10:20:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:54,153 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-02 10:20:54,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:20:54,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-02-02 10:20:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:54,154 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:20:54,154 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:20:54,154 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-02 10:20:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:20:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 10:20:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:20:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-02-02 10:20:54,156 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 40 [2018-02-02 10:20:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:54,157 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-02-02 10:20:54,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:20:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-02-02 10:20:54,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:20:54,157 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:54,157 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-02 10:20:54,157 INFO L371 AbstractCegarLoop]: === Iteration 20 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2024350646, now seen corresponding path program 1 times [2018-02-02 10:20:54,158 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:54,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:54,332 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-02 10:20:54,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:54,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:54,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:54,333 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-02 10:20:54,333 INFO L182 omatonBuilderFactory]: Interpolants [4256#true, 4257#false, 4258#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4259#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4260#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 4261#(= (select |#valid| entry_point_~a10~0.base) 1), 4262#(= |#valid| |old(#valid)|), 4263#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4264#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 4265#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 4266#(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))), 4267#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4268#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 4269#(= 0 |entry_point_#t~mem20.offset|)] [2018-02-02 10:20:54,333 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-02 10:20:54,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:54,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:54,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:54,334 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 14 states. [2018-02-02 10:20:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:54,657 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-02-02 10:20:54,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 10:20:54,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-02-02 10:20:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:54,658 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:20:54,658 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:20:54,658 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:20:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:20:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2018-02-02 10:20:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:20:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-02-02 10:20:54,660 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 39 [2018-02-02 10:20:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:54,660 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-02-02 10:20:54,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-02-02 10:20:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:20:54,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:54,661 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-02 10:20:54,661 INFO L371 AbstractCegarLoop]: === Iteration 21 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2024350647, now seen corresponding path program 1 times [2018-02-02 10:20:54,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:54,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:54,681 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-02 10:20:54,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:54,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:20:54,681 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:20:54,681 INFO L182 omatonBuilderFactory]: Interpolants [4467#true, 4468#false, 4469#(= |entry_point_#t~mem16.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 4470#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4471#(= 1 (select |#valid| |entry_point_#t~mem20.base|))] [2018-02-02 10:20:54,681 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-02 10:20:54,682 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:20:54,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:20:54,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:20:54,682 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 5 states. [2018-02-02 10:20:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:54,759 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-02-02 10:20:54,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:20:54,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-02-02 10:20:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:54,760 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:20:54,760 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:20:54,760 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-02 10:20:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:20:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 10:20:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:20:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-02-02 10:20:54,764 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 39 [2018-02-02 10:20:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:54,765 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-02-02 10:20:54,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:20:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-02-02 10:20:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:20:54,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:54,766 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-02 10:20:54,766 INFO L371 AbstractCegarLoop]: === Iteration 22 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash -216687777, now seen corresponding path program 1 times [2018-02-02 10:20:54,767 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:54,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:54,806 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-02 10:20:54,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:20:54,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:20:54,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 10:20:54,807 INFO L182 omatonBuilderFactory]: Interpolants [4640#true, 4641#false, 4642#(= |entry_point_#t~mem16.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 4643#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4644#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 4645#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_10_~a.base) alloc_10_~a.offset))), 4646#(= 1 (select |#valid| |alloc_10_#t~mem2.base|))] [2018-02-02 10:20:54,808 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-02 10:20:54,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:20:54,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:20:54,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:20:54,808 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 7 states. [2018-02-02 10:20:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:54,927 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-02 10:20:54,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:20:54,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-02-02 10:20:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:54,927 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:20:54,928 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:20:54,928 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-02 10:20:54,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:20:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-02 10:20:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:20:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-02-02 10:20:54,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 41 [2018-02-02 10:20:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:54,929 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-02-02 10:20:54,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:20:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-02-02 10:20:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:20:54,930 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:54,930 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-02 10:20:54,930 INFO L371 AbstractCegarLoop]: === Iteration 23 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash -216687776, now seen corresponding path program 1 times [2018-02-02 10:20:54,931 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:54,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:55,139 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-02 10:20:55,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:55,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:20:55,140 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:55,140 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-02 10:20:55,140 INFO L182 omatonBuilderFactory]: Interpolants [4832#(and (= |alloc_10_#t~mem2.offset| 0) (<= 4 (select |#length| |alloc_10_#t~mem2.base|))), 4815#true, 4816#false, 4817#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 4818#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4819#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 4820#(= (select |#valid| entry_point_~a10~0.base) 1), 4821#(= |#valid| |old(#valid)|), 4822#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 4823#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 4824#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 4825#(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))), 4826#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4827#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 4828#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem16.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 4829#(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)))), 4830#(and (= 0 (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|)))), 4831#(and (= 0 (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))))] [2018-02-02 10:20:55,140 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-02 10:20:55,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:20:55,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:20:55,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:55,141 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 18 states. [2018-02-02 10:20:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:55,596 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-02-02 10:20:55,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 10:20:55,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2018-02-02 10:20:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:55,596 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:20:55,596 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:20:55,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:20:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:20:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2018-02-02 10:20:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:20:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-02-02 10:20:55,599 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 41 [2018-02-02 10:20:55,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:55,599 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-02-02 10:20:55,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:20:55,599 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-02-02 10:20:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 10:20:55,599 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:55,599 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-02 10:20:55,599 INFO L371 AbstractCegarLoop]: === Iteration 24 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -219212007, now seen corresponding path program 1 times [2018-02-02 10:20:55,600 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:55,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:55,725 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-02 10:20:55,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:55,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:55,725 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:55,725 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-02 10:20:55,725 INFO L182 omatonBuilderFactory]: Interpolants [5035#true, 5036#false, 5037#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5038#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5039#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 5040#(= (select |#valid| entry_point_~a10~0.base) 1), 5041#(= |#valid| |old(#valid)|), 5042#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 5043#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 5044#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (not (= 0 |entry_point_#t~ret10.base|))), 5045#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 5046#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| 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))), 5047#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 1 (select |#valid| entry_point_~a10~0.base))), 5048#(and (not (= 0 |entry_point_#t~mem20.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem20.base|)) (= 1 (select |#valid| entry_point_~a10~0.base)))] [2018-02-02 10:20:55,725 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-02 10:20:55,725 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:55,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:55,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:55,726 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 14 states. [2018-02-02 10:20:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:55,953 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-02-02 10:20:55,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:20:55,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-02-02 10:20:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:55,954 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:20:55,954 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:20:55,954 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 10:20:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:20:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2018-02-02 10:20:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:20:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-02-02 10:20:55,956 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 41 [2018-02-02 10:20:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:55,956 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-02-02 10:20:55,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-02-02 10:20:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 10:20:55,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:55,957 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-02 10:20:55,957 INFO L371 AbstractCegarLoop]: === Iteration 25 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2100402388, now seen corresponding path program 1 times [2018-02-02 10:20:55,958 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:55,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:20:56,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:56,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:20:56,441 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:20:56,441 INFO L182 omatonBuilderFactory]: Interpolants [5248#(and (not (= 0 |entry_point_#t~mem20.base|)) (not (= entry_point_~a10~0.base 0)) (not (= |entry_point_#t~mem20.base| entry_point_~a10~0.base)) (= (select (store |#valid| |entry_point_#t~mem20.base| 0) |entry_point_#t~mem20.base|) (select |old(#valid)| |entry_point_#t~mem20.base|)) (= (store (store |#valid| |entry_point_#t~mem20.base| (select |old(#valid)| |entry_point_#t~mem20.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))), 5249#(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)|)))), 5236#true, 5237#false, 5238#(= |#valid| |old(#valid)|), 5239#(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)), 5240#(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)), 5241#(and (= 0 (select |old(#valid)| |entry_point_#t~ret9.base|)) (not (= 0 |entry_point_#t~ret9.base|)) (= (store |#valid| |entry_point_#t~ret9.base| (select |old(#valid)| |entry_point_#t~ret9.base|)) |old(#valid)|) (= (select |#valid| |entry_point_#t~ret9.base|) 1)), 5242#(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))), 5243#(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|))), 5244#(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|))), 5245#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (not (= entry_point_~a10~0.base 0)) (= 0 (select |old(#valid)| |entry_point_#t~ret10.base|)) (= |old(#valid)| (store (store |#valid| |entry_point_#t~ret10.base| (select |old(#valid)| |entry_point_#t~ret10.base|)) entry_point_~a10~0.base (select |old(#valid)| entry_point_~a10~0.base))) (not (= 0 |entry_point_#t~ret10.base|)) (= 0 (select |old(#valid)| entry_point_~a10~0.base))), 5246#(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))), 5247#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.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))) (= |entry_point_#t~mem13.base| (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)))] [2018-02-02 10:20:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:20:56,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 10:20:56,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 10:20:56,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:20:56,442 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 14 states. [2018-02-02 10:20:56,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:56,912 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-02-02 10:20:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 10:20:56,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-02-02 10:20:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:56,913 INFO L225 Difference]: With dead ends: 101 [2018-02-02 10:20:56,913 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:20:56,913 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:20:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:20:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2018-02-02 10:20:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:20:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-02 10:20:56,916 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 44 [2018-02-02 10:20:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:56,916 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-02 10:20:56,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 10:20:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-02 10:20:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:20:56,916 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:56,916 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-02 10:20:56,916 INFO L371 AbstractCegarLoop]: === Iteration 26 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:56,917 INFO L82 PathProgramCache]: Analyzing trace with hash 438037872, now seen corresponding path program 1 times [2018-02-02 10:20:56,917 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:56,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:57,102 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-02 10:20:57,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:57,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:20:57,103 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:57,103 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-02 10:20:57,103 INFO L182 omatonBuilderFactory]: Interpolants [5450#true, 5451#false, 5452#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5453#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5454#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 5455#(= (select |#valid| entry_point_~a10~0.base) 1), 5456#(= |#valid| |old(#valid)|), 5457#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 5458#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 5459#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 5460#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5461#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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))), 5462#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 5463#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 0 |entry_point_#t~ret14.base|) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 |entry_point_#t~ret14.offset|) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5464#(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)))), 5465#(and (= 0 (select (select |#memory_$Pointer$.base| |entry_point_#t~mem16.base|) |entry_point_#t~mem16.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~mem16.base|) |entry_point_#t~mem16.offset|))), 5466#(and (= |entry_point_#t~mem17.base| 0) (= |entry_point_#t~mem17.offset| 0))] [2018-02-02 10:20:57,103 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-02 10:20:57,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:20:57,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:20:57,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:20:57,104 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 17 states. [2018-02-02 10:20:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:57,419 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-02-02 10:20:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 10:20:57,419 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-02-02 10:20:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:57,420 INFO L225 Difference]: With dead ends: 96 [2018-02-02 10:20:57,420 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:20:57,420 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-02 10:20:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:20:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2018-02-02 10:20:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:20:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-02-02 10:20:57,422 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 47 [2018-02-02 10:20:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:57,422 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-02-02 10:20:57,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:20:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-02-02 10:20:57,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 10:20:57,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:57,422 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-02 10:20:57,423 INFO L371 AbstractCegarLoop]: === Iteration 27 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1446651854, now seen corresponding path program 1 times [2018-02-02 10:20:57,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:57,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:57,628 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-02 10:20:57,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:57,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-02-02 10:20:57,628 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:57,628 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-02 10:20:57,629 INFO L182 omatonBuilderFactory]: Interpolants [5668#true, 5669#false, 5670#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5671#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5672#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 5673#(= (select |#valid| entry_point_~a10~0.base) 1), 5674#(= |#valid| |old(#valid)|), 5675#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 5676#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 5677#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 5678#(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))), 5679#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |entry_point_#t~mem13.offset| 0) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5680#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 5681#(not (= 0 |ldv_malloc_#res.base|)), 5682#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |entry_point_#t~mem13.offset| 0) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= 0 |entry_point_#t~ret14.base|))), 5683#(not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) 0))), 5684#(and (= |entry_point_#t~mem16.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem16.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)))), 5685#(or (not (= 0 |entry_point_#t~mem17.base|)) (not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0))), 5686#(not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)), 5687#(not (= |entry_point_#t~mem20.offset| 0))] [2018-02-02 10:20:57,629 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-02 10:20:57,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:20:57,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:20:57,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:20:57,629 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 20 states. [2018-02-02 10:20:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:58,011 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-02-02 10:20:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:20:58,011 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-02-02 10:20:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:58,012 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:20:58,012 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:20:58,012 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-02 10:20:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:20:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2018-02-02 10:20:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:20:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-02 10:20:58,014 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 46 [2018-02-02 10:20:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:58,014 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-02 10:20:58,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:20:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-02 10:20:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:20:58,016 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:58,016 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-02 10:20:58,016 INFO L371 AbstractCegarLoop]: === Iteration 28 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -774502062, now seen corresponding path program 2 times [2018-02-02 10:20:58,017 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:58,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:58,216 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-02 10:20:58,216 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:58,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 10:20:58,216 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:58,216 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-02 10:20:58,216 INFO L182 omatonBuilderFactory]: Interpolants [5888#(= 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)))), 5889#(= 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|)))), 5890#(= 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)))), 5891#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|))), 5892#(= 1 (select |#valid| |alloc_10_#t~mem3.base|)), 5875#true, 5876#false, 5877#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 5878#(= (select |#valid| |ldv_malloc_#res.base|) 1), 5879#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 5880#(= (select |#valid| entry_point_~a10~0.base) 1), 5881#(= |#valid| |old(#valid)|), 5882#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 5883#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 5884#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 5885#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 5886#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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))), 5887#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 1 (select |#valid| |entry_point_#t~ret14.base|)) (= |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)))] [2018-02-02 10:20:58,216 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-02 10:20:58,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 10:20:58,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 10:20:58,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:20:58,217 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 18 states. [2018-02-02 10:20:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:58,625 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2018-02-02 10:20:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 10:20:58,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-02-02 10:20:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:58,626 INFO L225 Difference]: With dead ends: 84 [2018-02-02 10:20:58,626 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 10:20:58,627 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-02 10:20:58,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 10:20:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-02-02 10:20:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 10:20:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-02-02 10:20:58,629 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 49 [2018-02-02 10:20:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:58,629 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-02-02 10:20:58,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 10:20:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-02-02 10:20:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-02 10:20:58,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:58,630 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-02 10:20:58,630 INFO L371 AbstractCegarLoop]: === Iteration 29 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash -774502061, now seen corresponding path program 1 times [2018-02-02 10:20:58,631 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:58,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:20:59,025 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-02 10:20:59,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:20:59,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 10:20:59,025 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:20:59,025 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-02 10:20:59,026 INFO L182 omatonBuilderFactory]: Interpolants [6082#true, 6083#false, 6084#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 6085#(= (select |#valid| |ldv_malloc_#res.base|) 1), 6086#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 6087#(= (select |#valid| entry_point_~a10~0.base) 1), 6088#(= |#valid| |old(#valid)|), 6089#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6090#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6091#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 6092#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 6093#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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))), 6094#(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))), 6095#(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|)), 6096#(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|))), 6097#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (<= 4 (select |#length| |entry_point_#t~ret14.base|)) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 |entry_point_#t~ret14.offset|) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 6098#(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)))), 6099#(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|))))), 6100#(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))))), 6101#(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|)))), 6102#(and (= |alloc_10_#t~mem3.offset| 0) (<= 4 (select |#length| |alloc_10_#t~mem3.base|))), 6103#(= |old(#length)| |#length|)] [2018-02-02 10:20:59,026 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-02 10:20:59,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 10:20:59,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 10:20:59,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:20:59,026 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 22 states. [2018-02-02 10:20:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:20:59,674 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-02-02 10:20:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 10:20:59,675 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-02-02 10:20:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:20:59,675 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:20:59,675 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:20:59,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 10:20:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:20:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-02-02 10:20:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 10:20:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-02-02 10:20:59,678 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 49 [2018-02-02 10:20:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:20:59,678 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-02-02 10:20:59,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 10:20:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-02-02 10:20:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:20:59,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:20:59,679 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-02 10:20:59,679 INFO L371 AbstractCegarLoop]: === Iteration 30 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:20:59,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1357911116, now seen corresponding path program 1 times [2018-02-02 10:20:59,680 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:20:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:20:59,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:00,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:00,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 10:21:00,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:00,039 INFO L182 omatonBuilderFactory]: Interpolants [6304#(= |#valid| |old(#valid)|), 6305#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6306#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6307#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 6308#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 6309#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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))), 6310#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 1 (select |#valid| |entry_point_#t~ret14.base|)) (= |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))), 6311#(= 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)))), 6312#(= 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|)))), 6313#(= 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)))), 6314#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem2.base|) |alloc_10_#t~mem2.offset|))), 6315#(= 1 (select |#valid| |alloc_10_#t~mem3.base|)), 6316#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 6317#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6298#true, 6299#false, 6300#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 6301#(= (select |#valid| |ldv_malloc_#res.base|) 1), 6302#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 6303#(= (select |#valid| entry_point_~a10~0.base) 1)] [2018-02-02 10:21:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:00,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 10:21:00,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 10:21:00,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:21:00,040 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 20 states. [2018-02-02 10:21:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:00,560 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-02-02 10:21:00,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 10:21:00,560 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-02-02 10:21:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:00,561 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:21:00,561 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:21:00,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=1241, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 10:21:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:21:00,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-02-02 10:21:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 10:21:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-02-02 10:21:00,564 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 51 [2018-02-02 10:21:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:00,564 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-02-02 10:21:00,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 10:21:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-02-02 10:21:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:21:00,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:00,565 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-02 10:21:00,565 INFO L371 AbstractCegarLoop]: === Iteration 31 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1357911115, now seen corresponding path program 1 times [2018-02-02 10:21:00,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:00,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:00,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:00,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:21:00,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:00,969 INFO L182 omatonBuilderFactory]: Interpolants [6528#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (<= 4 (select |#length| |entry_point_#t~ret14.base|)) (= (select |#valid| |entry_point_#t~ret14.base|) 1) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 |entry_point_#t~ret14.offset|) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 6529#(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)), 6530#(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|))))), 6531#(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)), 6532#(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)), 6533#(and (= (select |#valid| |alloc_10_#t~mem3.base|) 1) (= |alloc_10_#t~mem3.offset| 0) (<= 4 (select |#length| |alloc_10_#t~mem3.base|))), 6534#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 6535#(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|))), 6536#(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|))))), 6537#(and (= |alloc_10_#t~mem3.offset| 0) (<= 4 (select |#length| |alloc_10_#t~mem3.base|))), 6513#true, 6514#false, 6515#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 6516#(= (select |#valid| |ldv_malloc_#res.base|) 1), 6517#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 6518#(= (select |#valid| entry_point_~a10~0.base) 1), 6519#(= |#valid| |old(#valid)|), 6520#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 6521#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 6522#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 6523#(not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 6524#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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))), 6525#(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))), 6526#(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|)), 6527#(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|)))] [2018-02-02 10:21:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 10:21:00,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:21:00,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:21:00,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:21:00,970 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 25 states. [2018-02-02 10:21:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:01,884 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-02-02 10:21:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:21:01,887 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2018-02-02 10:21:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:01,888 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:21:01,888 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:21:01,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1622, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 10:21:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:21:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-02-02 10:21:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:21:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-02-02 10:21:01,891 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 51 [2018-02-02 10:21:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:01,891 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-02-02 10:21:01,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:21:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-02-02 10:21:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:21:01,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:01,892 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-02 10:21:01,892 INFO L371 AbstractCegarLoop]: === Iteration 32 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:01,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2115258763, now seen corresponding path program 1 times [2018-02-02 10:21:01,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:01,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:01,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:01,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:21:01,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:01,926 INFO L182 omatonBuilderFactory]: Interpolants [6736#(= 1 (select |#valid| |free_10_#in~a.base|)), 6737#(= 1 (select |#valid| free_10_~a.base)), 6732#true, 6733#false, 6734#(= 1 (select |#valid| entry_point_~a10~0.base)), 6735#(= |#valid| |old(#valid)|)] [2018-02-02 10:21:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:01,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:21:01,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:21:01,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:21:01,927 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2018-02-02 10:21:02,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:02,024 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-02-02 10:21:02,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:21:02,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-02-02 10:21:02,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:02,025 INFO L225 Difference]: With dead ends: 93 [2018-02-02 10:21:02,025 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 10:21:02,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:21:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 10:21:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-02-02 10:21:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:21:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-02 10:21:02,027 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 55 [2018-02-02 10:21:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:02,028 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-02 10:21:02,028 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:21:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-02 10:21:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:21:02,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:02,028 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-02 10:21:02,028 INFO L371 AbstractCegarLoop]: === Iteration 33 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -2115258762, now seen corresponding path program 1 times [2018-02-02 10:21:02,029 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:02,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:02,265 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:02,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:02,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:21:02,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:02,266 INFO L182 omatonBuilderFactory]: Interpolants [6928#(= |old(#length)| |#length|), 6929#(and (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 6930#(and (= 0 |free_10_#in~a.offset|) (<= 4 (select |#length| |free_10_#in~a.base|))), 6931#(and (<= 4 (select |#length| free_10_~a.base)) (= free_10_~a.offset 0)), 6920#true, 6921#false, 6922#(= 0 |ldv_malloc_#t~malloc1.offset|), 6923#(= 0 |ldv_malloc_#res.offset|), 6924#(= 0 |entry_point_#t~ret9.offset|), 6925#(= 0 entry_point_~a10~0.offset), 6926#(and (or (= |alloc_10_#in~a.offset| alloc_10_~a.offset) (= alloc_10_~a.offset 0)) (= alloc_10_~a.base |alloc_10_#in~a.base|)), 6927#(or (<= 4 (select |#length| |alloc_10_#in~a.base|)) (not (= |alloc_10_#in~a.offset| 0)))] [2018-02-02 10:21:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:02,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:21:02,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:21:02,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:21:02,267 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 12 states. [2018-02-02 10:21:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:02,766 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-02-02 10:21:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 10:21:02,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-02 10:21:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:02,767 INFO L225 Difference]: With dead ends: 97 [2018-02-02 10:21:02,767 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 10:21:02,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:21:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 10:21:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-02-02 10:21:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:21:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-02 10:21:02,770 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 55 [2018-02-02 10:21:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:02,770 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-02 10:21:02,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:21:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-02 10:21:02,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:21:02,771 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:02,771 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] [2018-02-02 10:21:02,771 INFO L371 AbstractCegarLoop]: === Iteration 34 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1148512223, now seen corresponding path program 1 times [2018-02-02 10:21:02,772 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:02,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:03,096 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-02 10:21:03,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:03,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 10:21:03,096 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:03,097 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-02 10:21:03,097 INFO L182 omatonBuilderFactory]: Interpolants [7136#(= (select |#valid| entry_point_~a10~0.base) 1), 7137#(= |#valid| |old(#valid)|), 7138#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 7139#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 7140#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 7141#(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)), 7142#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (select |#valid| entry_point_~a10~0.base) 1) (= |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))), 7143#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 7144#(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))))), 7145#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7146#(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|)), 7147#(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)|)), 7148#(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|)))), 7149#(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|)))), 7150#(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|)))), 7151#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 7152#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 7153#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset))), 7154#(= 1 (select |#valid| |free_10_#t~mem6.base|)), 7131#true, 7132#false, 7133#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 7134#(= (select |#valid| |ldv_malloc_#res.base|) 1), 7135#(= (select |#valid| |entry_point_#t~ret9.base|) 1)] [2018-02-02 10:21:03,097 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-02 10:21:03,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 10:21:03,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 10:21:03,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-02 10:21:03,097 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 24 states. [2018-02-02 10:21:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:03,742 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-02-02 10:21:03,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 10:21:03,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-02-02 10:21:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:03,743 INFO L225 Difference]: With dead ends: 94 [2018-02-02 10:21:03,743 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 10:21:03,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 10:21:03,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 10:21:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-02-02 10:21:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:21:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-02-02 10:21:03,746 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 56 [2018-02-02 10:21:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:03,746 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-02-02 10:21:03,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 10:21:03,746 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-02-02 10:21:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 10:21:03,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:03,746 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] [2018-02-02 10:21:03,746 INFO L371 AbstractCegarLoop]: === Iteration 35 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1148512222, now seen corresponding path program 1 times [2018-02-02 10:21:03,747 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:03,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:04,483 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-02 10:21:04,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:04,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:21:04,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:04,483 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-02 10:21:04,483 INFO L182 omatonBuilderFactory]: Interpolants [7368#true, 7369#false, 7370#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 7371#(= (select |#valid| |ldv_malloc_#res.base|) 1), 7372#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 7373#(= (select |#valid| entry_point_~a10~0.base) 1), 7374#(= |#valid| |old(#valid)|), 7375#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= |ldv_malloc_#t~malloc1.offset| 0)), 7376#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| 0)), 7377#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= |entry_point_#t~ret10.offset| 0)), 7378#(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) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)), 7379#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (select |#valid| entry_point_~a10~0.base) 1) (= |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)) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)), 7380#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 7381#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 7382#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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)) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0) (not (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 7383#(and (= (select (select |#memory_$Pointer$.offset| 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))))), 7384#(and (= |entry_point_#t~mem16.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= |entry_point_#t~mem16.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 (= 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))))), 7385#(and (<= (+ (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))) (= (select (select |#memory_$Pointer$.offset| 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))))), 7386#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7387#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |alloc_10_#in~a.base| alloc_10_~a.base) (= alloc_10_~a.offset |alloc_10_#in~a.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 7388#(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)|) (= |old(#length)| |#length|)), 7389#(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 (<= 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|) (select (select |old(#memory_$Pointer$.offset)| |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|)) (= |old(#length)| |#length|) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 7390#(= |old(#length)| |#length|), 7391#(and (= 0 |ldv_malloc_#res.offset|) (= |old(#length)| |#length|)), 7392#(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 (<= 0 (select (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|) |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|)) (= |old(#length)| |#length|) (or (<= (select (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|) |alloc_10_#in~a.offset|) (select (select |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (and (= |alloc_10_#t~mem3.offset| |alloc_10_#in~a.offset|) (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|) (= 0 |alloc_10_#t~ret4.offset|))))), 7393#(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 (<= 0 (select (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (or (= 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|) (select (select |old(#memory_$Pointer$.offset)| |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|)) (= |old(#length)| |#length|))), 7394#(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)))), 7395#(and (<= 0 (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 7396#(and (<= (+ (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset) 4) (select |#length| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset))), 7397#(and (<= 0 |free_10_#t~mem6.offset|) (<= (+ |free_10_#t~mem6.offset| 4) (select |#length| |free_10_#t~mem6.base|)))] [2018-02-02 10:21:04,484 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-02 10:21:04,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:21:04,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:21:04,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:21:04,484 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 30 states. [2018-02-02 10:21:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:05,506 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-02-02 10:21:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:21:05,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-02-02 10:21:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:05,507 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:21:05,507 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:21:05,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=2404, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:21:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:21:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89. [2018-02-02 10:21:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:21:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-02-02 10:21:05,509 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 56 [2018-02-02 10:21:05,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:05,510 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-02-02 10:21:05,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:21:05,510 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-02-02 10:21:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:21:05,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:05,511 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-02 10:21:05,511 INFO L371 AbstractCegarLoop]: === Iteration 36 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1356253015, now seen corresponding path program 1 times [2018-02-02 10:21:05,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:05,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:05,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:05,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 10:21:05,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:05,610 INFO L182 omatonBuilderFactory]: Interpolants [7648#(= |#valid| |old(#valid)|), 7649#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 7650#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 7651#(= 1 (select |#valid| entry_point_~a10~0.base)), 7652#(= 1 (select |#valid| |free_10_#in~a.base|)), 7653#(= 1 (select |#valid| free_10_~a.base)), 7644#true, 7645#false, 7646#(= alloc_10_~a.base |alloc_10_#in~a.base|), 7647#(= 1 (select |#valid| |alloc_10_#in~a.base|))] [2018-02-02 10:21:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 10:21:05,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:21:05,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:21:05,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:21:05,610 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 10 states. [2018-02-02 10:21:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:05,755 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-02-02 10:21:05,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:21:05,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-02-02 10:21:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:05,756 INFO L225 Difference]: With dead ends: 88 [2018-02-02 10:21:05,756 INFO L226 Difference]: Without dead ends: 88 [2018-02-02 10:21:05,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-02 10:21:05,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-02 10:21:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-02-02 10:21:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-02-02 10:21:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-02-02 10:21:05,758 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 57 [2018-02-02 10:21:05,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:05,758 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-02-02 10:21:05,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:21:05,758 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-02-02 10:21:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:21:05,759 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:05,759 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-02 10:21:05,759 INFO L371 AbstractCegarLoop]: === Iteration 37 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1356253016, now seen corresponding path program 1 times [2018-02-02 10:21:05,759 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:05,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:05,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:05,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 10:21:05,920 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:05,920 INFO L182 omatonBuilderFactory]: Interpolants [7840#true, 7841#false, 7842#(= 0 |ldv_malloc_#t~malloc1.offset|), 7843#(= 0 |ldv_malloc_#res.offset|), 7844#(= 0 |entry_point_#t~ret9.offset|), 7845#(= 0 entry_point_~a10~0.offset), 7846#(and (= (select |#valid| entry_point_~a10~0.base) 1) (= 0 entry_point_~a10~0.offset)), 7847#(= |#valid| |old(#valid)|), 7848#(and (or (= |alloc_10_#in~a.offset| alloc_10_~a.offset) (= alloc_10_~a.offset 0)) (= alloc_10_~a.base |alloc_10_#in~a.base|) (= |#valid| |old(#valid)|)), 7849#(and (= |#valid| |old(#valid)|) (or (<= 4 (select |#length| |alloc_10_#in~a.base|)) (not (= |alloc_10_#in~a.offset| 0)))), 7850#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 7851#(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|))), 7852#(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|))))), 7853#(or (= 0 (select |old(#valid)| |alloc_10_#in~a.base|)) (<= 4 (select |#length| |alloc_10_#in~a.base|)) (not (= |alloc_10_#in~a.offset| 0))), 7854#(and (= 0 entry_point_~a10~0.offset) (<= 4 (select |#length| entry_point_~a10~0.base))), 7855#(and (= 0 |free_10_#in~a.offset|) (<= 4 (select |#length| |free_10_#in~a.base|))), 7856#(and (<= 4 (select |#length| free_10_~a.base)) (= free_10_~a.offset 0))] [2018-02-02 10:21:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:05,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 10:21:05,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 10:21:05,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-02 10:21:05,921 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 17 states. [2018-02-02 10:21:06,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:06,275 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-02-02 10:21:06,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 10:21:06,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-02-02 10:21:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:06,276 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:21:06,276 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:21:06,276 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:21:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:21:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-02 10:21:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:21:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-02-02 10:21:06,278 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 57 [2018-02-02 10:21:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:06,278 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-02-02 10:21:06,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 10:21:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-02-02 10:21:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:21:06,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:06,279 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-02 10:21:06,279 INFO L371 AbstractCegarLoop]: === Iteration 38 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1244140552, now seen corresponding path program 1 times [2018-02-02 10:21:06,280 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:06,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:06,716 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-02 10:21:06,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:06,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:21:06,717 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:06,717 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-02 10:21:06,717 INFO L182 omatonBuilderFactory]: Interpolants [8064#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 8065#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 8066#(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)), 8067#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 8068#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= 1 (select |#valid| |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 8069#(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))))), 8070#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8071#(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|)), 8072#(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)|)), 8073#(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 |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|))), 8074#(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|))), 8075#(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|)))), 8076#(= 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)))), 8077#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 8078#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))), 8079#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|))), 8080#(= 1 (select |#valid| |free_10_#t~mem7.base|)), 8056#true, 8057#false, 8058#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 8059#(= (select |#valid| |ldv_malloc_#res.base|) 1), 8060#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 8061#(= (select |#valid| entry_point_~a10~0.base) 1), 8062#(= |#valid| |old(#valid)|), 8063#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1))] [2018-02-02 10:21:06,717 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-02 10:21:06,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:21:06,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:21:06,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:21:06,718 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 25 states. [2018-02-02 10:21:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:07,443 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-02-02 10:21:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 10:21:07,443 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-02-02 10:21:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:07,443 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:21:07,443 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:21:07,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=1382, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 10:21:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:21:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-02-02 10:21:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:21:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-02-02 10:21:07,446 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 57 [2018-02-02 10:21:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:07,446 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-02-02 10:21:07,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:21:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-02-02 10:21:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 10:21:07,446 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:07,447 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-02 10:21:07,447 INFO L371 AbstractCegarLoop]: === Iteration 39 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1244140551, now seen corresponding path program 1 times [2018-02-02 10:21:07,447 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:07,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:08,292 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-02 10:21:08,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:08,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:21:08,293 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:08,293 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-02 10:21:08,293 INFO L182 omatonBuilderFactory]: Interpolants [8288#true, 8289#false, 8290#(= 0 (select |#valid| 0)), 8291#(= (select |old(#valid)| 0) (select |#valid| 0)), 8292#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc1.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 8293#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8294#(and (= 1 (select |#valid| |entry_point_#t~ret9.base|)) (= 0 (select |#valid| 0)) (= 0 |entry_point_#t~ret9.offset|)), 8295#(and (= 0 (select |#valid| 0)) (= 0 entry_point_~a10~0.offset) (= 1 (select |#valid| entry_point_~a10~0.base))), 8296#(= |#valid| |old(#valid)|), 8297#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8298#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 8299#(and (= 0 (select |#valid| 0)) (not (= |entry_point_#t~ret10.base| entry_point_~a10~0.base)) (= 0 entry_point_~a10~0.offset) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 8300#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= 0 (select |#valid| 0)) (= 0 entry_point_~a10~0.offset) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) entry_point_~a10~0.base))), 8301#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| 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)) (= 0 (select |#valid| 0)) (= 0 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))), 8302#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc1.base|) 0)), 8303#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |old(#valid)| 0) (select |#valid| 0))), 8304#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= |entry_point_#t~ret14.base| (select (select |#memory_$Pointer$.base| 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)) (= 0 (select |#valid| 0)) (= 0 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))), 8305#(and (= 0 (select |#valid| 0)) (= 0 entry_point_~a10~0.offset) (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)) (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 8306#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8307#(and (= |alloc_10_#in~a.offset| alloc_10_~a.offset) (or (not (= alloc_10_~a.offset 0)) (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= (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_#in~a.base| alloc_10_~a.base)))), 8308#(or (and (= |alloc_10_#t~mem2.base| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |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)|)) (not (= |alloc_10_#in~a.offset| 0))), 8309#(or (<= (+ |alloc_10_#t~mem3.offset| 1) 0) (and (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (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|)))) (not (= |alloc_10_#in~a.offset| 0)) (and (= |alloc_10_#t~mem3.offset| |alloc_10_#in~a.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= |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|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)) (and (<= (select |#length| |alloc_10_#t~mem3.base|) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#in~a.offset|)))) (not (= |alloc_10_#t~mem3.base| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#in~a.offset|))) (not (= |alloc_10_#t~mem3.offset| |alloc_10_#in~a.offset|)) (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|) (= |alloc_10_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#in~a.offset|))))), 8310#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |old(#length)| |#length|)), 8311#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= |old(#length)| |#length|) (= 0 |ldv_malloc_#res.base|)), 8312#(or (<= (+ |alloc_10_#t~mem3.offset| 1) 0) (and (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |alloc_10_#in~a.offset|)))) (not (= |alloc_10_#in~a.offset| 0)) (= (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 (or (and (<= (select |#length| |alloc_10_#t~mem3.base|) (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|)) (select (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|) |alloc_10_#in~a.offset|)) (select (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|) |alloc_10_#in~a.offset|)))) (= |alloc_10_#t~mem3.offset| (select (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 (store (select |#memory_$Pointer$.base| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.base|) |alloc_10_#in~a.offset|)) (select (store (select |#memory_$Pointer$.offset| |alloc_10_#t~mem3.base|) |alloc_10_#t~mem3.offset| |alloc_10_#t~ret4.offset|) |alloc_10_#in~a.offset|)))) (and (= 0 |alloc_10_#t~ret4.base|) (= |alloc_10_#t~mem3.offset| |alloc_10_#in~a.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)))) (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|))), 8313#(or (and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (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|))) (<= (+ (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|))))) (not (= |alloc_10_#in~a.offset| 0)) (= (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|))), 8314#(or (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))) (<= (+ (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)) 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))))) (and (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 8315#(or (and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) 4) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (and (= 0 (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= 0 (select |#valid| 0)))), 8316#(or (and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)) 4) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))) (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))) (and (= 0 (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)))), 8317#(or (and (<= 0 (select (select |#memory_$Pointer$.offset| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|)))) (not (= 1 (select |#valid| |free_10_#t~mem6.base|)))), 8318#(and (<= 0 |free_10_#t~mem7.offset|) (<= (+ |free_10_#t~mem7.offset| 4) (select |#length| |free_10_#t~mem7.base|)))] [2018-02-02 10:21:08,293 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-02 10:21:08,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:21:08,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:21:08,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:21:08,294 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 31 states. [2018-02-02 10:21:09,284 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 118 DAG size of output 88 [2018-02-02 10:21:09,442 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 107 DAG size of output 87 [2018-02-02 10:21:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:10,419 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2018-02-02 10:21:10,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 10:21:10,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2018-02-02 10:21:10,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:10,420 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:21:10,420 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:21:10,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=452, Invalid=3838, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 10:21:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:21:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 87. [2018-02-02 10:21:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 10:21:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-02-02 10:21:10,423 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 57 [2018-02-02 10:21:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:10,424 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-02-02 10:21:10,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:21:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-02-02 10:21:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:21:10,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:10,424 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] [2018-02-02 10:21:10,425 INFO L371 AbstractCegarLoop]: === Iteration 40 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash -905829505, now seen corresponding path program 1 times [2018-02-02 10:21:10,425 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:10,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:10,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:10,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 10:21:10,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:10,848 INFO L182 omatonBuilderFactory]: Interpolants [8584#true, 8585#false, 8586#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 8587#(= (select |#valid| |ldv_malloc_#res.base|) 1), 8588#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 8589#(= (select |#valid| entry_point_~a10~0.base) 1), 8590#(= |#valid| |old(#valid)|), 8591#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8592#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8593#(not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)), 8594#(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)), 8595#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (select |#valid| entry_point_~a10~0.base) 1) (= |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))), 8596#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 8597#(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)))), 8598#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8599#(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|)), 8600#(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)|)), 8601#(or (and (= 1 (select |#valid| (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|))) (= (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|)), 8602#(and (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)) (= (store |old(#valid)| |ldv_malloc_#t~malloc1.base| (select |#valid| |ldv_malloc_#t~malloc1.base|)) |#valid|)), 8603#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 8604#(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|) (= 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|)))), 8605#(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|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))), 8606#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 8607#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 8608#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset))), 8609#(= 1 (select |#valid| |free_10_#t~mem6.base|))] [2018-02-02 10:21:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:10,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 10:21:10,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 10:21:10,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2018-02-02 10:21:10,849 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 26 states. [2018-02-02 10:21:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:11,774 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-02-02 10:21:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 10:21:11,775 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2018-02-02 10:21:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:11,775 INFO L225 Difference]: With dead ends: 86 [2018-02-02 10:21:11,775 INFO L226 Difference]: Without dead ends: 86 [2018-02-02 10:21:11,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=244, Invalid=2108, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:21:11,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-02 10:21:11,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-02 10:21:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 10:21:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-02-02 10:21:11,778 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 58 [2018-02-02 10:21:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:11,778 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-02-02 10:21:11,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 10:21:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-02-02 10:21:11,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:21:11,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:11,778 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] [2018-02-02 10:21:11,779 INFO L371 AbstractCegarLoop]: === Iteration 41 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash -905829504, now seen corresponding path program 1 times [2018-02-02 10:21:11,779 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:11,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:12,196 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-02 10:21:12,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:12,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:21:12,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:12,197 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-02 10:21:12,197 INFO L182 omatonBuilderFactory]: Interpolants [8832#(= (select |#valid| |ldv_malloc_#res.base|) 1), 8833#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 8834#(= (select |#valid| entry_point_~a10~0.base) 1), 8835#(= |#valid| |old(#valid)|), 8836#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 8837#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 8838#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 8839#(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)), 8840#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (= |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))), 8841#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 8842#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 8843#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 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)) (= |entry_point_#t~mem13.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~ret14.base|))), 8844#(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))))), 8845#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 8846#(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|)), 8847#(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)|)), 8848#(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 (select |#memory_$Pointer$.base| |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|)))), 8849#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 8850#(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|))), 8851#(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|))))), 8852#(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 (<= 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|))) (= 0 (select |old(#valid)| (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|)))))), 8853#(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 (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))) (= 0 (select |old(#valid)| (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|)))), 8854#(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)))), 8855#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 8856#(and (= 0 (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)))), 8857#(and (<= 4 (select |#length| |free_10_#t~mem6.base|)) (= |free_10_#t~mem6.offset| 0)), 8829#true, 8830#false, 8831#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)] [2018-02-02 10:21:12,197 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-02 10:21:12,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:21:12,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:21:12,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:21:12,198 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 29 states. [2018-02-02 10:21:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:13,244 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-02-02 10:21:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:21:13,245 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-02-02 10:21:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:13,245 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:21:13,245 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:21:13,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=2397, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:21:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:21:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-02 10:21:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 10:21:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-02-02 10:21:13,247 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 58 [2018-02-02 10:21:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:13,247 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-02-02 10:21:13,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:21:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-02-02 10:21:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:21:13,247 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:13,248 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-02 10:21:13,248 INFO L371 AbstractCegarLoop]: === Iteration 42 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 86348548, now seen corresponding path program 1 times [2018-02-02 10:21:13,249 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:13,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:13,823 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-02 10:21:13,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:13,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:21:13,824 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:13,824 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-02 10:21:13,824 INFO L182 omatonBuilderFactory]: Interpolants [9088#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 9089#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 9090#(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))))), 9091#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9092#(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|)), 9093#(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)|)), 9094#(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 (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (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|))), 9095#(= 0 |ldv_malloc_#res.offset|), 9096#(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 (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |alloc_10_#in~a.offset|))) (= 0 |alloc_10_#t~ret4.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|))), 9097#(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|)) (= 0 (select (select |#memory_$Pointer$.offset| (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 |#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|))))), 9098#(= 0 (select (select |#memory_$Pointer$.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))) (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)))), 9099#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 9100#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))), 9101#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|))), 9102#(= 0 (select (select |#memory_$Pointer$.offset| |free_10_#t~mem7.base|) |free_10_#t~mem7.offset|)), 9103#(= 0 |free_10_#t~mem8.offset|), 9075#true, 9076#false, 9077#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 9078#(= (select |#valid| |ldv_malloc_#res.base|) 1), 9079#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 9080#(= (select |#valid| entry_point_~a10~0.base) 1), 9081#(= |#valid| |old(#valid)|), 9082#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 9083#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9084#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 9085#(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)), 9086#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 9087#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))] [2018-02-02 10:21:13,824 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-02 10:21:13,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:21:13,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:21:13,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:21:13,825 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 29 states. [2018-02-02 10:21:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:14,951 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-02-02 10:21:14,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:21:14,952 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-02-02 10:21:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:14,952 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:21:14,952 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 10:21:14,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=2723, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 10:21:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 10:21:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2018-02-02 10:21:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 10:21:14,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-02-02 10:21:14,955 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 58 [2018-02-02 10:21:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:14,955 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-02-02 10:21:14,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:21:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-02-02 10:21:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 10:21:14,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:14,956 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-02 10:21:14,956 INFO L371 AbstractCegarLoop]: === Iteration 43 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 86348549, now seen corresponding path program 1 times [2018-02-02 10:21:14,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:14,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:15,362 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-02 10:21:15,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:15,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 10:21:15,362 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:15,362 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-02 10:21:15,363 INFO L182 omatonBuilderFactory]: Interpolants [9347#true, 9348#false, 9349#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 9350#(= (select |#valid| |ldv_malloc_#res.base|) 1), 9351#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 9352#(= (select |#valid| entry_point_~a10~0.base) 1), 9353#(= |#valid| |old(#valid)|), 9354#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 9355#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9356#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 9357#(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)), 9358#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 9359#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 9360#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 9361#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 9362#(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))))), 9363#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9364#(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|)), 9365#(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)|)), 9366#(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 (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (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|))), 9367#(= 0 |ldv_malloc_#res.base|), 9368#(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 (= 0 |alloc_10_#t~ret4.base|) (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |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|))), 9369#(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|) (= 0 (select (select |#memory_$Pointer$.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 |#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|)))) (= (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|))), 9370#(= 0 (select (select |#memory_$Pointer$.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))) (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)))), 9371#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 9372#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))), 9373#(= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|))), 9374#(= 0 (select (select |#memory_$Pointer$.base| |free_10_#t~mem7.base|) |free_10_#t~mem7.offset|)), 9375#(= 0 |free_10_#t~mem8.base|)] [2018-02-02 10:21:15,363 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-02 10:21:15,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 10:21:15,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 10:21:15,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2018-02-02 10:21:15,363 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 29 states. [2018-02-02 10:21:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:16,381 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-02-02 10:21:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:21:16,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-02-02 10:21:16,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:16,382 INFO L225 Difference]: With dead ends: 103 [2018-02-02 10:21:16,382 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 10:21:16,382 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=2430, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:21:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 10:21:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2018-02-02 10:21:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-02 10:21:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-02-02 10:21:16,384 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 58 [2018-02-02 10:21:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:16,385 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-02-02 10:21:16,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 10:21:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-02-02 10:21:16,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:21:16,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:16,385 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-02 10:21:16,385 INFO L371 AbstractCegarLoop]: === Iteration 44 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1984056410, now seen corresponding path program 1 times [2018-02-02 10:21:16,386 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:16,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:16,741 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-02 10:21:16,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:16,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:21:16,741 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:16,741 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-02 10:21:16,742 INFO L182 omatonBuilderFactory]: Interpolants [9612#true, 9613#false, 9614#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 9615#(= (select |#valid| |ldv_malloc_#res.base|) 1), 9616#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 9617#(= (select |#valid| entry_point_~a10~0.base) 1), 9618#(= |#valid| |old(#valid)|), 9619#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 9620#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9621#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 9622#(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)), 9623#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 9624#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 9625#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 9626#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 9627#(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))))), 9628#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9629#(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|)), 9630#(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)|)), 9631#(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 (= |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|))) (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|)))), 9632#(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|) (= |alloc_10_#t~mem3.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|)) (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 (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|) |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|))), 9633#(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|) (= 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 |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|))), 9634#(= 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)))), 9635#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 9636#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))), 9637#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|))), 9638#(= 1 (select |#valid| |free_10_#t~mem7.base|))] [2018-02-02 10:21:16,742 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-02 10:21:16,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:21:16,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:21:16,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:21:16,742 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 27 states. [2018-02-02 10:21:17,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:17,538 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-02-02 10:21:17,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:21:17,539 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-02-02 10:21:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:17,539 INFO L225 Difference]: With dead ends: 85 [2018-02-02 10:21:17,539 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 10:21:17,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=2062, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:21:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 10:21:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-02 10:21:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 10:21:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-02-02 10:21:17,541 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 59 [2018-02-02 10:21:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:17,541 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-02-02 10:21:17,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:21:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-02-02 10:21:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:21:17,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:17,542 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-02 10:21:17,542 INFO L371 AbstractCegarLoop]: === Iteration 45 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1984056411, now seen corresponding path program 1 times [2018-02-02 10:21:17,543 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:17,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:17,990 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-02 10:21:17,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:17,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:21:17,990 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:17,991 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-02 10:21:17,991 INFO L182 omatonBuilderFactory]: Interpolants [9856#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 9857#(= (select |#valid| entry_point_~a10~0.base) 1), 9858#(= |#valid| |old(#valid)|), 9859#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 9860#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9861#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 9862#(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)), 9863#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 9864#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 9865#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 9866#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 |entry_point_#t~ret14.offset|) (= |entry_point_#t~mem13.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~ret14.base|))), 9867#(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))))), 9868#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 9869#(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)|)), 9870#(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)|)), 9871#(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 (= |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 |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|)) (= (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|)))) (= (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|))), 9872#(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|)) (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (= (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|)) (select (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|) |alloc_10_#in~a.offset|))), 9873#(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|)) (<= 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|)))) (= (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|))), 9874#(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)))), 9875#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))), 9876#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))), 9877#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|))), 9878#(and (<= 4 (select |#length| |free_10_#t~mem7.base|)) (= |free_10_#t~mem7.offset| 0)), 9852#true, 9853#false, 9854#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 9855#(= (select |#valid| |ldv_malloc_#res.base|) 1)] [2018-02-02 10:21:17,991 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-02 10:21:17,991 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:21:17,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:21:17,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:21:17,991 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 27 states. [2018-02-02 10:21:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:18,992 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-02-02 10:21:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 10:21:18,999 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-02-02 10:21:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:18,999 INFO L225 Difference]: With dead ends: 84 [2018-02-02 10:21:19,000 INFO L226 Difference]: Without dead ends: 84 [2018-02-02 10:21:19,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=2239, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:21:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-02 10:21:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-02 10:21:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 10:21:19,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2018-02-02 10:21:19,002 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 59 [2018-02-02 10:21:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:19,003 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2018-02-02 10:21:19,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:21:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-02-02 10:21:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:21:19,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:19,003 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] [2018-02-02 10:21:19,003 INFO L371 AbstractCegarLoop]: === Iteration 46 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:19,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1376206562, now seen corresponding path program 1 times [2018-02-02 10:21:19,004 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:19,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:19,524 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-02 10:21:19,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:19,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 10:21:19,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:19,524 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-02 10:21:19,524 INFO L182 omatonBuilderFactory]: Interpolants [10112#(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)|)), 10113#(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 (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (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|))), 10114#(= 0 |ldv_malloc_#t~malloc1.offset|), 10115#(= 0 |ldv_malloc_#res.offset|), 10116#(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 (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |alloc_10_#in~a.offset|))) (= 0 |alloc_10_#t~ret4.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|))), 10117#(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|)) (= 0 (select (select |#memory_$Pointer$.offset| (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 |#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|))))), 10118#(= 0 (select (select |#memory_$Pointer$.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))) (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)))), 10119#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 10120#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))), 10121#(= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|))), 10122#(= 0 (select (select |#memory_$Pointer$.offset| |free_10_#t~mem7.base|) |free_10_#t~mem7.offset|)), 10123#(= 0 |free_10_#t~mem8.offset|), 10094#true, 10095#false, 10096#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 10097#(= (select |#valid| |ldv_malloc_#res.base|) 1), 10098#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 10099#(= (select |#valid| entry_point_~a10~0.base) 1), 10100#(= |#valid| |old(#valid)|), 10101#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 10102#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 10103#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 10104#(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)), 10105#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 10106#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10107#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10108#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 10109#(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))))), 10110#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10111#(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|))] [2018-02-02 10:21:19,525 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-02 10:21:19,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 10:21:19,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 10:21:19,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=806, Unknown=0, NotChecked=0, Total=870 [2018-02-02 10:21:19,525 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 30 states. [2018-02-02 10:21:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:20,713 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2018-02-02 10:21:20,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 10:21:20,713 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-02-02 10:21:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:20,714 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:21:20,714 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:21:20,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=252, Invalid=2828, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:21:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:21:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-02 10:21:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:21:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2018-02-02 10:21:20,716 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 60 [2018-02-02 10:21:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:20,717 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2018-02-02 10:21:20,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 10:21:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2018-02-02 10:21:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 10:21:20,717 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:20,717 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] [2018-02-02 10:21:20,717 INFO L371 AbstractCegarLoop]: === Iteration 47 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1376206563, now seen corresponding path program 1 times [2018-02-02 10:21:20,718 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:20,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:21,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:21,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 10:21:21,132 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:21,132 INFO L182 omatonBuilderFactory]: Interpolants [10368#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#t~mem6.base|) |free_10_#t~mem6.offset|)))), 10369#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#t~mem7.base|) |free_10_#t~mem7.offset|))), 10370#(= 1 (select |#valid| |free_10_#t~mem8.base|)), 10343#true, 10344#false, 10345#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 10346#(= (select |#valid| |ldv_malloc_#res.base|) 1), 10347#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 10348#(= (select |#valid| entry_point_~a10~0.base) 1), 10349#(= |#valid| |old(#valid)|), 10350#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 10351#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 10352#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 10353#(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)), 10354#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 10355#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10356#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10357#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 10358#(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))))), 10359#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10360#(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|)), 10361#(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)|)), 10362#(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 (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (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|))), 10363#(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 (= 1 (select |#valid| |alloc_10_#t~ret4.base|)) (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |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|))), 10364#(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|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.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 |#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|))))) (= (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|))), 10365#(= 1 (select |#valid| (select (select |#memory_$Pointer$.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))) (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))))), 10366#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))), 10367#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| free_10_~a.base) free_10_~a.offset)) (select (select |#memory_$Pointer$.offset| free_10_~a.base) free_10_~a.offset)))))] [2018-02-02 10:21:21,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:21,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 10:21:21,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 10:21:21,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2018-02-02 10:21:21,133 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 28 states. [2018-02-02 10:21:22,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:22,149 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-02-02 10:21:22,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 10:21:22,149 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-02 10:21:22,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:22,150 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:21:22,150 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:21:22,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=2060, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 10:21:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:21:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 10:21:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:21:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-02-02 10:21:22,152 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 60 [2018-02-02 10:21:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:22,152 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-02-02 10:21:22,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 10:21:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-02-02 10:21:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:21:22,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:22,153 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-02 10:21:22,153 INFO L371 AbstractCegarLoop]: === Iteration 48 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1227161500, now seen corresponding path program 1 times [2018-02-02 10:21:22,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:22,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:22,718 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-02 10:21:22,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:22,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:21:22,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:22,718 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-02 10:21:22,718 INFO L182 omatonBuilderFactory]: Interpolants [10576#true, 10577#false, 10578#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 10579#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 10580#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 10581#(= 1 (select |#valid| entry_point_~a10~0.base)), 10582#(= |#valid| |old(#valid)|), 10583#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 10584#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 10585#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (not (= 0 |entry_point_#t~ret10.base|)) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 10586#(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) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)))), 10587#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 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) (not (= 0 (select (select |#memory_$Pointer$.base| 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)) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 10588#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 10589#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 10590#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| 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)) (= |entry_point_#t~mem13.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~ret14.base|))), 10591#(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| 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))))), 10592#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 10593#(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|)), 10594#(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)|)), 10595#(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 (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (= (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|)))), 10596#(= 0 |ldv_malloc_#res.base|), 10597#(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 (= 0 |alloc_10_#t~ret4.base|) (= |alloc_10_#t~mem3.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|)) (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 (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|) |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|)) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |alloc_10_#in~a.offset|))))), 10598#(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 (= 0 (select (select |#memory_$Pointer$.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 |#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|)))) (= (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|))), 10599#(not (= (select (select |#memory_$Pointer$.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))) (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 (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 10600#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 10601#(and (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|) |free_10_#t~mem6.base|)), 10602#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 10603#(and (or (= (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= 1 (select (store |#valid| |free_10_#t~mem8.base| 0) (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 10604#(or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 10605#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 10606#(= 1 (select |#valid| |entry_point_#t~mem18.base|))] [2018-02-02 10:21:22,718 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-02 10:21:22,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:21:22,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:21:22,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=860, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:21:22,719 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 31 states. [2018-02-02 10:21:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:23,977 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2018-02-02 10:21:23,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 10:21:23,977 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 63 [2018-02-02 10:21:23,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:23,977 INFO L225 Difference]: With dead ends: 98 [2018-02-02 10:21:23,977 INFO L226 Difference]: Without dead ends: 98 [2018-02-02 10:21:23,978 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=304, Invalid=3602, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 10:21:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-02 10:21:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2018-02-02 10:21:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:21:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-02-02 10:21:23,980 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 63 [2018-02-02 10:21:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:23,980 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-02-02 10:21:23,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:21:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-02-02 10:21:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:21:23,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:23,980 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-02 10:21:23,980 INFO L371 AbstractCegarLoop]: === Iteration 49 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:23,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1227161501, now seen corresponding path program 1 times [2018-02-02 10:21:23,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:23,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:21:24,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:21:24,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:21:24,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-02-02 10:21:24,042 INFO L182 omatonBuilderFactory]: Interpolants [10853#true, 10854#false, 10855#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 10856#(and (= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 10857#(and (<= 0 (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 10858#(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)))), 10859#(and (<= (+ |entry_point_#t~mem18.offset| 4) (select |#length| |entry_point_#t~mem18.base|)) (<= 0 |entry_point_#t~mem18.offset|))] [2018-02-02 10:21:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 10:21:24,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:21:24,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:21:24,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:21:24,042 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 7 states. [2018-02-02 10:21:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:24,130 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-02-02 10:21:24,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:21:24,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-02-02 10:21:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:24,131 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:21:24,131 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:21:24,131 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:21:24,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:21:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-02 10:21:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-02 10:21:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-02-02 10:21:24,133 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 63 [2018-02-02 10:21:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:24,134 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-02-02 10:21:24,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:21:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-02-02 10:21:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:21:24,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:24,134 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] [2018-02-02 10:21:24,134 INFO L371 AbstractCegarLoop]: === Iteration 50 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1822987547, now seen corresponding path program 1 times [2018-02-02 10:21:24,135 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:24,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:24,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:24,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:21:24,675 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:24,676 INFO L182 omatonBuilderFactory]: Interpolants [11032#true, 11033#false, 11034#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 11035#(= (select |#valid| |ldv_malloc_#res.base|) 1), 11036#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 11037#(= (select |#valid| entry_point_~a10~0.base) 1), 11038#(= |#valid| |old(#valid)|), 11039#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 11040#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11041#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 11042#(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)), 11043#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 11044#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 11045#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11046#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 11047#(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))))), 11048#(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)))) (= (select |#valid| entry_point_~a10~0.base) 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))))), 11049#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11050#(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|)), 11051#(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 |#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)|)), 11052#(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)|) (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (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|))), 11053#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 11054#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 11055#(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 (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (not (= 0 |alloc_10_#t~ret4.base|)) (= 0 (select |old(#valid)| |alloc_10_#t~ret4.base|)) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |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|))), 11056#(or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.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 |#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|))))) (not (= 0 (select (select |#memory_$Pointer$.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 |#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|)))))) (= (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|))), 11057#(and (not (= 0 (select (select |#memory_$Pointer$.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))) (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| (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 (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)))))), 11058#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 11059#(and (= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= 1 (select |#valid| |free_10_#in~a.base|))), 11060#(and (= |free_10_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= 1 (select |#valid| |free_10_#in~a.base|)) (= |free_10_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 11061#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) |free_10_#in~a.base|) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) |free_10_#t~mem8.base|) (= 1 (select (store |#valid| |free_10_#t~mem8.base| 0) |free_10_#in~a.base|)))), 11062#(or (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) |free_10_#in~a.base|) (= 1 (select |#valid| |free_10_#in~a.base|)))] [2018-02-02 10:21:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:24,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:21:24,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:21:24,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:21:24,677 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 31 states. [2018-02-02 10:21:25,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:25,638 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-02-02 10:21:25,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:21:25,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 64 [2018-02-02 10:21:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:25,639 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:21:25,639 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:21:25,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=2147, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 10:21:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:21:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 81. [2018-02-02 10:21:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:21:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-02-02 10:21:25,641 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 64 [2018-02-02 10:21:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:25,641 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-02-02 10:21:25,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:21:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-02-02 10:21:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:21:25,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:25,642 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, 1] [2018-02-02 10:21:25,642 INFO L371 AbstractCegarLoop]: === Iteration 51 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash -612699104, now seen corresponding path program 1 times [2018-02-02 10:21:25,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:25,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:26,081 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-02 10:21:26,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:26,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 10:21:26,082 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:26,082 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-02 10:21:26,082 INFO L182 omatonBuilderFactory]: Interpolants [11275#true, 11276#false, 11277#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 11278#(= (select |#valid| |ldv_malloc_#res.base|) 1), 11279#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 11280#(= (select |#valid| entry_point_~a10~0.base) 1), 11281#(= |#valid| |old(#valid)|), 11282#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 11283#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11284#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 11285#(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)), 11286#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 11287#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 11288#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 11289#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 |entry_point_#t~ret14.offset|) (= |entry_point_#t~mem13.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~ret14.base|))), 11290#(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))))), 11291#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11292#(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)|)), 11293#(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)|)), 11294#(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 |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 |#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|))) (not (= |alloc_10_#t~mem3.base| |alloc_10_#in~a.base|)))), 11295#(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|))), 11296#(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|))), 11297#(= 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))), 11298#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 11299#(= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)), 11300#(= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~mem18.base|) |entry_point_#t~mem18.offset|)), 11301#(= 0 |entry_point_#t~mem19.offset|)] [2018-02-02 10:21:26,082 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-02 10:21:26,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 10:21:26,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 10:21:26,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2018-02-02 10:21:26,083 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 27 states. [2018-02-02 10:21:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:26,817 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-02-02 10:21:26,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:21:26,817 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-02-02 10:21:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:26,818 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:21:26,818 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:21:26,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=2222, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:21:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:21:26,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-02 10:21:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:21:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-02 10:21:26,819 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 64 [2018-02-02 10:21:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:26,820 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-02 10:21:26,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 10:21:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-02 10:21:26,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 10:21:26,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:26,820 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, 1] [2018-02-02 10:21:26,820 INFO L371 AbstractCegarLoop]: === Iteration 52 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:26,821 INFO L82 PathProgramCache]: Analyzing trace with hash -612699103, now seen corresponding path program 1 times [2018-02-02 10:21:26,821 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:26,828 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:27,511 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-02 10:21:27,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:27,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:21:27,512 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:27,512 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-02 10:21:27,512 INFO L182 omatonBuilderFactory]: Interpolants [11520#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 11521#(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)), 11522#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 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) (= |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))), 11523#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 11524#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 11525#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 |entry_point_#t~ret14.base|)) (not (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 11526#(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))))), 11527#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11528#(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|)), 11529#(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)|)), 11530#(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|))) (= |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 |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |alloc_10_#t~mem3.offset| (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|))) (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|))), 11531#(= 0 |ldv_malloc_#res.base|), 11532#(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 (= 0 |alloc_10_#t~ret4.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|)) (= |alloc_10_#t~mem3.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|)) (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 (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|) |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|)) (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|))) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |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|))), 11533#(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|))) (= 0 (select (select |#memory_$Pointer$.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 |#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|)))) (= (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|))), 11534#(not (= (select (select |#memory_$Pointer$.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))) (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 (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)))), 11535#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 11536#(and (= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 11537#(and (= |free_10_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 11538#(and (or (= 1 (select (store |#valid| |free_10_#t~mem8.base| 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))), 11539#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))))), 11540#(= 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)))), 11541#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_#t~mem18.base|) |entry_point_#t~mem18.offset|))), 11542#(= 1 (select |#valid| |entry_point_#t~mem19.base|)), 11511#true, 11512#false, 11513#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 11514#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 11515#(= 1 (select |#valid| |entry_point_#t~ret9.base|)), 11516#(= 1 (select |#valid| entry_point_~a10~0.base)), 11517#(= |#valid| |old(#valid)|), 11518#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 11519#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)))] [2018-02-02 10:21:27,512 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-02 10:21:27,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:21:27,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:21:27,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=925, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:21:27,513 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 32 states. [2018-02-02 10:21:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:28,723 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-02-02 10:21:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 10:21:28,724 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-02-02 10:21:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:28,724 INFO L225 Difference]: With dead ends: 92 [2018-02-02 10:21:28,724 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 10:21:28,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=3171, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 10:21:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 10:21:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2018-02-02 10:21:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:21:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2018-02-02 10:21:28,726 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 64 [2018-02-02 10:21:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:28,726 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2018-02-02 10:21:28,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:21:28,726 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2018-02-02 10:21:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 10:21:28,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:28,727 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-02 10:21:28,727 INFO L371 AbstractCegarLoop]: === Iteration 53 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:28,727 INFO L82 PathProgramCache]: Analyzing trace with hash 678039166, now seen corresponding path program 1 times [2018-02-02 10:21:28,727 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:28,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:29,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:29,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:21:29,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:29,239 INFO L182 omatonBuilderFactory]: Interpolants [11776#(= (select |#valid| entry_point_~a10~0.base) 1), 11777#(= |#valid| |old(#valid)|), 11778#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1)), 11779#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 11780#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= (select |#valid| |entry_point_#t~ret10.base|) 1)), 11781#(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)), 11782#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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) (= |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))), 11783#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 11784#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 11785#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 11786#(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)))) (= (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))))), 11787#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 11788#(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|)), 11789#(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 |#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)|)), 11790#(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)|) (= |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|))) (= |alloc_10_#t~mem3.offset| (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|))) (= (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|)) (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|))), 11791#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 11792#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 11793#(or (and (= |alloc_10_#t~mem3.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|)) (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 (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|) |alloc_10_#in~a.offset|))) (not (= 0 |alloc_10_#t~ret4.base|)) (= 0 (select |old(#valid)| |alloc_10_#t~ret4.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|)) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |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|))), 11794#(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 (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.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 |#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|))))) (not (= 0 (select (select |#memory_$Pointer$.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 |#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|))))) (= (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|))), 11795#(and (not (= 0 (select (select |#memory_$Pointer$.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))) (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 (= (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| (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 (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)))))), 11796#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 11797#(and (= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 11798#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 11799#(or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) |free_10_#t~mem8.base|) (= 1 (select (store |#valid| |free_10_#t~mem8.base| 0) (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 11800#(or (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 11801#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 11802#(= 1 (select |#valid| |entry_point_#t~mem18.base|)), 11771#true, 11772#false, 11773#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 11774#(= (select |#valid| |ldv_malloc_#res.base|) 1), 11775#(= (select |#valid| |entry_point_#t~ret9.base|) 1)] [2018-02-02 10:21:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-02 10:21:29,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:21:29,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:21:29,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:21:29,240 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 32 states. [2018-02-02 10:21:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:30,214 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-02-02 10:21:30,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:21:30,215 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2018-02-02 10:21:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:30,215 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:21:30,215 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:21:30,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=2442, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 10:21:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:21:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2018-02-02 10:21:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:21:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-02-02 10:21:30,217 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 65 [2018-02-02 10:21:30,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:30,217 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-02-02 10:21:30,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:21:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-02-02 10:21:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:21:30,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:30,218 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, 1] [2018-02-02 10:21:30,218 INFO L371 AbstractCegarLoop]: === Iteration 54 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash -455622273, now seen corresponding path program 1 times [2018-02-02 10:21:30,218 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:30,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:30,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:30,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 10:21:30,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:30,984 INFO L182 omatonBuilderFactory]: Interpolants [12032#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 12033#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12034#(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 (= (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|)) (= |alloc_10_#t~mem3.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|)) (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 (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|) |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|)) (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|))) (= 0 (select |old(#valid)| |alloc_10_#t~ret4.base|)) (= |alloc_10_#t~mem3.offset| (select (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 (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|) |alloc_10_#in~a.offset|))))), 12035#(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 (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.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 |#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|))))) (= (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|)))), 12036#(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)) (select (select |#memory_$Pointer$.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))) (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))))), 12037#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 12038#(and (= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 12039#(and (= |free_10_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 12040#(and (or (= 1 (select (store |#valid| |free_10_#t~mem8.base| 0) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))), 12041#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))), 12042#(= 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)))), 12043#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |entry_point_#t~mem18.base|) |entry_point_#t~mem18.offset|))), 12044#(= 1 (select |#valid| |entry_point_#t~mem19.base|)), 12014#true, 12015#false, 12016#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 12017#(= (select |#valid| |ldv_malloc_#res.base|) 1), 12018#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 12019#(= (select |#valid| entry_point_~a10~0.base) 1), 12020#(= |#valid| |old(#valid)|), 12021#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|))), 12022#(and (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 12023#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 1 (select |#valid| |entry_point_#t~ret10.base|))), 12024#(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)), 12025#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 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) (= |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))), 12026#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~ret14.base|)) (= 1 (select |#valid| |entry_point_#t~ret14.base|)) (= |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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 12027#(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))))), 12028#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12029#(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|)), 12030#(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)|)), 12031#(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|))) (= |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 |old(#memory_$Pointer$.offset)| |alloc_10_#in~a.base|) (select |#memory_$Pointer$.offset| |alloc_10_#in~a.base|)) (= |alloc_10_#t~mem3.offset| (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|))) (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|)))] [2018-02-02 10:21:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 10:21:30,984 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 10:21:30,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 10:21:30,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2018-02-02 10:21:30,985 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 31 states. [2018-02-02 10:21:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:31,929 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-02-02 10:21:31,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 10:21:31,929 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-02-02 10:21:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:31,930 INFO L225 Difference]: With dead ends: 90 [2018-02-02 10:21:31,930 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:21:31,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=2254, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 10:21:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:21:31,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2018-02-02 10:21:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 10:21:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2018-02-02 10:21:31,932 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 66 [2018-02-02 10:21:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:31,932 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2018-02-02 10:21:31,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 10:21:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2018-02-02 10:21:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-02 10:21:31,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:31,933 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, 1, 1, 1] [2018-02-02 10:21:31,933 INFO L371 AbstractCegarLoop]: === Iteration 55 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash -393317374, now seen corresponding path program 1 times [2018-02-02 10:21:31,934 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:31,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:32,416 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-02 10:21:32,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:32,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 10:21:32,416 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:32,416 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-02 10:21:32,416 INFO L182 omatonBuilderFactory]: Interpolants [12236#true, 12237#false, 12238#(and (= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1) (= |ldv_malloc_#t~malloc1.offset| 0)), 12239#(and (= (select |#valid| |ldv_malloc_#res.base|) 1) (= |ldv_malloc_#res.offset| 0)), 12240#(and (= (select |#valid| |entry_point_#t~ret9.base|) 1) (= 0 |entry_point_#t~ret9.offset|)), 12241#(and (= entry_point_~a10~0.offset 0) (= (select |#valid| entry_point_~a10~0.base) 1)), 12242#(= |#valid| |old(#valid)|), 12243#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|))), 12244#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|))), 12245#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= entry_point_~a10~0.offset 0) (not (= 0 |entry_point_#t~ret10.base|))), 12246#(and (not (= entry_point_~a10~0.base (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= entry_point_~a10~0.offset 0) (= (select |#valid| entry_point_~a10~0.base) 1) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) 0)))), 12247#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= entry_point_~a10~0.offset 0) (= (select |#valid| entry_point_~a10~0.base) 1) (= |entry_point_#t~mem13.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) 0))) (= |entry_point_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 12248#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 12249#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12250#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.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)) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) 0))) (= |entry_point_#t~mem13.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~ret14.base|))), 12251#(and (= entry_point_~a10~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) 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))))), 12252#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12253#(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|)), 12254#(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)|)), 12255#(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| |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|)))), 12256#(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 (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|))), 12257#(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 |#memory_$Pointer$.base| |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|))), 12258#(and (= entry_point_~a10~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) 0)))), 12259#(and (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|)), 12260#(and (= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 12261#(and (= |free_10_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 12262#(= |free_10_#t~mem8.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 12263#(or (= 0 (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)) |free_10_#in~a.base|))), 12264#(or (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)) (not (= (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)) (and (= entry_point_~a10~0.offset 0) (= 0 (select |#valid| (select (select |#memory_$Pointer$.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))) (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))))))), 12265#(and (= 1 (select |#valid| entry_point_~a10~0.base)) (or (not (= 0 (select (select |#memory_$Pointer$.offset| |entry_point_#t~mem18.base|) |entry_point_#t~mem18.offset|))) (not (= (select (select |#memory_$Pointer$.base| |entry_point_#t~mem18.base|) |entry_point_#t~mem18.offset|) entry_point_~a10~0.base)) (= 0 (select |#valid| |entry_point_#t~mem18.base|)))), 12266#(and (or (not (= 0 |entry_point_#t~mem19.offset|)) (not (= entry_point_~a10~0.base |entry_point_#t~mem19.base|))) (= 1 (select |#valid| entry_point_~a10~0.base))), 12267#(= 1 (select |#valid| entry_point_~a10~0.base))] [2018-02-02 10:21:32,417 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-02 10:21:32,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 10:21:32,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 10:21:32,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2018-02-02 10:21:32,417 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 32 states. [2018-02-02 10:21:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:33,467 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-02 10:21:33,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 10:21:33,468 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-02-02 10:21:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:33,468 INFO L225 Difference]: With dead ends: 67 [2018-02-02 10:21:33,468 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 10:21:33,468 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=3006, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 10:21:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 10:21:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-02 10:21:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 10:21:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-02-02 10:21:33,470 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 66 [2018-02-02 10:21:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:33,470 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-02-02 10:21:33,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 10:21:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-02-02 10:21:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:21:33,470 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:33,470 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, 1, 1, 1, 1] [2018-02-02 10:21:33,470 INFO L371 AbstractCegarLoop]: === Iteration 56 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:33,470 INFO L82 PathProgramCache]: Analyzing trace with hash 692063362, now seen corresponding path program 1 times [2018-02-02 10:21:33,471 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:33,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:33,752 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-02 10:21:33,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:33,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 10:21:33,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:33,752 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-02 10:21:33,752 INFO L182 omatonBuilderFactory]: Interpolants [12451#true, 12452#false, 12453#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 12454#(= (select |#valid| |ldv_malloc_#res.base|) 1), 12455#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 12456#(= (select |#valid| entry_point_~a10~0.base) 1), 12457#(= |#valid| |old(#valid)|), 12458#(and (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 12459#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 12460#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 12461#(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)), 12462#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= (select |#valid| entry_point_~a10~0.base) 1) (= |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))), 12463#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 12464#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12465#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= 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)) (= |entry_point_#t~mem13.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~ret14.base|))), 12466#(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))))), 12467#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12468#(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|)), 12469#(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)|)), 12470#(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|)))), 12471#(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|))), 12472#(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|))), 12473#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset)), 12474#(= free_10_~a.base |free_10_#in~a.base|), 12475#(= 0 |entry_point_#t~mem20.offset|)] [2018-02-02 10:21:33,753 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-02 10:21:33,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 10:21:33,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 10:21:33,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 10:21:33,753 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 25 states. [2018-02-02 10:21:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:34,349 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-02 10:21:34,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 10:21:34,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-02-02 10:21:34,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:34,349 INFO L225 Difference]: With dead ends: 66 [2018-02-02 10:21:34,350 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 10:21:34,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 10:21:34,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 10:21:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-02 10:21:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 10:21:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-02-02 10:21:34,351 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 67 [2018-02-02 10:21:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:34,351 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-02-02 10:21:34,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 10:21:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-02-02 10:21:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:21:34,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:34,352 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, 1, 1, 1, 1] [2018-02-02 10:21:34,352 INFO L371 AbstractCegarLoop]: === Iteration 57 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 692063363, now seen corresponding path program 1 times [2018-02-02 10:21:34,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:34,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:21:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:21:34,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:21:34,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-02-02 10:21:34,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:21:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:21:34,988 INFO L182 omatonBuilderFactory]: Interpolants [12672#(and (= |free_10_#t~mem6.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (= |#valid| |old(#valid)|) (= |free_10_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))), 12673#(and (= |#valid| |old(#valid)|) (= |free_10_#t~mem7.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (= |free_10_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))), 12674#(and (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) |free_10_#t~mem8.base|)), 12675#(or (and (= |#valid| |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))))) (= 0 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |free_10_#in~a.base|) |free_10_#in~a.offset|)) (select (select |#memory_$Pointer$.offset| |free_10_#in~a.base|) |free_10_#in~a.offset|)))))), 12676#(or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (not (= (select (select |#memory_$Pointer$.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))) (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 (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)) (and (= 0 (select |#valid| (select (select |#memory_$Pointer$.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))) (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 (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0))), 12677#(or (and (= |entry_point_#t~mem18.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (= 0 (select |#valid| (select (select |#memory_$Pointer$.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))) (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))))) (= |entry_point_#t~mem18.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)) (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (= |entry_point_#t~mem18.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (not (= (select (select |#memory_$Pointer$.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))) (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))) |entry_point_#t~mem18.base|)) (= |entry_point_#t~mem18.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))), 12678#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (or (= 1 (select (store |#valid| |entry_point_#t~mem19.base| 0) (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (and (not (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) |entry_point_#t~mem19.offset|)) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)))), 12679#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))), 12680#(= 1 (select |#valid| |entry_point_#t~mem20.base|)), 12646#true, 12647#false, 12648#(= (select |#valid| |ldv_malloc_#t~malloc1.base|) 1), 12649#(= (select |#valid| |ldv_malloc_#res.base|) 1), 12650#(= (select |#valid| |entry_point_#t~ret9.base|) 1), 12651#(= (select |#valid| entry_point_~a10~0.base) 1), 12652#(= |#valid| |old(#valid)|), 12653#(and (not (= 0 |ldv_malloc_#t~malloc1.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)) (= |ldv_malloc_#t~malloc1.offset| 0)), 12654#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= 0 |ldv_malloc_#res.base|)) (= |ldv_malloc_#res.offset| 0)), 12655#(and (not (= entry_point_~a10~0.base |entry_point_#t~ret10.base|)) (= |entry_point_#t~ret10.offset| 0) (not (= 0 |entry_point_#t~ret10.base|))), 12656#(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) (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)), 12657#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (= (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~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)) (= (select (select |#memory_$Pointer$.offset| entry_point_~a10~0.base) entry_point_~a10~0.offset) 0)), 12658#(= 0 (select |old(#valid)| |ldv_malloc_#t~malloc1.base|)), 12659#(= 0 (select |old(#valid)| |ldv_malloc_#res.base|)), 12660#(and (not (= entry_point_~a10~0.base |entry_point_#t~mem13.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| 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)) (= |entry_point_#t~mem13.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 (= entry_point_~a10~0.base |entry_point_#t~ret14.base|))), 12661#(and (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) (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))))), 12662#(and (= |entry_point_#t~mem16.base| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset)) (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) (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))))), 12663#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (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) (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))))), 12664#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 12665#(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|)), 12666#(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)|)), 12667#(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 |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|)))), 12668#(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|)) |alloc_10_#in~a.base|) (select |old(#memory_$Pointer$.base)| |alloc_10_#in~a.base|)))), 12669#(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 |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|)))), 12670#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~a10~0.base) entry_point_~a10~0.offset))) (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)), 12671#(and (= |#valid| |old(#valid)|) (= free_10_~a.base |free_10_#in~a.base|) (= free_10_~a.offset |free_10_#in~a.offset|))] [2018-02-02 10:21:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 10:21:34,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 10:21:34,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 10:21:34,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 10:21:34,989 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 35 states. [2018-02-02 10:21:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:21:35,873 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-02-02 10:21:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 10:21:35,873 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-02-02 10:21:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:21:35,874 INFO L225 Difference]: With dead ends: 72 [2018-02-02 10:21:35,874 INFO L226 Difference]: Without dead ends: 72 [2018-02-02 10:21:35,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=2824, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 10:21:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-02 10:21:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-02 10:21:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 10:21:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-02-02 10:21:35,876 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 67 [2018-02-02 10:21:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:21:35,876 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-02-02 10:21:35,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 10:21:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-02-02 10:21:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 10:21:35,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:21:35,877 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, 1, 1, 1, 1] [2018-02-02 10:21:35,877 INFO L371 AbstractCegarLoop]: === Iteration 58 === [free_10Err6RequiresViolation, free_10Err4RequiresViolation, free_10Err7RequiresViolation, free_10Err5RequiresViolation, free_10Err0RequiresViolation, free_10Err3RequiresViolation, free_10Err1RequiresViolation, free_10Err2RequiresViolation, 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-02 10:21:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1346446747, now seen corresponding path program 1 times [2018-02-02 10:21:35,878 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:21:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:21:35,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 10:21:35,919 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:21:35,922 INFO L168 Benchmark]: Toolchain (without parser) took 49221.08 ms. Allocated memory was 396.4 MB in the beginning and 1.1 GB in the end (delta: 699.4 MB). Free memory was 353.2 MB in the beginning and 645.4 MB in the end (delta: -292.2 MB). Peak memory consumption was 407.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:21:35,923 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 396.4 MB. Free memory is still 359.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:21:35,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.97 ms. Allocated memory is still 396.4 MB. Free memory was 353.2 MB in the beginning and 340.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:21:35,924 INFO L168 Benchmark]: Boogie Preprocessor took 28.39 ms. Allocated memory is still 396.4 MB. Free memory was 340.0 MB in the beginning and 338.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:21:35,924 INFO L168 Benchmark]: RCFGBuilder took 251.88 ms. Allocated memory is still 396.4 MB. Free memory was 338.7 MB in the beginning and 310.0 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:21:35,924 INFO L168 Benchmark]: TraceAbstraction took 48776.93 ms. Allocated memory was 396.4 MB in the beginning and 1.1 GB in the end (delta: 699.4 MB). Free memory was 310.0 MB in the beginning and 645.4 MB in the end (delta: -335.4 MB). Peak memory consumption was 364.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:21:35,926 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.18 ms. Allocated memory is still 396.4 MB. Free memory is still 359.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.97 ms. Allocated memory is still 396.4 MB. Free memory was 353.2 MB in the beginning and 340.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.39 ms. Allocated memory is still 396.4 MB. Free memory was 340.0 MB in the beginning and 338.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.88 ms. Allocated memory is still 396.4 MB. Free memory was 338.7 MB in the beginning and 310.0 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48776.93 ms. Allocated memory was 396.4 MB in the beginning and 1.1 GB in the end (delta: 699.4 MB). Free memory was 310.0 MB in the beginning and 645.4 MB in the end (delta: -335.4 MB). Peak memory consumption was 364.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test10_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-21-35-932.csv Completed graceful shutdown