java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:19:05,319 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:19:05,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:19:05,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:19:05,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:19:05,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:19:05,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:19:05,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:19:05,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:19:05,335 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:19:05,336 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:19:05,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:19:05,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:19:05,337 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:19:05,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:19:05,340 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:19:05,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:19:05,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:19:05,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:19:05,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:19:05,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:19:05,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:19:05,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:19:05,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:19:05,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:19:05,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:19:05,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:19:05,350 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:19:05,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:19:05,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:19:05,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:19:05,351 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:19:05,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:19:05,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:19:05,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:19:05,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:19:05,362 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:19:05,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:19:05,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:19:05,362 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:19:05,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:19:05,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:19:05,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:19:05,363 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:19:05,363 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:19:05,363 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:19:05,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:19:05,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:19:05,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:19:05,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:19:05,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:19:05,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:19:05,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:19:05,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:19:05,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:19:05,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:19:05,404 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:19:05,407 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:19:05,408 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:19:05,409 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:19:05,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-02-02 20:19:05,546 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:19:05,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:19:05,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:19:05,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:19:05,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:19:05,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe43571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05, skipping insertion in model container [2018-02-02 20:19:05,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,570 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:19:05,599 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:19:05,689 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:19:05,700 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:19:05,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05 WrapperNode [2018-02-02 20:19:05,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:19:05,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:19:05,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:19:05,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:19:05,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... [2018-02-02 20:19:05,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:19:05,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:19:05,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:19:05,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:19:05,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:19:05,768 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:19:05,768 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:19:05,768 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-02 20:19:05,769 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-02 20:19:05,769 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:19:05,769 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:19:05,770 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:19:05,770 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-02 20:19:05,770 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-02 20:19:05,770 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:19:05,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:19:05,770 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:19:05,953 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:19:05,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:19:05 BoogieIcfgContainer [2018-02-02 20:19:05,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:19:05,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:19:05,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:19:05,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:19:05,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:19:05" (1/3) ... [2018-02-02 20:19:05,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e195a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:19:05, skipping insertion in model container [2018-02-02 20:19:05,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:19:05" (2/3) ... [2018-02-02 20:19:05,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e195a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:19:05, skipping insertion in model container [2018-02-02 20:19:05,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:19:05" (3/3) ... [2018-02-02 20:19:05,959 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-02-02 20:19:05,965 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:19:05,969 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-02-02 20:19:05,998 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:19:05,999 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:19:05,999 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:19:05,999 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:19:05,999 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:19:05,999 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:19:05,999 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:19:05,999 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:19:06,000 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:19:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-02-02 20:19:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:19:06,019 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:06,020 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:06,020 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130535, now seen corresponding path program 1 times [2018-02-02 20:19:06,062 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:06,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:06,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:19:06,203 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,203 INFO L182 omatonBuilderFactory]: Interpolants [74#true, 75#false, 76#(= (select |#valid| |main_~#data~0.base|) 1), 77#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 78#(= 1 (select |#valid| alloc_data_~pdata.base))] [2018-02-02 20:19:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:19:06,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:19:06,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:06,214 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-02-02 20:19:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:06,436 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-02 20:19:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:06,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 20:19:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:06,444 INFO L225 Difference]: With dead ends: 67 [2018-02-02 20:19:06,445 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 20:19:06,446 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:19:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 20:19:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-02 20:19:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 20:19:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-02 20:19:06,476 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 10 [2018-02-02 20:19:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:06,476 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-02 20:19:06,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:19:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-02 20:19:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:19:06,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:06,477 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:06,477 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:06,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130536, now seen corresponding path program 1 times [2018-02-02 20:19:06,478 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:06,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:06,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:19:06,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,562 INFO L182 omatonBuilderFactory]: Interpolants [212#true, 213#false, 214#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1) (= 8 (select |#length| |main_~#data~0.base|))), 215#(and (= 0 |alloc_data_#in~pdata.offset|) (= 8 (select |#length| |alloc_data_#in~pdata.base|)) (= (select |#valid| |alloc_data_#in~pdata.base|) 1)), 216#(and (= (select |#valid| alloc_data_~pdata.base) 1) (= 8 (select |#length| alloc_data_~pdata.base)) (= alloc_data_~pdata.offset 0)), 217#(and (= (select |#length| alloc_data_~pdata.base) 8) (= alloc_data_~pdata.offset 0))] [2018-02-02 20:19:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:19:06,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:19:06,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:19:06,564 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-02-02 20:19:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:06,742 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-02-02 20:19:06,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:19:06,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-02 20:19:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:06,743 INFO L225 Difference]: With dead ends: 60 [2018-02-02 20:19:06,744 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 20:19:06,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:19:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 20:19:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-02 20:19:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 20:19:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-02 20:19:06,749 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 10 [2018-02-02 20:19:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:06,749 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-02 20:19:06,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:19:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-02 20:19:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:19:06,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:06,750 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:06,750 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947157, now seen corresponding path program 1 times [2018-02-02 20:19:06,751 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:06,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,823 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:06,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:19:06,823 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,824 INFO L182 omatonBuilderFactory]: Interpolants [340#true, 341#false, 342#(= 1 (select |#valid| |alloc_data_#t~malloc0.base|)), 343#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 344#(= 1 (select |#valid| |alloc_data_#t~mem4.base|))] [2018-02-02 20:19:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:06,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:19:06,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:19:06,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:19:06,825 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-02-02 20:19:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:06,910 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-02-02 20:19:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:19:06,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:19:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:06,911 INFO L225 Difference]: With dead ends: 59 [2018-02-02 20:19:06,911 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 20:19:06,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 20:19:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 20:19:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 20:19:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-02 20:19:06,916 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 14 [2018-02-02 20:19:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:06,916 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-02 20:19:06,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:19:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-02 20:19:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:19:06,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:06,917 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:06,917 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947156, now seen corresponding path program 1 times [2018-02-02 20:19:06,918 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:06,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:07,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:19:07,010 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,011 INFO L182 omatonBuilderFactory]: Interpolants [469#true, 470#false, 471#(and (= (select |#valid| |alloc_data_#t~malloc0.base|) 1) (= 4 (select |#length| |alloc_data_#t~malloc0.base|)) (= 0 |alloc_data_#t~malloc0.offset|)), 472#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 1)), 473#(and (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.offset|) alloc_data_~pdata.offset)) (= 4 (select |#length| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset)))), 474#(and (= |alloc_data_#t~mem4.offset| 0) (= (select |#length| |alloc_data_#t~mem4.base|) 4))] [2018-02-02 20:19:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:19:07,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:19:07,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:19:07,012 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 6 states. [2018-02-02 20:19:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:07,127 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-02-02 20:19:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:19:07,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-02 20:19:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:07,128 INFO L225 Difference]: With dead ends: 58 [2018-02-02 20:19:07,128 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 20:19:07,128 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 20:19:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-02-02 20:19:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 20:19:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-02-02 20:19:07,131 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 14 [2018-02-02 20:19:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:07,131 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-02-02 20:19:07,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:19:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-02-02 20:19:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:19:07,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:07,131 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:07,131 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:07,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006569, now seen corresponding path program 1 times [2018-02-02 20:19:07,132 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:07,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:07,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:19:07,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,237 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| |alloc_data_#t~mem6.base|)), 597#true, 598#false, 599#(= (select |#valid| |main_~#data~0.base|) 1), 600#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 601#(= (select |#valid| alloc_data_~pdata.base) 1), 602#(not (= alloc_data_~pdata.base |alloc_data_#t~malloc0.base|)), 603#(not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 604#(and (not (= alloc_data_~pdata.base (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= 1 (select |#valid| |alloc_data_#t~malloc2.base|))), 605#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 606#(and (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))), 607#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))] [2018-02-02 20:19:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:19:07,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:19:07,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:07,237 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-02-02 20:19:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:07,488 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-02 20:19:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:19:07,488 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 20:19:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:07,489 INFO L225 Difference]: With dead ends: 57 [2018-02-02 20:19:07,489 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 20:19:07,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 20:19:07,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 20:19:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 20:19:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-02-02 20:19:07,493 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 17 [2018-02-02 20:19:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:07,493 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-02-02 20:19:07,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:19:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-02-02 20:19:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:19:07,494 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:07,494 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:07,494 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006570, now seen corresponding path program 1 times [2018-02-02 20:19:07,495 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:07,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:07,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:19:07,638 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,639 INFO L182 omatonBuilderFactory]: Interpolants [739#true, 740#false, 741#(= (select |#valid| |main_~#data~0.base|) 1), 742#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 743#(= (select |#valid| alloc_data_~pdata.base) 1), 744#(not (= alloc_data_~pdata.base |alloc_data_#t~malloc0.base|)), 745#(not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))), 746#(and (= 4 (select |#length| |alloc_data_#t~malloc2.base|)) (not (= alloc_data_~pdata.base (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= 0 |alloc_data_#t~malloc2.offset|)), 747#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 748#(and (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))), 749#(and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))), 750#(and (= |alloc_data_#t~mem6.offset| 0) (= (select |#length| |alloc_data_#t~mem6.base|) 4))] [2018-02-02 20:19:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:19:07,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:19:07,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:19:07,640 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2018-02-02 20:19:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:07,854 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-02-02 20:19:07,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:19:07,854 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-02 20:19:07,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:07,855 INFO L225 Difference]: With dead ends: 56 [2018-02-02 20:19:07,855 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 20:19:07,855 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:19:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 20:19:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 20:19:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 20:19:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-02-02 20:19:07,858 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 17 [2018-02-02 20:19:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:07,859 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-02-02 20:19:07,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:19:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-02-02 20:19:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:19:07,860 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:07,860 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:07,860 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658956, now seen corresponding path program 1 times [2018-02-02 20:19:07,861 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:07,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:07,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:19:07,911 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,912 INFO L182 omatonBuilderFactory]: Interpolants [880#false, 881#(= alloc_data_~pdata.base |alloc_data_#in~pdata.base|), 882#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1)), 883#(= 1 (select |#valid| |alloc_data_#in~pdata.base|)), 884#(= 1 (select |#valid| |main_~#data~0.base|)), 885#(= 1 (select |#valid| |free_data_#in~data.base|)), 886#(= 1 (select |#valid| free_data_~data.base)), 879#true] [2018-02-02 20:19:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:07,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:19:07,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:19:07,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:19:07,912 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 8 states. [2018-02-02 20:19:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:08,032 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-02-02 20:19:08,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:19:08,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 20:19:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:08,033 INFO L225 Difference]: With dead ends: 61 [2018-02-02 20:19:08,033 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 20:19:08,033 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 20:19:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-02-02 20:19:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 20:19:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-02-02 20:19:08,037 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 23 [2018-02-02 20:19:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:08,037 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-02-02 20:19:08,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:19:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-02-02 20:19:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:19:08,038 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:08,038 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:08,038 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:08,038 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658957, now seen corresponding path program 1 times [2018-02-02 20:19:08,039 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:08,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:08,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:08,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 20:19:08,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:08,124 INFO L182 omatonBuilderFactory]: Interpolants [1008#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (<= (+ alloc_data_~pdata.offset 8) (select |#length| alloc_data_~pdata.base))) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1009#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (<= 8 (select |#length| |alloc_data_#in~pdata.base|))), 1010#(and (= 0 |main_~#data~0.offset|) (<= 8 (select |#length| |main_~#data~0.base|))), 1011#(and (<= 8 (select |#length| |free_data_#in~data.base|)) (= 0 |free_data_#in~data.offset|)), 1012#(and (= free_data_~data.offset 0) (<= 8 (select |#length| free_data_~data.base))), 1004#true, 1005#false, 1006#(= 0 |main_~#data~0.offset|), 1007#(and (or (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)))] [2018-02-02 20:19:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:08,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:19:08,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:19:08,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:19:08,125 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 9 states. [2018-02-02 20:19:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:08,195 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-02-02 20:19:08,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:19:08,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-02-02 20:19:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:08,196 INFO L225 Difference]: With dead ends: 50 [2018-02-02 20:19:08,196 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 20:19:08,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:19:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 20:19:08,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 20:19:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 20:19:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-02-02 20:19:08,199 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 23 [2018-02-02 20:19:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:08,199 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-02-02 20:19:08,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:19:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-02-02 20:19:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:19:08,199 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:08,199 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:08,199 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479601, now seen corresponding path program 1 times [2018-02-02 20:19:08,200 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:08,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:08,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:08,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:19:08,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:08,560 INFO L182 omatonBuilderFactory]: Interpolants [1120#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 |alloc_data_#t~malloc0.offset|)), 1121#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1122#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= 0 (select (store (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.offset|) alloc_data_~pdata.offset)) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1123#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))), 1124#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= |alloc_data_#t~mem4.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|)) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1125#(or (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|)) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1126#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1127#(or (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1128#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|)))), 1129#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_data_#in~data.base|) |free_data_#in~data.offset|)) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|)))), 1130#(and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))) (= 0 (select (select |#memory_$Pointer$.offset| free_data_~data.base) free_data_~data.offset))), 1131#(and (= |free_data_#t~mem8.base| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)) (= 0 |free_data_#t~mem8.offset|) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)))), 1132#(and (= free_data_~lo~0.offset 0) (<= 4 (select |#length| free_data_~lo~0.base))), 1115#true, 1116#false, 1117#(= (select |#valid| |main_~#data~0.base|) 1), 1118#(= |#valid| |old(#valid)|), 1119#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|))] [2018-02-02 20:19:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:08,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:19:08,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:19:08,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:19:08,561 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-02-02 20:19:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:09,062 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-02-02 20:19:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:09,062 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-02 20:19:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:09,064 INFO L225 Difference]: With dead ends: 51 [2018-02-02 20:19:09,065 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 20:19:09,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:19:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 20:19:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-02-02 20:19:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 20:19:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-02 20:19:09,068 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2018-02-02 20:19:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:09,069 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-02 20:19:09,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:19:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-02 20:19:09,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 20:19:09,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:09,070 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:09,070 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:09,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479602, now seen corresponding path program 1 times [2018-02-02 20:19:09,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:09,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:09,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:09,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:19:09,297 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:09,298 INFO L182 omatonBuilderFactory]: Interpolants [1258#true, 1259#false, 1260#(= (select |#valid| |main_~#data~0.base|) 1), 1261#(= |#valid| |old(#valid)|), 1262#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1263#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1264#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1265#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1266#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))), 1267#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |alloc_data_#t~mem4.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1268#(or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1269#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1270#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1271#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))), 1272#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))), 1273#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))), 1274#(= 1 (select |#valid| |free_data_#t~mem8.base|)), 1275#(= 1 (select |#valid| free_data_~lo~0.base))] [2018-02-02 20:19:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:09,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:19:09,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:19:09,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:19:09,299 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-02-02 20:19:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:09,709 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-02 20:19:09,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 20:19:09,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-02-02 20:19:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:09,710 INFO L225 Difference]: With dead ends: 49 [2018-02-02 20:19:09,711 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 20:19:09,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-02 20:19:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 20:19:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-02 20:19:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 20:19:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-02 20:19:09,714 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2018-02-02 20:19:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:09,714 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-02 20:19:09,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:19:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-02 20:19:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:19:09,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:09,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:09,715 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:09,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674501, now seen corresponding path program 1 times [2018-02-02 20:19:09,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:09,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:10,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:10,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:19:10,001 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:10,001 INFO L182 omatonBuilderFactory]: Interpolants [1408#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4))) (= 0 |main_~#data~0.offset|)), 1409#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (= 0 |free_data_#in~data.offset|)), 1410#(and (= free_data_~data.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1411#(= 1 (select |#valid| |free_data_#t~mem9.base|)), 1412#(= 1 (select |#valid| free_data_~hi~0.base)), 1395#true, 1396#false, 1397#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1398#(= |#valid| |old(#valid)|), 1399#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1400#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1401#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (or (= (select |#valid| alloc_data_~pdata.base) 1) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1402#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (and (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|)) (= 1 (select |#valid| |alloc_data_#t~malloc2.base|))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1403#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))), 1404#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset)))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1405#(or (and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4))))) (not (= 0 alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1406#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1407#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))] [2018-02-02 20:19:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:10,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:19:10,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:19:10,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:19:10,002 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2018-02-02 20:19:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:10,508 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-02 20:19:10,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:10,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-02 20:19:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:10,510 INFO L225 Difference]: With dead ends: 48 [2018-02-02 20:19:10,510 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 20:19:10,510 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-02-02 20:19:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 20:19:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-02-02 20:19:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 20:19:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-02 20:19:10,512 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 28 [2018-02-02 20:19:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:10,512 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-02 20:19:10,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:19:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-02 20:19:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:19:10,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:10,512 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:10,512 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:10,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674502, now seen corresponding path program 1 times [2018-02-02 20:19:10,513 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:10,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:10,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:10,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 20:19:10,847 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:10,847 INFO L182 omatonBuilderFactory]: Interpolants [1536#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1537#(= |#valid| |old(#valid)|), 1538#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1539#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1540#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1541#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (and (= 4 (select |#length| |alloc_data_#t~malloc2.base|)) (= 0 |alloc_data_#t~malloc2.offset|)) (not (= alloc_data_~pdata.offset 0))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1542#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)) (or (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0)))), 1543#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)) (or (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0))))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1544#(or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)) (or (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1545#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (or (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1546#(or (and (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1547#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) 4)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4))) (= 0 |main_~#data~0.offset|)), 1548#(and (= 0 (select (select |#memory_$Pointer$.offset| |free_data_#in~data.base|) 4)) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (= 0 |free_data_#in~data.offset|)), 1549#(and (= 0 (select (select |#memory_$Pointer$.offset| free_data_~data.base) (+ free_data_~data.offset 4))) (= free_data_~data.offset 0) (= 4 (select |#length| (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1550#(and (= 4 (select |#length| |free_data_#t~mem9.base|)) (= 0 |free_data_#t~mem9.offset|)), 1551#(and (= free_data_~hi~0.offset 0) (= 4 (select |#length| free_data_~hi~0.base))), 1534#true, 1535#false] [2018-02-02 20:19:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:10,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 20:19:10,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 20:19:10,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:19:10,848 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 18 states. [2018-02-02 20:19:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:11,382 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-02 20:19:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:19:11,382 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-02-02 20:19:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:11,383 INFO L225 Difference]: With dead ends: 46 [2018-02-02 20:19:11,383 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 20:19:11,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:19:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 20:19:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 20:19:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 20:19:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-02-02 20:19:11,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 28 [2018-02-02 20:19:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:11,386 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-02-02 20:19:11,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 20:19:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-02-02 20:19:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 20:19:11,387 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:11,387 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:11,387 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash -38443497, now seen corresponding path program 1 times [2018-02-02 20:19:11,388 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:11,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:11,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:11,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 20:19:11,936 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:11,937 INFO L182 omatonBuilderFactory]: Interpolants [1667#true, 1668#false, 1669#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1670#(= |#valid| |old(#valid)|), 1671#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1672#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (not (= alloc_data_~pdata.offset 0)) (= 1 (select |#valid| |alloc_data_#t~malloc0.base|)))), 1673#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (not (= alloc_data_~pdata.offset 0)))), 1674#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (or (not (= (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset) |alloc_data_#t~malloc2.base|)) (not (= alloc_data_~pdata.offset 0))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1675#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (or (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 1676#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0)))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1677#(or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (not (= (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= alloc_data_~pdata.offset 0))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1678#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (or (not (= (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1679#(or (not (= (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) (not (= 0 |alloc_data_#in~pdata.offset|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1680#(and (= 0 |main_~#data~0.offset|) (not (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4)))), 1681#(and (not (= (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|) (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (= 0 |free_data_#in~data.offset|)), 1682#(and (= free_data_~data.offset 0) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset) (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1683#(and (= |free_data_#t~mem8.base| (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)) (= free_data_~data.offset 0) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset) (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1684#(and (= free_data_~data.offset 0) (= free_data_~lo~0.base (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset)) (not (= (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset) (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4))))), 1685#(not (= free_data_~lo~0.base |free_data_#t~mem9.base|)), 1686#(not (= free_data_~hi~0.base free_data_~lo~0.base)), 1687#(and (not (= free_data_~hi~0.base free_data_~lo~0.base)) (= 1 (select |#valid| free_data_~hi~0.base))), 1688#(= 1 (select |#valid| free_data_~hi~0.base))] [2018-02-02 20:19:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:11,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:19:11,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:19:11,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:19:11,938 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-02-02 20:19:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:12,614 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-02 20:19:12,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:19:12,615 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-02-02 20:19:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:12,615 INFO L225 Difference]: With dead ends: 45 [2018-02-02 20:19:12,615 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 20:19:12,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:19:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 20:19:12,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-02 20:19:12,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 20:19:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-02 20:19:12,617 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-02-02 20:19:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:12,617 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-02 20:19:12,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:19:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-02 20:19:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:19:12,618 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:12,618 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:12,618 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1191748404, now seen corresponding path program 1 times [2018-02-02 20:19:12,619 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:19:12,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:19:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:13,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:19:13,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 20:19:13,053 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:19:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:13,053 INFO L182 omatonBuilderFactory]: Interpolants [1824#(and (not (= |free_data_#in~data.base| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) 4))) (not (= |free_data_#in~data.base| (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |free_data_#in~data.base|) |free_data_#in~data.offset|))) (= 0 |free_data_#in~data.offset|)), 1825#(and (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| free_data_~data.base) free_data_~data.offset))) (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)))) (= free_data_~data.offset 0)), 1826#(and (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)))) (= free_data_~data.offset 0) (= 1 (select |#valid| free_data_~data.base)) (not (= free_data_~data.base |free_data_#t~mem8.base|)) (not (= 0 |free_data_#t~mem8.base|))), 1827#(and (not (= free_data_~data.base free_data_~lo~0.base)) (not (= free_data_~data.base (select (select |#memory_$Pointer$.base| free_data_~data.base) (+ free_data_~data.offset 4)))) (= free_data_~data.offset 0) (= 1 (select |#valid| free_data_~data.base)) (not (= 0 free_data_~lo~0.base))), 1828#(and (not (= free_data_~data.base |free_data_#t~mem9.base|)) (not (= free_data_~data.base free_data_~lo~0.base)) (= 1 (select |#valid| free_data_~data.base)) (not (= 0 free_data_~lo~0.base))), 1829#(and (not (= free_data_~data.base free_data_~lo~0.base)) (= 1 (select |#valid| free_data_~data.base)) (not (= free_data_~data.base free_data_~hi~0.base)) (not (= 0 free_data_~lo~0.base))), 1830#(= 1 (select (store |#valid| free_data_~hi~0.base 0) free_data_~data.base)), 1831#(= 1 (select |#valid| free_data_~data.base)), 1810#true, 1811#false, 1812#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1)), 1813#(= |#valid| |old(#valid)|), 1814#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 1815#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= 0 |alloc_data_#t~malloc0.base|))), 1816#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 1817#(and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))), 1818#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))), 1819#(and (or (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))))) (or (not (= alloc_data_~pdata.base |alloc_data_#t~mem4.base|)) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|)))), 1820#(or (and (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) |alloc_data_#in~pdata.offset|))) (not (= alloc_data_~pdata.base (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4)))) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 alloc_data_~pdata.offset))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1821#(or (and (not (= |alloc_data_#t~mem6.base| |alloc_data_#in~pdata.base|)) (or (not (= 0 |alloc_data_#in~pdata.offset|)) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)))) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1822#(or (and (or (not (= 0 |alloc_data_#in~pdata.offset|)) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4)))) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)))) (= 0 (select |old(#valid)| |alloc_data_#in~pdata.base|))), 1823#(and (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) 4))) (= 0 |main_~#data~0.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))) (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))))] [2018-02-02 20:19:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:19:13,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 20:19:13,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 20:19:13,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 20:19:13,054 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-02-02 20:19:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:19:13,650 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-02 20:19:13,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:19:13,650 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-02-02 20:19:13,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:19:13,651 INFO L225 Difference]: With dead ends: 44 [2018-02-02 20:19:13,651 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 20:19:13,651 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 20:19:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 20:19:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-02 20:19:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 20:19:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-02 20:19:13,652 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2018-02-02 20:19:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:19:13,652 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-02 20:19:13,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 20:19:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-02 20:19:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-02 20:19:13,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:19:13,653 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:19:13,653 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-02 20:19:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash -718496508, now seen corresponding path program 1 times [2018-02-02 20:19:13,654 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:19:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:19:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 20:19:13,693 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 20:19:13,705 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 20:19:13,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:19:13 BoogieIcfgContainer [2018-02-02 20:19:13,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:19:13,725 INFO L168 Benchmark]: Toolchain (without parser) took 8178.86 ms. Allocated memory was 387.4 MB in the beginning and 751.3 MB in the end (delta: 363.9 MB). Free memory was 344.3 MB in the beginning and 502.6 MB in the end (delta: -158.3 MB). Peak memory consumption was 205.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:13,726 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 387.4 MB. Free memory is still 350.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:19:13,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.46 ms. Allocated memory is still 387.4 MB. Free memory was 344.3 MB in the beginning and 333.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:13,726 INFO L168 Benchmark]: Boogie Preprocessor took 24.48 ms. Allocated memory is still 387.4 MB. Free memory was 333.6 MB in the beginning and 332.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:13,726 INFO L168 Benchmark]: RCFGBuilder took 224.56 ms. Allocated memory is still 387.4 MB. Free memory was 332.3 MB in the beginning and 309.0 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:13,726 INFO L168 Benchmark]: TraceAbstraction took 7769.40 ms. Allocated memory was 387.4 MB in the beginning and 751.3 MB in the end (delta: 363.9 MB). Free memory was 309.0 MB in the beginning and 502.6 MB in the end (delta: -193.6 MB). Peak memory consumption was 170.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:19:13,727 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 387.4 MB. Free memory is still 350.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.46 ms. Allocated memory is still 387.4 MB. Free memory was 344.3 MB in the beginning and 333.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.48 ms. Allocated memory is still 387.4 MB. Free memory was 333.6 MB in the beginning and 332.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 224.56 ms. Allocated memory is still 387.4 MB. Free memory was 332.3 MB in the beginning and 309.0 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7769.40 ms. Allocated memory was 387.4 MB in the beginning and 751.3 MB in the end (delta: 363.9 MB). Free memory was 309.0 MB in the beginning and 502.6 MB in the end (delta: -193.6 MB). Peak memory consumption was 170.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] FCALL TData data; VAL [data={17:0}] [L643] CALL alloc_data(&data) VAL [pdata={17:0}] [L625] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L625] FCALL pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] FCALL pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L627] EXPR, FCALL pdata->lo VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L627] FCALL *(pdata->lo) = 4 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L628] EXPR, FCALL pdata->hi VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L628] RET, FCALL *(pdata->hi) = 8 VAL [malloc(sizeof(int))={14:0}, malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L643] alloc_data(&data) VAL [data={17:0}] [L644] CALL free_data(&data) VAL [data={17:0}] [L632] EXPR, FCALL data->lo VAL [data={17:0}, data={17:0}, data->lo={12:0}] [L632] int *lo = data->lo; [L633] EXPR, FCALL data->hi VAL [data={17:0}, data={17:0}, data->hi={14:0}, lo={12:0}] [L633] int *hi = data->hi; [L634] EXPR, FCALL \read(*lo) VAL [\read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] EXPR, FCALL \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] COND FALSE !(*lo >= *hi) [L638] FCALL data->lo = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L639] RET, FCALL data->hi = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L644] free_data(&data) VAL [data={17:0}] [L645] return 0; VAL [\result=0, data={17:0}] [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 71 locations, 29 error locations. UNSAFE Result, 7.7s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 592 SDslu, 2201 SDs, 0 SdLazy, 3624 SolverSat, 266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 100248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-19-13-732.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-19-13-732.csv Received shutdown request...