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_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 21:06:35,493 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 21:06:35,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 21:06:35,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 21:06:35,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 21:06:35,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 21:06:35,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 21:06:35,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 21:06:35,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 21:06:35,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 21:06:35,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 21:06:35,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 21:06:35,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 21:06:35,517 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 21:06:35,518 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 21:06:35,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 21:06:35,522 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 21:06:35,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 21:06:35,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 21:06:35,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 21:06:35,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 21:06:35,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 21:06:35,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 21:06:35,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 21:06:35,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 21:06:35,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 21:06:35,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 21:06:35,532 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 21:06:35,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 21:06:35,532 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 21:06:35,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 21:06:35,533 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_NoArray.epf [2018-02-02 21:06:35,544 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 21:06:35,544 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 21:06:35,545 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 21:06:35,545 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 21:06:35,545 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 21:06:35,545 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 21:06:35,546 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 21:06:35,547 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 21:06:35,547 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 21:06:35,547 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 21:06:35,547 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 21:06:35,547 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 21:06:35,547 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 21:06:35,547 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 21:06:35,548 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 21:06:35,548 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 21:06:35,548 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 21:06:35,548 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 21:06:35,575 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 21:06:35,585 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 21:06:35,588 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 21:06:35,590 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 21:06:35,590 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 21:06:35,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-02-02 21:06:35,722 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 21:06:35,723 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 21:06:35,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:35,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 21:06:35,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 21:06:35,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4172ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35, skipping insertion in model container [2018-02-02 21:06:35,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,749 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:35,787 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 21:06:35,881 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:35,894 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 21:06:35,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35 WrapperNode [2018-02-02 21:06:35,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 21:06:35,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 21:06:35,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 21:06:35,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 21:06:35,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (1/1) ... [2018-02-02 21:06:35,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 21:06:35,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 21:06:35,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 21:06:35,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 21:06:35,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (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 21:06:35,965 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 21:06:35,966 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 21:06:35,966 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 21:06:35,966 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-02-02 21:06:35,966 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 21:06:35,966 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 21:06:35,966 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 21:06:35,966 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 21:06:35,966 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-02-02 21:06:35,967 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 21:06:35,968 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 21:06:35,968 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 21:06:35,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 21:06:35,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 21:06:36,154 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 21:06:36,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:36 BoogieIcfgContainer [2018-02-02 21:06:36,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 21:06:36,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 21:06:36,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 21:06:36,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 21:06:36,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:06:35" (1/3) ... [2018-02-02 21:06:36,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18db62d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:36, skipping insertion in model container [2018-02-02 21:06:36,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:06:35" (2/3) ... [2018-02-02 21:06:36,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18db62d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:06:36, skipping insertion in model container [2018-02-02 21:06:36,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:06:36" (3/3) ... [2018-02-02 21:06:36,159 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-02-02 21:06:36,165 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 21:06:36,169 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 21:06:36,198 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 21:06:36,199 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 21:06:36,199 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 21:06:36,199 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 21:06:36,199 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 21:06:36,199 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 21:06:36,199 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 21:06:36,199 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 21:06:36,200 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 21:06:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-02-02 21:06:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:06:36,219 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:36,220 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 21:06:36,220 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-02-02 21:06:36,225 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:36,225 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:36,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,260 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:36,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:36,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:36,373 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 21:06:36,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:36,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 21:06:36,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 21:06:36,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 21:06:36,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:06:36,397 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-02-02 21:06:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:36,595 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2018-02-02 21:06:36,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 21:06:36,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 21:06:36,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:36,608 INFO L225 Difference]: With dead ends: 122 [2018-02-02 21:06:36,608 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 21:06:36,610 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 21:06:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 21:06:36,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-02-02 21:06:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 21:06:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-02 21:06:36,651 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-02-02 21:06:36,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:36,652 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-02 21:06:36,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 21:06:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-02 21:06:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 21:06:36,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:36,654 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 21:06:36,654 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-02-02 21:06:36,654 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:36,654 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:36,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,656 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:36,656 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:36,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:36,737 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 21:06:36,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:36,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:36,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:06:36,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:06:36,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:36,739 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-02-02 21:06:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:36,764 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-02-02 21:06:36,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:36,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 21:06:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:36,766 INFO L225 Difference]: With dead ends: 75 [2018-02-02 21:06:36,766 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 21:06:36,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 21:06:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-02-02 21:06:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 21:06:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-02 21:06:36,773 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-02-02 21:06:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:36,773 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-02 21:06:36,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:06:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-02 21:06:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:36,774 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:36,774 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:36,774 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-02-02 21:06:36,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:36,775 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:36,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,776 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:36,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:36,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:36,844 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 21:06:36,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:36,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 21:06:36,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:36,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:36,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:36,845 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-02-02 21:06:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:36,892 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-02-02 21:06:36,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:36,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 21:06:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:36,894 INFO L225 Difference]: With dead ends: 71 [2018-02-02 21:06:36,894 INFO L226 Difference]: Without dead ends: 71 [2018-02-02 21:06:36,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:06:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-02 21:06:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-02 21:06:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-02 21:06:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-02-02 21:06:36,900 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-02-02 21:06:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:36,900 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-02-02 21:06:36,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-02-02 21:06:36,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:36,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:36,901 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:36,902 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-02-02 21:06:36,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:36,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:36,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,904 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:36,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:36,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:36,954 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 21:06:36,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:36,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:36,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 21:06:36,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 21:06:36,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 21:06:36,956 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-02-02 21:06:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:37,044 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-02-02 21:06:37,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 21:06:37,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 21:06:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:37,046 INFO L225 Difference]: With dead ends: 70 [2018-02-02 21:06:37,046 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 21:06:37,046 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:06:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 21:06:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 21:06:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 21:06:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-02 21:06:37,051 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-02-02 21:06:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:37,052 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-02 21:06:37,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 21:06:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-02 21:06:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 21:06:37,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:37,053 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:37,054 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-02-02 21:06:37,054 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:37,054 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:37,055 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:37,056 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:37,056 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:37,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:37,261 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 21:06:37,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:37,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 21:06:37,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:06:37,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:06:37,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:06:37,262 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-02-02 21:06:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:37,477 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2018-02-02 21:06:37,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:06:37,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 21:06:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:37,479 INFO L225 Difference]: With dead ends: 74 [2018-02-02 21:06:37,479 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 21:06:37,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 21:06:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 21:06:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-02-02 21:06:37,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-02 21:06:37,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-02-02 21:06:37,483 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-02-02 21:06:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:37,483 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-02-02 21:06:37,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:06:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-02-02 21:06:37,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 21:06:37,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:37,484 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:37,484 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-02-02 21:06:37,485 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:37,485 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:37,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:37,486 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:37,486 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:37,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:37,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:37,787 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:37,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:37,816 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:37,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 21:06:37,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:37,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 21:06:37,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:37,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:06:37,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:06:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:38,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:38,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-02-02 21:06:38,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 21:06:38,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 21:06:38,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 21:06:38,065 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 20 states. [2018-02-02 21:06:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:38,485 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 21:06:38,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:06:38,485 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-02-02 21:06:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:38,486 INFO L225 Difference]: With dead ends: 79 [2018-02-02 21:06:38,486 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 21:06:38,486 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-02-02 21:06:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 21:06:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-02-02 21:06:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 21:06:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-02-02 21:06:38,491 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-02-02 21:06:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:38,491 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-02-02 21:06:38,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 21:06:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-02-02 21:06:38,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 21:06:38,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:38,492 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:38,493 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-02-02 21:06:38,493 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:38,493 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:38,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,494 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:38,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:38,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 21:06:38,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:38,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:06:38,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 21:06:38,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 21:06:38,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 21:06:38,562 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-02-02 21:06:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:38,675 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-02-02 21:06:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:06:38,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 21:06:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:38,676 INFO L225 Difference]: With dead ends: 103 [2018-02-02 21:06:38,676 INFO L226 Difference]: Without dead ends: 103 [2018-02-02 21:06:38,677 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-02 21:06:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-02-02 21:06:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 21:06:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-02-02 21:06:38,680 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-02-02 21:06:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:38,680 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-02-02 21:06:38,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 21:06:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-02-02 21:06:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 21:06:38,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:38,681 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:38,681 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-02-02 21:06:38,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:38,681 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:38,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,682 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:38,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:38,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:38,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:38,761 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:38,762 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:38,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 21:06:38,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 21:06:38,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-02-02 21:06:38,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:06:38,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:06:38,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:06:38,792 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 9 states. [2018-02-02 21:06:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:38,878 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-02 21:06:38,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 21:06:38,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-02-02 21:06:38,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:38,879 INFO L225 Difference]: With dead ends: 107 [2018-02-02 21:06:38,879 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 21:06:38,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:06:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 21:06:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-02-02 21:06:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 21:06:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-02 21:06:38,883 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 38 [2018-02-02 21:06:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:38,883 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-02 21:06:38,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:06:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-02 21:06:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 21:06:38,884 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:38,884 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:38,884 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 157473967, now seen corresponding path program 1 times [2018-02-02 21:06:38,885 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:38,885 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:38,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,886 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:38,886 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:38,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-02-02 21:06:38,932 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:38,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 21:06:38,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 21:06:38,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 21:06:38,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:38,933 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2018-02-02 21:06:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:38,946 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2018-02-02 21:06:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 21:06:38,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-02-02 21:06:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:38,948 INFO L225 Difference]: With dead ends: 115 [2018-02-02 21:06:38,948 INFO L226 Difference]: Without dead ends: 115 [2018-02-02 21:06:38,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 21:06:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-02 21:06:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-02-02 21:06:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 21:06:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-02-02 21:06:38,953 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 46 [2018-02-02 21:06:38,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:38,953 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-02-02 21:06:38,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 21:06:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-02-02 21:06:38,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 21:06:38,954 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:38,955 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:38,955 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash -108654543, now seen corresponding path program 1 times [2018-02-02 21:06:38,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:38,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:38,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:38,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:38,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:06:39,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:39,024 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:39,025 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:39,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:39,091 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:39,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-02-02 21:06:39,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 21:06:39,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 21:06:39,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:06:39,092 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 13 states. [2018-02-02 21:06:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:39,133 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-02-02 21:06:39,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 21:06:39,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-02 21:06:39,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:39,144 INFO L225 Difference]: With dead ends: 105 [2018-02-02 21:06:39,144 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 21:06:39,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:06:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 21:06:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-02-02 21:06:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-02-02 21:06:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-02-02 21:06:39,149 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 48 [2018-02-02 21:06:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:39,149 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-02-02 21:06:39,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 21:06:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-02-02 21:06:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 21:06:39,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:39,152 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:39,152 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1169426246, now seen corresponding path program 2 times [2018-02-02 21:06:39,153 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:39,153 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:39,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:39,154 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:39,154 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:39,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:06:39,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:39,222 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:39,223 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:39,240 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:06:39,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:39,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:39,309 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:39,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:39,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-02-02 21:06:39,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 21:06:39,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 21:06:39,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:06:39,310 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2018-02-02 21:06:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:39,382 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-02-02 21:06:39,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 21:06:39,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-02-02 21:06:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:39,383 INFO L225 Difference]: With dead ends: 109 [2018-02-02 21:06:39,384 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 21:06:39,384 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-02-02 21:06:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 21:06:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-02-02 21:06:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-02-02 21:06:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2018-02-02 21:06:39,389 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 52 [2018-02-02 21:06:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:39,389 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2018-02-02 21:06:39,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 21:06:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2018-02-02 21:06:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-02 21:06:39,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:39,390 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:39,391 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:39,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1567126723, now seen corresponding path program 3 times [2018-02-02 21:06:39,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:39,391 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:39,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:39,392 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:39,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:39,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:06:39,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:39,470 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:39,471 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:06:39,488 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 21:06:39,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:39,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:39,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 21:06:39,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:39,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 21:06:39,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 21:06:39,573 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-02 21:06:39,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 21:06:39,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:39,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 21:06:39,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-02 21:06:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 3 not checked. [2018-02-02 21:06:39,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:39,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-02-02 21:06:39,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 21:06:39,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 21:06:39,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=220, Unknown=1, NotChecked=30, Total=306 [2018-02-02 21:06:39,616 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 18 states. [2018-02-02 21:06:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:40,073 INFO L93 Difference]: Finished difference Result 142 states and 158 transitions. [2018-02-02 21:06:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 21:06:40,073 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-02-02 21:06:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:40,074 INFO L225 Difference]: With dead ends: 142 [2018-02-02 21:06:40,074 INFO L226 Difference]: Without dead ends: 142 [2018-02-02 21:06:40,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=820, Unknown=2, NotChecked=60, Total=1056 [2018-02-02 21:06:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-02 21:06:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 119. [2018-02-02 21:06:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 21:06:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2018-02-02 21:06:40,078 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 56 [2018-02-02 21:06:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:40,079 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2018-02-02 21:06:40,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 21:06:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2018-02-02 21:06:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 21:06:40,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:40,079 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:40,079 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:40,079 INFO L82 PathProgramCache]: Analyzing trace with hash -429538227, now seen corresponding path program 1 times [2018-02-02 21:06:40,080 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:40,080 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:40,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:40,080 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:40,080 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:40,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:06:40,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:40,148 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:40,148 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:40,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 6 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:40,284 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:40,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-02-02 21:06:40,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 21:06:40,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 21:06:40,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:06:40,285 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 19 states. [2018-02-02 21:06:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:40,385 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2018-02-02 21:06:40,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:06:40,385 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-02-02 21:06:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:40,386 INFO L225 Difference]: With dead ends: 125 [2018-02-02 21:06:40,386 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 21:06:40,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-02-02 21:06:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 21:06:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-02-02 21:06:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 21:06:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-02-02 21:06:40,390 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 60 [2018-02-02 21:06:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:40,391 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-02-02 21:06:40,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 21:06:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-02-02 21:06:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-02 21:06:40,392 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:40,392 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:40,392 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 162408278, now seen corresponding path program 2 times [2018-02-02 21:06:40,392 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:40,392 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:40,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:40,393 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:40,393 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:40,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:06:40,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:40,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:40,490 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 21:06:40,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 21:06:40,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:40,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 21:06:40,614 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:40,614 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-02 21:06:40,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 21:06:40,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 21:06:40,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:06:40,617 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 21 states. [2018-02-02 21:06:40,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:40,691 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2018-02-02 21:06:40,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 21:06:40,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-02-02 21:06:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:40,692 INFO L225 Difference]: With dead ends: 129 [2018-02-02 21:06:40,692 INFO L226 Difference]: Without dead ends: 129 [2018-02-02 21:06:40,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-02-02 21:06:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-02 21:06:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-02-02 21:06:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-02-02 21:06:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 143 transitions. [2018-02-02 21:06:40,697 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 143 transitions. Word has length 64 [2018-02-02 21:06:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:40,697 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 143 transitions. [2018-02-02 21:06:40,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 21:06:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 143 transitions. [2018-02-02 21:06:40,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-02 21:06:40,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:40,698 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:40,698 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1131684385, now seen corresponding path program 3 times [2018-02-02 21:06:40,698 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:40,698 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:40,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:40,699 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:40,699 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:40,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 21:06:40,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:40,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:40,794 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 21:06:40,809 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-02-02 21:06:40,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 21:06:40,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:40,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 21:06:40,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:40,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-02 21:06:40,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:40,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-02 21:06:40,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:40,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 21:06:40,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:40,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:06:40,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-02 21:06:41,006 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse1 (mod v_prenex_3 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_4) 0) (= |c_#length| (store |c_old(#length)| v_prenex_4 (+ .cse1 (- 4294967296)))) (< 2147483647 .cse1))))) is different from true [2018-02-02 21:06:41,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:41,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2018-02-02 21:06:41,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:41,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:41,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:41,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-02-02 21:06:41,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:41,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:41,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:41,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-02 21:06:41,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:41,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:41,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 21:06:41,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-02 21:06:41,143 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:41,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 21:06:41,160 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-02 21:06:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 162 trivial. 3 not checked. [2018-02-02 21:06:41,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:41,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-02-02 21:06:41,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 21:06:41,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 21:06:41,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=417, Unknown=1, NotChecked=42, Total=552 [2018-02-02 21:06:41,220 INFO L87 Difference]: Start difference. First operand 127 states and 143 transitions. Second operand 24 states. [2018-02-02 21:06:41,325 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse2 (mod |c_ldv_malloc_#in~size| 4294967296))) (let ((.cse5 (<= .cse2 2147483647)) (.cse0 (< 2147483647 .cse2))) (and (let ((.cse3 (select |c_#length| |c_ldv_malloc_#res.base|)) (.cse1 (= 1 (select |c_#valid| |c_ldv_malloc_#res.base|))) (.cse4 (= |c_ldv_malloc_#res.offset| 0))) (or (and .cse0 .cse1 (= .cse2 (+ .cse3 4294967296)) .cse4) (and (= .cse2 .cse3) .cse1 .cse4 .cse5))) (let ((.cse8 (select |c_#length| |c_ldv_malloc_#t~malloc1.base|)) (.cse6 (= |c_ldv_malloc_#t~malloc1.offset| 0)) (.cse7 (= 1 (select |c_#valid| |c_ldv_malloc_#t~malloc1.base|)))) (or (and .cse6 .cse7 .cse5 (= .cse2 .cse8)) (and (= (+ .cse8 4294967296) .cse2) .cse0 .cse6 .cse7))) (= |c_ldv_malloc_#in~size| c_ldv_malloc_~size) (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse9 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse9) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse9 2147483647)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse10 (mod v_prenex_3 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_4) 0) (= |c_#length| (store |c_old(#length)| v_prenex_4 (+ .cse10 (- 4294967296)))) (< 2147483647 .cse10)))))))) is different from true [2018-02-02 21:06:41,328 WARN L1033 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#length| |c_ldv_malloc_#res.base|)) (.cse1 (= 1 (select |c_#valid| |c_ldv_malloc_#res.base|))) (.cse3 (= |c_ldv_malloc_#res.offset| 0)) (.cse0 (mod |c_ldv_malloc_#in~size| 4294967296))) (or (and (< 2147483647 .cse0) .cse1 (= .cse0 (+ .cse2 4294967296)) .cse3) (and (= .cse0 .cse2) .cse1 .cse3 (<= .cse0 2147483647)))) (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse4 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse4) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse4 2147483647)))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (let ((.cse5 (mod v_prenex_3 4294967296))) (and (<= (select |c_old(#valid)| v_prenex_4) 0) (= |c_#length| (store |c_old(#length)| v_prenex_4 (+ .cse5 (- 4294967296)))) (< 2147483647 .cse5)))))) is different from true [2018-02-02 21:06:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:43,019 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2018-02-02 21:06:43,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 21:06:43,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 68 [2018-02-02 21:06:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:43,020 INFO L225 Difference]: With dead ends: 151 [2018-02-02 21:06:43,020 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 21:06:43,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=281, Invalid=1368, Unknown=3, NotChecked=240, Total=1892 [2018-02-02 21:06:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 21:06:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 141. [2018-02-02 21:06:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-02-02 21:06:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 159 transitions. [2018-02-02 21:06:43,025 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 159 transitions. Word has length 68 [2018-02-02 21:06:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:43,025 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 159 transitions. [2018-02-02 21:06:43,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 21:06:43,026 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-02-02 21:06:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 21:06:43,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:43,026 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:43,026 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2037934795, now seen corresponding path program 1 times [2018-02-02 21:06:43,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:43,027 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:43,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,028 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 21:06:43,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:43,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 21:06:43,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:43,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 21:06:43,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 21:06:43,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 21:06:43,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 21:06:43,100 INFO L87 Difference]: Start difference. First operand 141 states and 159 transitions. Second operand 9 states. [2018-02-02 21:06:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:43,219 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2018-02-02 21:06:43,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 21:06:43,219 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 74 [2018-02-02 21:06:43,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:43,220 INFO L225 Difference]: With dead ends: 157 [2018-02-02 21:06:43,220 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 21:06:43,221 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 21:06:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 21:06:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2018-02-02 21:06:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 21:06:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 166 transitions. [2018-02-02 21:06:43,225 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 166 transitions. Word has length 74 [2018-02-02 21:06:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:43,225 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 166 transitions. [2018-02-02 21:06:43,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 21:06:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2018-02-02 21:06:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 21:06:43,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:43,226 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:43,226 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:43,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2037934796, now seen corresponding path program 1 times [2018-02-02 21:06:43,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:43,226 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:43,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:43,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:43,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 21:06:43,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 21:06:43,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 21:06:43,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 21:06:43,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 21:06:43,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 21:06:43,279 INFO L87 Difference]: Start difference. First operand 147 states and 166 transitions. Second operand 7 states. [2018-02-02 21:06:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:43,342 INFO L93 Difference]: Finished difference Result 179 states and 198 transitions. [2018-02-02 21:06:43,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 21:06:43,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-02-02 21:06:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:43,344 INFO L225 Difference]: With dead ends: 179 [2018-02-02 21:06:43,344 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 21:06:43,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 21:06:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 21:06:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 150. [2018-02-02 21:06:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-02-02 21:06:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2018-02-02 21:06:43,348 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 74 [2018-02-02 21:06:43,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:43,348 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2018-02-02 21:06:43,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 21:06:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2018-02-02 21:06:43,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-02-02 21:06:43,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:43,349 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:43,349 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1862067708, now seen corresponding path program 1 times [2018-02-02 21:06:43,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:43,350 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:43,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:43,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:43,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-02-02 21:06:43,498 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:43,498 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:43,499 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:43,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-02-02 21:06:43,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:43,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 16 [2018-02-02 21:06:43,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 21:06:43,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 21:06:43,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-02-02 21:06:43,572 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand 16 states. [2018-02-02 21:06:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:43,887 INFO L93 Difference]: Finished difference Result 196 states and 218 transitions. [2018-02-02 21:06:43,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 21:06:43,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-02-02 21:06:43,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:43,888 INFO L225 Difference]: With dead ends: 196 [2018-02-02 21:06:43,888 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 21:06:43,888 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 21:06:43,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 21:06:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 152. [2018-02-02 21:06:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-02 21:06:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-02-02 21:06:43,890 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 79 [2018-02-02 21:06:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:43,891 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-02-02 21:06:43,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 21:06:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-02-02 21:06:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 21:06:43,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:43,891 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:43,891 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash 449519657, now seen corresponding path program 1 times [2018-02-02 21:06:43,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:43,891 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:43,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,892 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:43,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:43,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 21:06:44,037 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 21:06:44,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 21:06:44,038 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:44,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 21:06:44,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-02 21:06:44,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:44,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 21:06:44,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 21:06:44,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 21:06:44,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-02-02 21:06:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-02-02 21:06:44,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 21:06:44,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-02-02 21:06:44,311 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 21:06:44,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 21:06:44,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 21:06:44,312 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 23 states. [2018-02-02 21:06:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 21:06:44,929 INFO L93 Difference]: Finished difference Result 174 states and 189 transitions. [2018-02-02 21:06:44,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 21:06:44,929 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-02-02 21:06:44,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 21:06:44,929 INFO L225 Difference]: With dead ends: 174 [2018-02-02 21:06:44,930 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 21:06:44,930 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=1115, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 21:06:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 21:06:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 160. [2018-02-02 21:06:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-02 21:06:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2018-02-02 21:06:44,933 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 81 [2018-02-02 21:06:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 21:06:44,933 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2018-02-02 21:06:44,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 21:06:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2018-02-02 21:06:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 21:06:44,933 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 21:06:44,934 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 21:06:44,934 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-02-02 21:06:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1050207497, now seen corresponding path program 1 times [2018-02-02 21:06:44,934 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 21:06:44,934 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 21:06:44,934 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:44,935 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 21:06:44,935 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 21:06:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 21:06:44,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 21:06:44,960 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 21:06:44,966 INFO L168 Benchmark]: Toolchain (without parser) took 9243.11 ms. Allocated memory was 405.8 MB in the beginning and 764.4 MB in the end (delta: 358.6 MB). Free memory was 362.5 MB in the beginning and 672.8 MB in the end (delta: -310.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:44,967 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 405.8 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 21:06:44,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.55 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 349.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:44,967 INFO L168 Benchmark]: Boogie Preprocessor took 28.21 ms. Allocated memory is still 405.8 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:44,967 INFO L168 Benchmark]: RCFGBuilder took 226.64 ms. Allocated memory is still 405.8 MB. Free memory was 346.6 MB in the beginning and 323.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:44,967 INFO L168 Benchmark]: TraceAbstraction took 8809.92 ms. Allocated memory was 405.8 MB in the beginning and 764.4 MB in the end (delta: 358.6 MB). Free memory was 323.9 MB in the beginning and 672.8 MB in the end (delta: -348.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 5.3 GB. [2018-02-02 21:06:44,969 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 405.8 MB. Free memory is still 367.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 175.55 ms. Allocated memory is still 405.8 MB. Free memory was 362.5 MB in the beginning and 349.3 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.21 ms. Allocated memory is still 405.8 MB. Free memory was 349.3 MB in the beginning and 346.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 226.64 ms. Allocated memory is still 405.8 MB. Free memory was 346.6 MB in the beginning and 323.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8809.92 ms. Allocated memory was 405.8 MB in the beginning and 764.4 MB in the end (delta: 358.6 MB). Free memory was 323.9 MB in the beginning and 672.8 MB in the end (delta: -348.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_21-06-44-974.csv Received shutdown request...