java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:48:08,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:48:08,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:48:08,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:48:08,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:48:08,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:48:08,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:48:08,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:48:08,166 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:48:08,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:48:08,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:48:08,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:48:08,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:48:08,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:48:08,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:48:08,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:48:08,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:48:08,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:48:08,177 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:48:08,178 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:48:08,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:48:08,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:48:08,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:48:08,181 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:48:08,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:48:08,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:48:08,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:48:08,183 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:48:08,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:48:08,184 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:48:08,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:48:08,184 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:48:08,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:48:08,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:48:08,195 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:48:08,196 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:48:08,196 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:48:08,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:48:08,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:08,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:48:08,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:48:08,198 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:48:08,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:48:08,234 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:48:08,236 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:48:08,237 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:48:08,238 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:48:08,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-02 10:48:08,372 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:48:08,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:48:08,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:08,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:48:08,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:48:08,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270c7f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08, skipping insertion in model container [2018-02-02 10:48:08,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,392 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:08,426 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:48:08,505 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:08,523 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:48:08,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08 WrapperNode [2018-02-02 10:48:08,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:48:08,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:48:08,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:48:08,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:48:08,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... [2018-02-02 10:48:08,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:48:08,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:48:08,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:48:08,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:48:08,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:48:08,592 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:48:08,593 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:48:08,593 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 10:48:08,593 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-02-02 10:48:08,593 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-02-02 10:48:08,593 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 10:48:08,593 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:48:08,593 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:48:08,593 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:48:08,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:48:08,593 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:48:08,593 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:48:08,594 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:48:08,791 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:48:08,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:08 BoogieIcfgContainer [2018-02-02 10:48:08,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:48:08,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:48:08,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:48:08,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:48:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:48:08" (1/3) ... [2018-02-02 10:48:08,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:08, skipping insertion in model container [2018-02-02 10:48:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:48:08" (2/3) ... [2018-02-02 10:48:08,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dde4699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:48:08, skipping insertion in model container [2018-02-02 10:48:08,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:48:08" (3/3) ... [2018-02-02 10:48:08,797 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-02-02 10:48:08,802 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:48:08,807 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-02 10:48:08,837 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:48:08,838 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:48:08,838 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:48:08,838 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:48:08,838 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:48:08,838 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:48:08,839 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:48:08,839 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:48:08,839 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:48:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-02-02 10:48:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:48:08,861 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:08,862 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 10:48:08,862 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-02-02 10:48:08,907 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:08,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:09,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,051 INFO L182 omatonBuilderFactory]: Interpolants [80#false, 81#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 82#(and (= 0 |entry_point_#t~ret10.base|) (= 0 |entry_point_#t~ret10.offset|)), 83#(and (= entry_point_~array~0.base 0) (= 0 entry_point_~array~0.offset)), 79#true] [2018-02-02 10:48:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:09,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:09,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:09,116 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-02-02 10:48:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:09,163 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-02-02 10:48:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:09,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-02 10:48:09,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:09,171 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:48:09,172 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 10:48:09,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:09,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 10:48:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 10:48:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:48:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-02 10:48:09,204 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-02-02 10:48:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:09,204 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-02 10:48:09,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-02 10:48:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 10:48:09,206 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,206 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 10:48:09,206 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-02-02 10:48:09,207 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,245 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:48:09,246 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,246 INFO L182 omatonBuilderFactory]: Interpolants [243#true, 244#false, 245#(= |#valid| |old(#valid)|)] [2018-02-02 10:48:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:48:09,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:48:09,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:09,248 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-02-02 10:48:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:09,335 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-02 10:48:09,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:48:09,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-02 10:48:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:09,337 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:48:09,337 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 10:48:09,337 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:48:09,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 10:48:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-02-02 10:48:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:48:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-02-02 10:48:09,345 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-02-02 10:48:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:09,345 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-02-02 10:48:09,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:48:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-02-02 10:48:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:09,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,346 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 10:48:09,346 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,346 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-02-02 10:48:09,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:09,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,403 INFO L182 omatonBuilderFactory]: Interpolants [433#true, 434#false, 435#(= 1 (select |#valid| |ldv_malloc_#t~malloc1.base|)), 436#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 437#(= 1 (select |#valid| |entry_point_#t~ret10.base|)), 438#(= 1 (select |#valid| entry_point_~array~0.base))] [2018-02-02 10:48:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:09,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:09,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:09,404 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-02-02 10:48:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:09,509 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-02-02 10:48:09,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:09,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:48:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:09,511 INFO L225 Difference]: With dead ends: 76 [2018-02-02 10:48:09,511 INFO L226 Difference]: Without dead ends: 76 [2018-02-02 10:48:09,511 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 10:48:09,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-02 10:48:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-02-02 10:48:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:48:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 10:48:09,516 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-02-02 10:48:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:09,517 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 10:48:09,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 10:48:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:09,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:09,518 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 10:48:09,518 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:09,518 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-02-02 10:48:09,519 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:09,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,741 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:09,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 10:48:09,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,742 INFO L182 omatonBuilderFactory]: Interpolants [592#false, 593#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 594#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 595#(and (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (<= 2147483648 |ldv_malloc_#in~size|)) (= 0 |ldv_malloc_#t~malloc1.offset|)), 596#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 597#(and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)), 598#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 599#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 591#true] [2018-02-02 10:48:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:09,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:09,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:09,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:09,743 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-02 10:48:09,868 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 28 [2018-02-02 10:48:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:10,030 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 10:48:10,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:48:10,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 10:48:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:10,031 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:48:10,031 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:48:10,031 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 10:48:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:48:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-02-02 10:48:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:48:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-02 10:48:10,034 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-02-02 10:48:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:10,034 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-02 10:48:10,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-02 10:48:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:48:10,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:10,035 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 10:48:10,035 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:10,035 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-02-02 10:48:10,036 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:10,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:10,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:48:10,074 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,074 INFO L182 omatonBuilderFactory]: Interpolants [768#false, 769#(not (= 0 |ldv_malloc_#t~malloc1.base|)), 770#(not (= 0 |ldv_malloc_#res.base|)), 771#(not (= 0 |entry_point_#t~ret10.base|)), 772#(not (= 0 entry_point_~array~0.base)), 767#true] [2018-02-02 10:48:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:10,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:10,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:10,075 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-02-02 10:48:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:10,112 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-02-02 10:48:10,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:10,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 10:48:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:10,113 INFO L225 Difference]: With dead ends: 77 [2018-02-02 10:48:10,113 INFO L226 Difference]: Without dead ends: 77 [2018-02-02 10:48:10,114 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-02 10:48:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-02 10:48:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:48:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 10:48:10,118 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-02-02 10:48:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:10,118 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 10:48:10,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 10:48:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:48:10,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:10,119 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 10:48:10,119 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-02-02 10:48:10,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:10,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:10,343 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 10:48:10,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:10,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:48:10,343 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,344 INFO L182 omatonBuilderFactory]: Interpolants [929#true, 930#false, 931#(and (<= 10 entry_point_~len~0) (<= entry_point_~len~0 10)), 932#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 933#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 934#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 935#(or (and (<= 40 (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 936#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 937#(and (or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))) (= entry_point_~i~2 0)), 938#(and (<= 40 (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (= entry_point_~i~2 0)), 939#(and (<= (+ (* 4 entry_point_~i~2) 36) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)))] [2018-02-02 10:48:10,344 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 10:48:10,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:10,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:10,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:10,345 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 11 states. [2018-02-02 10:48:10,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:10,597 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-02 10:48:10,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:10,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-02 10:48:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:10,598 INFO L225 Difference]: With dead ends: 83 [2018-02-02 10:48:10,598 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 10:48:10,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 10:48:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-02-02 10:48:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:48:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-02-02 10:48:10,603 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 23 [2018-02-02 10:48:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:10,603 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-02-02 10:48:10,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-02-02 10:48:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:48:10,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:10,604 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:10,604 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-02-02 10:48:10,606 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:10,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:10,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:48:10,796 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,796 INFO L182 omatonBuilderFactory]: Interpolants [1120#(<= entry_point_~len~0 10), 1121#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 1122#(or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc1.base|)) (= 0 |ldv_malloc_#t~malloc1.offset|)) (<= 4294967296 |ldv_malloc_#in~size|) (<= (+ (select |#length| |ldv_malloc_#t~malloc1.base|) 1) 0)), 1123#(or (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 4294967296 |ldv_malloc_#in~size|) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))), 1124#(or (and (<= (* 4 entry_point_~len~0) (select |#length| |entry_point_#t~ret10.base|)) (= 0 |entry_point_#t~ret10.offset|)) (<= (+ (select |#length| |entry_point_#t~ret10.base|) 1) 0)), 1125#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) 0) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1126#(or (<= (+ (select |#length| entry_point_~array~0.base) 1) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1127#(or (<= (+ (select |#length| entry_point_~array~0.base) 5) (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0))), 1128#(and (<= 0 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset)) (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0)), 1129#(and (<= (* 4 entry_point_~len~0) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1130#(and (<= (+ (* 4 entry_point_~i~2) 4) (select |#length| entry_point_~array~0.base)) (= entry_point_~array~0.offset 0) (<= 4 (+ (* 4 entry_point_~i~2) entry_point_~array~0.offset))), 1118#true, 1119#false] [2018-02-02 10:48:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:10,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:10,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:10,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:10,797 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 13 states. [2018-02-02 10:48:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,062 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-02-02 10:48:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:11,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-02 10:48:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,063 INFO L225 Difference]: With dead ends: 80 [2018-02-02 10:48:11,064 INFO L226 Difference]: Without dead ends: 80 [2018-02-02 10:48:11,064 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:48:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-02 10:48:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-02-02 10:48:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:48:11,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-02-02 10:48:11,068 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 27 [2018-02-02 10:48:11,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,069 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-02-02 10:48:11,069 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:11,069 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-02-02 10:48:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:48:11,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,070 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,070 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1676632482, now seen corresponding path program 1 times [2018-02-02 10:48:11,071 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:11,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:11,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:11,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:48:11,118 INFO L182 omatonBuilderFactory]: Interpolants [1300#true, 1301#false, 1302#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 1303#(and (= 0 |alloc_17_#t~ret3.base|) (= 0 |alloc_17_#t~ret3.offset|)), 1304#(and (= 0 alloc_17_~p~0.offset) (= alloc_17_~p~0.base 0))] [2018-02-02 10:48:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-02 10:48:11,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:11,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:11,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:11,119 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 5 states. [2018-02-02 10:48:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,132 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-02-02 10:48:11,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:11,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-02-02 10:48:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,133 INFO L225 Difference]: With dead ends: 79 [2018-02-02 10:48:11,133 INFO L226 Difference]: Without dead ends: 79 [2018-02-02 10:48:11,134 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-02 10:48:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-02-02 10:48:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 10:48:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-02 10:48:11,137 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 34 [2018-02-02 10:48:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,138 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-02 10:48:11,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-02 10:48:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:48:11,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,144 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:48:11,144 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987476, now seen corresponding path program 1 times [2018-02-02 10:48:11,145 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:11,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:11,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,190 INFO L182 omatonBuilderFactory]: Interpolants [1461#true, 1462#false, 1463#(= 1 (select |#valid| entry_point_~array~0.base)), 1464#(= |#valid| |old(#valid)|), 1465#(= 1 (select |#valid| |free_17_#in~array.base|)), 1466#(= 1 (select |#valid| free_17_~array.base))] [2018-02-02 10:48:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:11,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:11,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:11,190 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 6 states. [2018-02-02 10:48:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,324 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-02 10:48:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:11,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 10:48:11,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,325 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:48:11,326 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:48:11,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:48:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2018-02-02 10:48:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-02-02 10:48:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2018-02-02 10:48:11,333 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 35 [2018-02-02 10:48:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,333 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2018-02-02 10:48:11,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2018-02-02 10:48:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:48:11,334 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,340 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:48:11,340 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1914987475, now seen corresponding path program 1 times [2018-02-02 10:48:11,341 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:11,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 10:48:11,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,385 INFO L182 omatonBuilderFactory]: Interpolants [1696#false, 1697#(<= 10 entry_point_~len~0), 1698#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 1699#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1695#true] [2018-02-02 10:48:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:11,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:11,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:11,386 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand 5 states. [2018-02-02 10:48:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,415 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-02-02 10:48:11,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:11,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-02-02 10:48:11,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,416 INFO L225 Difference]: With dead ends: 108 [2018-02-02 10:48:11,417 INFO L226 Difference]: Without dead ends: 108 [2018-02-02 10:48:11,417 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-02-02 10:48:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-02-02 10:48:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-02-02 10:48:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2018-02-02 10:48:11,421 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 35 [2018-02-02 10:48:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,421 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2018-02-02 10:48:11,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2018-02-02 10:48:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 10:48:11,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,422 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,423 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1161542588, now seen corresponding path program 2 times [2018-02-02 10:48:11,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:11,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 10:48:11,468 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,469 INFO L182 omatonBuilderFactory]: Interpolants [1920#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 1921#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 1916#true, 1917#false, 1918#(<= 10 entry_point_~len~0), 1919#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0))] [2018-02-02 10:48:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:48:11,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:48:11,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:11,470 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand 6 states. [2018-02-02 10:48:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,502 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2018-02-02 10:48:11,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:48:11,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-02 10:48:11,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,505 INFO L225 Difference]: With dead ends: 112 [2018-02-02 10:48:11,505 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 10:48:11,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 10:48:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-02-02 10:48:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-02-02 10:48:11,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2018-02-02 10:48:11,509 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 39 [2018-02-02 10:48:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,509 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2018-02-02 10:48:11,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:48:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2018-02-02 10:48:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-02 10:48:11,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,510 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, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,511 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1952254171, now seen corresponding path program 3 times [2018-02-02 10:48:11,512 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,561 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 10:48:11,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:11,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 10:48:11,562 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,562 INFO L182 omatonBuilderFactory]: Interpolants [2148#true, 2149#false, 2150#(<= 10 entry_point_~len~0), 2151#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2152#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2153#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2154#(<= (+ entry_point_~i~2 7) entry_point_~len~0)] [2018-02-02 10:48:11,562 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 10:48:11,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:48:11,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:48:11,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:48:11,563 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand 7 states. [2018-02-02 10:48:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,622 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2018-02-02 10:48:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:48:11,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-02-02 10:48:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,623 INFO L225 Difference]: With dead ends: 116 [2018-02-02 10:48:11,623 INFO L226 Difference]: Without dead ends: 116 [2018-02-02 10:48:11,624 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-02 10:48:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-02-02 10:48:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-02 10:48:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-02-02 10:48:11,628 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 43 [2018-02-02 10:48:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,628 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-02-02 10:48:11,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:48:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-02-02 10:48:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 10:48:11,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,629 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,629 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1950591474, now seen corresponding path program 4 times [2018-02-02 10:48:11,630 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,689 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:11,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 10:48:11,690 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,690 INFO L182 omatonBuilderFactory]: Interpolants [2391#true, 2392#false, 2393#(<= 10 entry_point_~len~0), 2394#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2395#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2396#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2397#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2398#(<= (+ entry_point_~i~2 6) entry_point_~len~0)] [2018-02-02 10:48:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:48:11,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:48:11,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:48:11,691 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 8 states. [2018-02-02 10:48:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,755 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-02-02 10:48:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:48:11,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-02 10:48:11,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,756 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:48:11,756 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:48:11,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:48:11,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-02-02 10:48:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:48:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-02-02 10:48:11,761 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 47 [2018-02-02 10:48:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,761 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-02-02 10:48:11,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:48:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-02-02 10:48:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 10:48:11,762 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,762 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,762 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash -281679991, now seen corresponding path program 5 times [2018-02-02 10:48:11,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:11,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:48:11,837 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,838 INFO L182 omatonBuilderFactory]: Interpolants [2645#true, 2646#false, 2647#(<= 10 entry_point_~len~0), 2648#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2649#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2650#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2651#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2652#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2653#(<= (+ entry_point_~i~2 5) entry_point_~len~0)] [2018-02-02 10:48:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:48:11,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:48:11,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:48:11,839 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 9 states. [2018-02-02 10:48:11,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:11,901 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-02-02 10:48:11,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:48:11,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-02-02 10:48:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:11,903 INFO L225 Difference]: With dead ends: 124 [2018-02-02 10:48:11,903 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 10:48:11,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:48:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 10:48:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-02-02 10:48:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-02 10:48:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 137 transitions. [2018-02-02 10:48:11,908 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 137 transitions. Word has length 51 [2018-02-02 10:48:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:11,908 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 137 transitions. [2018-02-02 10:48:11,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:48:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 137 transitions. [2018-02-02 10:48:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 10:48:11,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:11,909 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:11,909 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash 85033376, now seen corresponding path program 6 times [2018-02-02 10:48:11,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:11,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,997 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:11,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:48:11,997 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,998 INFO L182 omatonBuilderFactory]: Interpolants [2912#(<= 10 entry_point_~len~0), 2913#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 2914#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 2915#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 2916#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 2917#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 2918#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 2919#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 2910#true, 2911#false] [2018-02-02 10:48:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:11,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:48:11,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:48:11,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:48:11,999 INFO L87 Difference]: Start difference. First operand 122 states and 137 transitions. Second operand 10 states. [2018-02-02 10:48:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:12,111 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-02-02 10:48:12,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:48:12,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2018-02-02 10:48:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:12,112 INFO L225 Difference]: With dead ends: 128 [2018-02-02 10:48:12,112 INFO L226 Difference]: Without dead ends: 128 [2018-02-02 10:48:12,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:48:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-02 10:48:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-02-02 10:48:12,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-02 10:48:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2018-02-02 10:48:12,117 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 55 [2018-02-02 10:48:12,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:12,117 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2018-02-02 10:48:12,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:48:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2018-02-02 10:48:12,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-02 10:48:12,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:12,118 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:12,118 INFO L371 AbstractCegarLoop]: === Iteration 16 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:12,118 INFO L82 PathProgramCache]: Analyzing trace with hash 819214391, now seen corresponding path program 7 times [2018-02-02 10:48:12,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:12,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:12,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:48:12,207 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,207 INFO L182 omatonBuilderFactory]: Interpolants [3186#true, 3187#false, 3188#(<= 10 entry_point_~len~0), 3189#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3190#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3191#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3192#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3193#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3194#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3195#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3196#(<= (+ entry_point_~i~2 3) entry_point_~len~0)] [2018-02-02 10:48:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:48:12,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:48:12,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:48:12,208 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand 11 states. [2018-02-02 10:48:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:12,329 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2018-02-02 10:48:12,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:48:12,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-02 10:48:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:12,332 INFO L225 Difference]: With dead ends: 132 [2018-02-02 10:48:12,332 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 10:48:12,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-02-02 10:48:12,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 10:48:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-02-02 10:48:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-02 10:48:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2018-02-02 10:48:12,336 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 59 [2018-02-02 10:48:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:12,337 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2018-02-02 10:48:12,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:48:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2018-02-02 10:48:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 10:48:12,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:12,338 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:12,338 INFO L371 AbstractCegarLoop]: === Iteration 17 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1197749426, now seen corresponding path program 8 times [2018-02-02 10:48:12,339 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:12,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:12,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 10:48:12,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:12,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,436 INFO L182 omatonBuilderFactory]: Interpolants [3473#true, 3474#false, 3475#(<= 10 entry_point_~len~0), 3476#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3477#(<= (+ entry_point_~i~2 9) entry_point_~len~0), 3478#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3479#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3480#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3481#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3482#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3483#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3484#(<= (+ entry_point_~i~2 2) entry_point_~len~0)] [2018-02-02 10:48:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:48:12,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:48:12,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:48:12,437 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand 12 states. [2018-02-02 10:48:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:12,548 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2018-02-02 10:48:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:48:12,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 10:48:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:12,550 INFO L225 Difference]: With dead ends: 136 [2018-02-02 10:48:12,550 INFO L226 Difference]: Without dead ends: 136 [2018-02-02 10:48:12,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:48:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-02-02 10:48:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-02-02 10:48:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-02 10:48:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2018-02-02 10:48:12,555 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 63 [2018-02-02 10:48:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:12,555 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2018-02-02 10:48:12,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:48:12,555 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2018-02-02 10:48:12,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 10:48:12,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:12,556 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:48:12,556 INFO L371 AbstractCegarLoop]: === Iteration 18 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:12,556 INFO L82 PathProgramCache]: Analyzing trace with hash 497416933, now seen corresponding path program 9 times [2018-02-02 10:48:12,557 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:12,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:48:12,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 10:48:12,670 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,670 INFO L182 omatonBuilderFactory]: Interpolants [3776#(<= (+ entry_point_~i~2 8) entry_point_~len~0), 3777#(<= (+ entry_point_~i~2 7) entry_point_~len~0), 3778#(<= (+ entry_point_~i~2 6) entry_point_~len~0), 3779#(<= (+ entry_point_~i~2 5) entry_point_~len~0), 3780#(<= (+ entry_point_~i~2 4) entry_point_~len~0), 3781#(<= (+ entry_point_~i~2 3) entry_point_~len~0), 3782#(<= (+ entry_point_~i~2 2) entry_point_~len~0), 3783#(<= (+ entry_point_~i~2 1) entry_point_~len~0), 3771#true, 3772#false, 3773#(<= 10 entry_point_~len~0), 3774#(and (<= 10 entry_point_~len~0) (= entry_point_~i~2 0)), 3775#(<= (+ entry_point_~i~2 9) entry_point_~len~0)] [2018-02-02 10:48:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 10:48:12,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 10:48:12,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:48:12,671 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 13 states. [2018-02-02 10:48:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:12,764 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-02-02 10:48:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:48:12,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2018-02-02 10:48:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:12,765 INFO L225 Difference]: With dead ends: 138 [2018-02-02 10:48:12,765 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 10:48:12,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-02-02 10:48:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 10:48:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-02-02 10:48:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-02 10:48:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2018-02-02 10:48:12,768 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 67 [2018-02-02 10:48:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:12,768 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2018-02-02 10:48:12,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 10:48:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2018-02-02 10:48:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 10:48:12,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:12,769 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] [2018-02-02 10:48:12,769 INFO L371 AbstractCegarLoop]: === Iteration 19 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1940879620, now seen corresponding path program 10 times [2018-02-02 10:48:12,770 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:12,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:12,831 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 10:48:12,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:48:12,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:48:12,832 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:48:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:48:12,832 INFO L182 omatonBuilderFactory]: Interpolants [4080#(<= 10 entry_point_~len~0), 4081#(and (= alloc_17_~i~0 0) (<= |alloc_17_#in~len| alloc_17_~len)), 4082#(<= |alloc_17_#in~len| 0), 4078#true, 4079#false] [2018-02-02 10:48:12,832 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 10:48:12,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:48:12,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:48:12,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:48:12,833 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand 5 states. [2018-02-02 10:48:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:48:12,865 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2018-02-02 10:48:12,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:48:12,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-02-02 10:48:12,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:48:12,866 INFO L225 Difference]: With dead ends: 163 [2018-02-02 10:48:12,866 INFO L226 Difference]: Without dead ends: 160 [2018-02-02 10:48:12,866 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:48:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-02 10:48:12,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 137. [2018-02-02 10:48:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-02 10:48:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2018-02-02 10:48:12,870 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 71 [2018-02-02 10:48:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:48:12,870 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2018-02-02 10:48:12,870 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:48:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2018-02-02 10:48:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 10:48:12,871 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:48:12,871 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 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 10:48:12,871 INFO L371 AbstractCegarLoop]: === Iteration 20 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 10:48:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash 114739281, now seen corresponding path program 1 times [2018-02-02 10:48:12,872 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:48:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:48:12,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:48:12,901 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.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:48:12,905 INFO L168 Benchmark]: Toolchain (without parser) took 4532.28 ms. Allocated memory was 400.6 MB in the beginning and 683.7 MB in the end (delta: 283.1 MB). Free memory was 357.4 MB in the beginning and 469.5 MB in the end (delta: -112.2 MB). Peak memory consumption was 171.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:12,906 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 400.6 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:48:12,906 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.39 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:12,906 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 342.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:12,907 INFO L168 Benchmark]: RCFGBuilder took 236.67 ms. Allocated memory is still 400.6 MB. Free memory was 342.8 MB in the beginning and 318.0 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:12,907 INFO L168 Benchmark]: TraceAbstraction took 4112.14 ms. Allocated memory was 400.6 MB in the beginning and 683.7 MB in the end (delta: 283.1 MB). Free memory was 318.0 MB in the beginning and 469.5 MB in the end (delta: -151.5 MB). Peak memory consumption was 131.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:48:12,908 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.10 ms. Allocated memory is still 400.6 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.39 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 344.1 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.41 ms. Allocated memory is still 400.6 MB. Free memory was 344.1 MB in the beginning and 342.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 236.67 ms. Allocated memory is still 400.6 MB. Free memory was 342.8 MB in the beginning and 318.0 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4112.14 ms. Allocated memory was 400.6 MB in the beginning and 683.7 MB in the end (delta: 283.1 MB). Free memory was 318.0 MB in the beginning and 469.5 MB in the end (delta: -151.5 MB). Peak memory consumption was 131.6 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_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-48-12-915.csv Received shutdown request...