java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:40:08,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:40:08,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:40:08,240 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:40:08,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:40:08,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:40:08,242 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:40:08,244 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:40:08,245 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:40:08,246 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:40:08,247 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:40:08,247 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:40:08,248 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:40:08,249 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:40:08,250 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:40:08,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:40:08,253 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:40:08,254 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:40:08,255 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:40:08,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:40:08,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:40:08,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:40:08,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:40:08,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:40:08,259 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:40:08,260 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:40:08,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:40:08,261 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:40:08,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:40:08,261 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:40:08,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:40:08,262 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:40:08,271 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:40:08,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:40:08,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:40:08,272 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:40:08,272 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:40:08,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:40:08,272 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:40:08,272 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:40:08,272 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:40:08,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:40:08,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:40:08,273 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:40:08,273 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:40:08,273 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:40:08,273 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:40:08,273 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:40:08,274 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:40:08,274 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:40:08,274 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:40:08,274 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:40:08,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:40:08,274 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:40:08,275 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:40:08,275 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:40:08,275 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:40:08,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:40:08,310 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:40:08,312 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:40:08,313 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:40:08,313 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:40:08,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-02-04 00:40:08,451 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:40:08,452 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:40:08,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:40:08,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:40:08,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:40:08,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b089594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08, skipping insertion in model container [2018-02-04 00:40:08,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,470 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:40:08,502 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:40:08,586 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:40:08,601 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:40:08,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08 WrapperNode [2018-02-04 00:40:08,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:40:08,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:40:08,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:40:08,609 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:40:08,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (1/1) ... [2018-02-04 00:40:08,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:40:08,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:40:08,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:40:08,637 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:40:08,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40: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-04 00:40:08,671 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:40:08,671 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 00:40:08,672 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:40:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:40:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:40:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:40:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:40:08,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-04 00:40:08,673 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 00:40:08,673 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:40:08,674 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:40:08,674 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:40:08,762 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-04 00:40:08,829 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:40:08,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:40:08 BoogieIcfgContainer [2018-02-04 00:40:08,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:40:08,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:40:08,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:40:08,832 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:40:08,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:40:08" (1/3) ... [2018-02-04 00:40:08,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f8aa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:40:08, skipping insertion in model container [2018-02-04 00:40:08,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:40:08" (2/3) ... [2018-02-04 00:40:08,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f8aa80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:40:08, skipping insertion in model container [2018-02-04 00:40:08,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:40:08" (3/3) ... [2018-02-04 00:40:08,834 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-02-04 00:40:08,839 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:40:08,843 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 00:40:08,872 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:40:08,872 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:40:08,872 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:40:08,872 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:40:08,872 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:40:08,872 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:40:08,872 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:40:08,873 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:40:08,873 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:40:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-04 00:40:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:40:08,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:08,895 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:08,895 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:08,899 INFO L82 PathProgramCache]: Analyzing trace with hash 13572496, now seen corresponding path program 1 times [2018-02-04 00:40:08,901 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:08,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:08,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:08,946 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:08,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:08,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:09,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:09,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:09,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:40:09,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:40:09,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:40:09,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:40:09,150 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-02-04 00:40:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:09,184 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-02-04 00:40:09,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:40:09,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 00:40:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:09,196 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:40:09,196 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 00:40:09,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:40:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 00:40:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-02-04 00:40:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 00:40:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-02-04 00:40:09,226 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 17 [2018-02-04 00:40:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:09,227 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-02-04 00:40:09,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:40:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-02-04 00:40:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:40:09,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:09,227 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-04 00:40:09,228 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 64872882, now seen corresponding path program 1 times [2018-02-04 00:40:09,228 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:09,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:09,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,230 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:09,230 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:09,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:09,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:09,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:40:09,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:40:09,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:40:09,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:40:09,298 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-02-04 00:40:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:09,370 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-02-04 00:40:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:40:09,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 00:40:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:09,371 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:40:09,371 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:40:09,372 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-04 00:40:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:40:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-02-04 00:40:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 00:40:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-02-04 00:40:09,376 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 19 [2018-02-04 00:40:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:09,376 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-02-04 00:40:09,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:40:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-02-04 00:40:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:40:09,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:09,377 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-04 00:40:09,377 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash 64872883, now seen corresponding path program 1 times [2018-02-04 00:40:09,377 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:09,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:09,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,378 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:09,378 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:09,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:09,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:09,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:40:09,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:40:09,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:40:09,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:40:09,556 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-02-04 00:40:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:09,693 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-02-04 00:40:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:40:09,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-04 00:40:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:09,695 INFO L225 Difference]: With dead ends: 66 [2018-02-04 00:40:09,695 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 00:40:09,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:40:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 00:40:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-02-04 00:40:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 00:40:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-02-04 00:40:09,699 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2018-02-04 00:40:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:09,699 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-02-04 00:40:09,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:40:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-02-04 00:40:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:40:09,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:09,700 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:09,700 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1610907055, now seen corresponding path program 1 times [2018-02-04 00:40:09,700 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:09,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:09,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,701 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:09,701 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:09,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:09,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:09,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:40:09,733 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:40:09,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:40:09,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:40:09,733 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2018-02-04 00:40:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:09,773 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-02-04 00:40:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:40:09,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-02-04 00:40:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:09,774 INFO L225 Difference]: With dead ends: 70 [2018-02-04 00:40:09,774 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:40:09,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:40:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:40:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 00:40:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:40:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-02-04 00:40:09,780 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-02-04 00:40:09,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:09,780 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-02-04 00:40:09,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:40:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-02-04 00:40:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:40:09,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:09,781 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:09,781 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash -655458449, now seen corresponding path program 1 times [2018-02-04 00:40:09,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:09,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:09,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:09,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:09,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:09,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:09,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:40:09,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:40:09,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:40:09,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:40:09,814 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2018-02-04 00:40:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:09,835 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-02-04 00:40:09,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:40:09,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 00:40:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:09,836 INFO L225 Difference]: With dead ends: 60 [2018-02-04 00:40:09,836 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:40:09,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:40:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:40:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 00:40:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:40:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 00:40:09,840 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 24 [2018-02-04 00:40:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:09,840 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 00:40:09,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:40:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 00:40:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:40:09,841 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:09,841 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:09,842 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666846, now seen corresponding path program 1 times [2018-02-04 00:40:09,842 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:09,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:09,843 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,843 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:09,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:09,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:09,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:09,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:40:09,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:40:09,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:40:09,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:40:09,914 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-02-04 00:40:10,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:10,070 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 00:40:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:40:10,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-02-04 00:40:10,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:10,072 INFO L225 Difference]: With dead ends: 59 [2018-02-04 00:40:10,072 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 00:40:10,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:40:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 00:40:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 00:40:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 00:40:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 00:40:10,075 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 34 [2018-02-04 00:40:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:10,075 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 00:40:10,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:40:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 00:40:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:40:10,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:10,076 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:10,076 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:10,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666845, now seen corresponding path program 1 times [2018-02-04 00:40:10,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:10,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:10,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:10,077 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:10,078 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:10,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:10,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:10,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:40:10,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:40:10,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:40:10,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:40:10,129 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-02-04 00:40:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:10,146 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 00:40:10,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:40:10,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-02-04 00:40:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:10,147 INFO L225 Difference]: With dead ends: 62 [2018-02-04 00:40:10,147 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:40:10,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:40:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:40:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 00:40:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:40:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 00:40:10,151 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-02-04 00:40:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:10,151 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 00:40:10,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:40:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 00:40:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:40:10,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:10,152 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:10,152 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1908152085, now seen corresponding path program 1 times [2018-02-04 00:40:10,152 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:10,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:10,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:10,153 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:10,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:10,165 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:10,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:10,188 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:10,194 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:10,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:10,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:10,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-02-04 00:40:10,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:40:10,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:40:10,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:40:10,271 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-02-04 00:40:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:10,285 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 00:40:10,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:40:10,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-04 00:40:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:10,286 INFO L225 Difference]: With dead ends: 63 [2018-02-04 00:40:10,286 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 00:40:10,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:40:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 00:40:10,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 00:40:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 00:40:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-04 00:40:10,289 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 35 [2018-02-04 00:40:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:10,289 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-04 00:40:10,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:40:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-04 00:40:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 00:40:10,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:10,289 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, 1] [2018-02-04 00:40:10,289 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash -587259933, now seen corresponding path program 2 times [2018-02-04 00:40:10,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:10,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:10,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:10,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:10,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:10,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:10,329 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-04 00:40:10,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:10,329 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:10,335 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:40:10,364 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 00:40:10,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:10,368 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:10,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 00:40:10,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:10,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 00:40:10,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:10,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:40:10,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-04 00:40:12,625 WARN L143 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-04 00:40:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:40:12,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:40:12,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-02-04 00:40:12,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:40:12,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:40:12,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:40:12,912 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2018-02-04 00:40:18,561 WARN L143 SmtUtils]: Spent 5434ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-04 00:40:20,620 WARN L143 SmtUtils]: Spent 2037ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-04 00:40:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:20,917 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-02-04 00:40:20,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:40:20,917 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-04 00:40:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:20,918 INFO L225 Difference]: With dead ends: 63 [2018-02-04 00:40:20,918 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 00:40:20,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:40:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 00:40:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 00:40:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 00:40:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-02-04 00:40:20,922 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 36 [2018-02-04 00:40:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:20,922 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-02-04 00:40:20,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:40:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-02-04 00:40:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:40:20,923 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:20,923 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:20,924 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463170, now seen corresponding path program 1 times [2018-02-04 00:40:20,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:20,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:20,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:20,925 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:20,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:20,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 00:40:21,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:21,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:40:21,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:40:21,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:40:21,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:40:21,016 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 10 states. [2018-02-04 00:40:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:21,154 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-04 00:40:21,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:40:21,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-02-04 00:40:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:21,155 INFO L225 Difference]: With dead ends: 59 [2018-02-04 00:40:21,155 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 00:40:21,155 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:40:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 00:40:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 00:40:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 00:40:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 00:40:21,158 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 42 [2018-02-04 00:40:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:21,158 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 00:40:21,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:40:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 00:40:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:40:21,159 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:21,159 INFO L351 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:21,159 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:21,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463169, now seen corresponding path program 1 times [2018-02-04 00:40:21,160 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:21,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:21,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:21,161 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:21,161 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:21,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:21,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:21,210 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:21,215 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:21,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:21,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:21,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 00:40:21,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:40:21,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:40:21,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:40:21,268 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-02-04 00:40:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:21,283 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-02-04 00:40:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:40:21,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-04 00:40:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:21,284 INFO L225 Difference]: With dead ends: 62 [2018-02-04 00:40:21,284 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:40:21,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:40:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:40:21,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 00:40:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:40:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-02-04 00:40:21,286 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 42 [2018-02-04 00:40:21,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:21,286 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-02-04 00:40:21,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:40:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-02-04 00:40:21,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:40:21,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:21,287 INFO L351 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:21,287 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:21,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1854641017, now seen corresponding path program 2 times [2018-02-04 00:40:21,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:21,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:21,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:21,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:21,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:21,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:21,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:21,340 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:21,345 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:40:21,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 00:40:21,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:21,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:21,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-02-04 00:40:21,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:21,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 00:40:21,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:40:21,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 00:40:21,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-02-04 00:40:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 00:40:21,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 00:40:21,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-02-04 00:40:21,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:40:21,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:40:21,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-04 00:40:21,916 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 22 states. [2018-02-04 00:40:24,157 WARN L143 SmtUtils]: Spent 2015ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-04 00:40:26,257 WARN L143 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-04 00:40:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:26,539 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-02-04 00:40:26,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:40:26,540 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-02-04 00:40:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:26,540 INFO L225 Difference]: With dead ends: 61 [2018-02-04 00:40:26,540 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 00:40:26,541 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-02-04 00:40:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 00:40:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 00:40:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 00:40:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-02-04 00:40:26,543 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 43 [2018-02-04 00:40:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:26,544 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-02-04 00:40:26,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:40:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-02-04 00:40:26,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 00:40:26,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:26,545 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:26,545 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash -796850259, now seen corresponding path program 1 times [2018-02-04 00:40:26,545 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:26,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:26,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,546 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:26,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:26,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 00:40:26,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:26,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:40:26,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:40:26,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:40:26,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:40:26,593 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-02-04 00:40:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:26,626 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-02-04 00:40:26,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:40:26,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-02-04 00:40:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:26,626 INFO L225 Difference]: With dead ends: 61 [2018-02-04 00:40:26,626 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 00:40:26,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:40:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 00:40:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 00:40:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 00:40:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-04 00:40:26,629 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 42 [2018-02-04 00:40:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:26,629 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-04 00:40:26,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:40:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-04 00:40:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:40:26,630 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:26,630 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:26,630 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1073611946, now seen corresponding path program 1 times [2018-02-04 00:40:26,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:26,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:26,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,632 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:26,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:26,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-02-04 00:40:26,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:40:26,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 00:40:26,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:40:26,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:40:26,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:40:26,694 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 10 states. [2018-02-04 00:40:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:26,739 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 00:40:26,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:40:26,739 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-02-04 00:40:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:26,740 INFO L225 Difference]: With dead ends: 63 [2018-02-04 00:40:26,740 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 00:40:26,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:40:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 00:40:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 00:40:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 00:40:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-02-04 00:40:26,742 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 47 [2018-02-04 00:40:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:26,743 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-02-04 00:40:26,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:40:26,743 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-02-04 00:40:26,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 00:40:26,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:26,743 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:26,744 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash 348696970, now seen corresponding path program 1 times [2018-02-04 00:40:26,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:26,744 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:26,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:26,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:26,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:26,810 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:26,810 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:26,815 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:26,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:26,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:26,893 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:26,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 00:40:26,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:40:26,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:40:26,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:40:26,894 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 10 states. [2018-02-04 00:40:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:26,906 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-02-04 00:40:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 00:40:26,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-02-04 00:40:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:26,907 INFO L225 Difference]: With dead ends: 62 [2018-02-04 00:40:26,907 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 00:40:26,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:40:26,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 00:40:26,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-02-04 00:40:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 00:40:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-02-04 00:40:26,909 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-02-04 00:40:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:26,910 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-02-04 00:40:26,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:40:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-02-04 00:40:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-02-04 00:40:26,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:26,911 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:26,911 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash -648862830, now seen corresponding path program 2 times [2018-02-04 00:40:26,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:26,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:26,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,912 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:26,912 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:26,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:26,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:26,969 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:26,974 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:40:26,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:40:26,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:27,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:27,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:27,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-02-04 00:40:27,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 00:40:27,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 00:40:27,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:40:27,028 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2018-02-04 00:40:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:27,041 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-02-04 00:40:27,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:40:27,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-02-04 00:40:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:27,041 INFO L225 Difference]: With dead ends: 63 [2018-02-04 00:40:27,042 INFO L226 Difference]: Without dead ends: 61 [2018-02-04 00:40:27,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:40:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-04 00:40:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-04 00:40:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 00:40:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-02-04 00:40:27,043 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-02-04 00:40:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:27,044 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-02-04 00:40:27,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 00:40:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-02-04 00:40:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:40:27,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:27,044 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:27,045 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1508445558, now seen corresponding path program 3 times [2018-02-04 00:40:27,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:27,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:27,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:27,045 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:27,045 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:27,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:27,107 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:27,107 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:27,112 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:40:27,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-04 00:40:27,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:27,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:27,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:27,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-02-04 00:40:27,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:40:27,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:40:27,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:40:27,803 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 12 states. [2018-02-04 00:40:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:27,821 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-02-04 00:40:27,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:40:27,821 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-02-04 00:40:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:27,821 INFO L225 Difference]: With dead ends: 64 [2018-02-04 00:40:27,821 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 00:40:27,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:40:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 00:40:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 00:40:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 00:40:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-02-04 00:40:27,823 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-02-04 00:40:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:27,823 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-02-04 00:40:27,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:40:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-02-04 00:40:27,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:40:27,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:27,823 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:27,823 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:27,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1909260946, now seen corresponding path program 4 times [2018-02-04 00:40:27,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:27,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:27,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:27,824 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:27,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:27,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:27,888 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:27,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:27,888 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:27,894 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:40:27,921 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:40:27,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:27,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:27,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:27,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-02-04 00:40:27,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:40:27,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:40:27,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:40:27,950 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 13 states. [2018-02-04 00:40:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:27,980 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-02-04 00:40:27,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:40:27,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-02-04 00:40:27,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:27,980 INFO L225 Difference]: With dead ends: 65 [2018-02-04 00:40:27,980 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 00:40:27,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:40:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 00:40:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 00:40:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 00:40:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-02-04 00:40:27,982 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-02-04 00:40:27,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:27,982 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-02-04 00:40:27,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:40:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-02-04 00:40:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 00:40:27,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:27,983 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:27,983 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 483980170, now seen corresponding path program 5 times [2018-02-04 00:40:27,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:27,984 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:27,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:27,984 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:27,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:27,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:28,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:28,057 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:28,062 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:40:28,169 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 00:40:28,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:28,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:28,217 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:28,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-02-04 00:40:28,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 00:40:28,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 00:40:28,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:40:28,217 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-02-04 00:40:28,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:28,241 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-02-04 00:40:28,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:40:28,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-02-04 00:40:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:28,242 INFO L225 Difference]: With dead ends: 66 [2018-02-04 00:40:28,242 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 00:40:28,243 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:40:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 00:40:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-02-04 00:40:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 00:40:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-02-04 00:40:28,245 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-02-04 00:40:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:28,245 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-02-04 00:40:28,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 00:40:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-02-04 00:40:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-04 00:40:28,246 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:28,246 INFO L351 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:28,246 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash -750050926, now seen corresponding path program 6 times [2018-02-04 00:40:28,247 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:28,247 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:28,247 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:28,248 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:28,248 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:28,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:28,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:28,363 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:28,369 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 00:40:29,006 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 00:40:29,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:29,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:29,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:29,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-02-04 00:40:29,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:40:29,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:40:29,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:40:29,035 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 15 states. [2018-02-04 00:40:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:29,055 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-02-04 00:40:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:40:29,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-02-04 00:40:29,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:29,056 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:40:29,056 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 00:40:29,056 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:40:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 00:40:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-02-04 00:40:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 00:40:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-02-04 00:40:29,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-02-04 00:40:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:29,058 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-02-04 00:40:29,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:40:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-02-04 00:40:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 00:40:29,058 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:29,058 INFO L351 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:29,058 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash -350309238, now seen corresponding path program 7 times [2018-02-04 00:40:29,058 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:29,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:29,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:29,059 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:29,059 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:29,071 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:29,173 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:29,173 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:29,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:29,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:29,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:29,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-02-04 00:40:29,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 00:40:29,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 00:40:29,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:40:29,228 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 16 states. [2018-02-04 00:40:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:29,248 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-02-04 00:40:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 00:40:29,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2018-02-04 00:40:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:29,249 INFO L225 Difference]: With dead ends: 68 [2018-02-04 00:40:29,249 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 00:40:29,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:40:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 00:40:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-02-04 00:40:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-04 00:40:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-02-04 00:40:29,251 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-02-04 00:40:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:29,251 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-02-04 00:40:29,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 00:40:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-02-04 00:40:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 00:40:29,251 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:29,251 INFO L351 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:29,251 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash -843218798, now seen corresponding path program 8 times [2018-02-04 00:40:29,252 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:29,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:29,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:29,252 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:40:29,252 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:29,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:29,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:29,365 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:29,370 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 00:40:29,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 00:40:29,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:29,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:29,403 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:29,420 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:29,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-02-04 00:40:29,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 00:40:29,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 00:40:29,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:40:29,421 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 17 states. [2018-02-04 00:40:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:29,442 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-02-04 00:40:29,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 00:40:29,442 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-04 00:40:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:29,442 INFO L225 Difference]: With dead ends: 69 [2018-02-04 00:40:29,442 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:40:29,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:40:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:40:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 00:40:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:40:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-02-04 00:40:29,444 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-02-04 00:40:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:29,444 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-02-04 00:40:29,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 00:40:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-02-04 00:40:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-02-04 00:40:29,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:29,444 INFO L351 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:29,444 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1056454026, now seen corresponding path program 9 times [2018-02-04 00:40:29,444 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:29,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:29,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:29,445 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:29,445 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:29,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:29,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:29,628 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:29,635 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 00:40:31,328 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-04 00:40:31,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:31,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:31,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:31,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2018-02-04 00:40:31,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 00:40:31,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 00:40:31,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 00:40:31,552 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 37 states. [2018-02-04 00:40:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:31,661 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-02-04 00:40:31,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:40:31,662 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2018-02-04 00:40:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:31,662 INFO L225 Difference]: With dead ends: 70 [2018-02-04 00:40:31,662 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 00:40:31,662 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1145, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 00:40:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 00:40:31,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 00:40:31,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 00:40:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-02-04 00:40:31,664 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-02-04 00:40:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:31,664 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-02-04 00:40:31,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 00:40:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-02-04 00:40:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 00:40:31,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:31,664 INFO L351 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:31,665 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash -183230574, now seen corresponding path program 10 times [2018-02-04 00:40:31,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:31,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:31,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:31,665 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:31,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:31,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:31,844 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:31,844 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:31,852 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 00:40:31,881 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 00:40:31,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:31,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:31,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:31,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-02-04 00:40:31,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:40:31,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:40:31,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:40:31,909 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 19 states. [2018-02-04 00:40:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:31,933 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-02-04 00:40:31,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:40:31,933 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-02-04 00:40:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:31,933 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:40:31,933 INFO L226 Difference]: Without dead ends: 69 [2018-02-04 00:40:31,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:40:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-04 00:40:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-02-04 00:40:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 00:40:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-02-04 00:40:31,935 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-02-04 00:40:31,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:31,935 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-02-04 00:40:31,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:40:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-02-04 00:40:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-02-04 00:40:31,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:31,935 INFO L351 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:31,935 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash 41252490, now seen corresponding path program 11 times [2018-02-04 00:40:31,936 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:31,936 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:31,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:31,936 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:31,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:40:31,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:40:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:32,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:40:32,073 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 00:40:32,078 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 00:40:32,914 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-02-04 00:40:32,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 00:40:32,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:40:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:40:32,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:40:32,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-02-04 00:40:32,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 00:40:32,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 00:40:32,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:40:32,943 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 20 states. [2018-02-04 00:40:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:40:32,982 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-02-04 00:40:32,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 00:40:32,983 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-02-04 00:40:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:40:32,983 INFO L225 Difference]: With dead ends: 72 [2018-02-04 00:40:32,983 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 00:40:32,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:40:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 00:40:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 00:40:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 00:40:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-02-04 00:40:32,985 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-02-04 00:40:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:40:32,985 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-02-04 00:40:32,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 00:40:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-02-04 00:40:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 00:40:32,985 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:40:32,985 INFO L351 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:40:32,985 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-02-04 00:40:32,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1589707118, now seen corresponding path program 12 times [2018-02-04 00:40:32,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:40:32,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:40:32,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:32,986 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 00:40:32,986 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:40:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:40:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 00:40:33,034 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 00:40:33,046 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-02-04 00:40:33,048 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 00:40:33,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:40:33 BoogieIcfgContainer [2018-02-04 00:40:33,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:40:33,060 INFO L168 Benchmark]: Toolchain (without parser) took 24608.55 ms. Allocated memory was 400.0 MB in the beginning and 731.4 MB in the end (delta: 331.4 MB). Free memory was 356.9 MB in the beginning and 630.2 MB in the end (delta: -273.3 MB). Peak memory consumption was 58.1 MB. Max. memory is 5.3 GB. [2018-02-04 00:40:33,061 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:40:33,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.83 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 343.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:40:33,061 INFO L168 Benchmark]: Boogie Preprocessor took 27.64 ms. Allocated memory is still 400.0 MB. Free memory was 343.7 MB in the beginning and 342.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:40:33,061 INFO L168 Benchmark]: RCFGBuilder took 193.35 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 319.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:40:33,061 INFO L168 Benchmark]: TraceAbstraction took 24229.26 ms. Allocated memory was 400.0 MB in the beginning and 731.4 MB in the end (delta: 331.4 MB). Free memory was 319.1 MB in the beginning and 630.2 MB in the end (delta: -311.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 5.3 GB. [2018-02-04 00:40:33,062 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.11 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.83 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 343.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.64 ms. Allocated memory is still 400.0 MB. Free memory was 343.7 MB in the beginning and 342.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.35 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 319.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 24229.26 ms. Allocated memory was 400.0 MB in the beginning and 731.4 MB in the end (delta: 331.4 MB). Free memory was 319.1 MB in the beginning and 630.2 MB in the end (delta: -311.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1441]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1441. Possible FailurePath: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={19:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={19:0}, malloc(size)={19:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={19:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={19:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={19:0}, memset(kobj, 0, sizeof(*kobj))={19:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={19:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={19:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={19:12}, kref={19:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={19:4}] [L1099] FCALL list->next = list VAL [list={19:4}, list={19:4}] [L1100] FCALL list->prev = list VAL [list={19:4}, list={19:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={19:0}, kobj={19:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1414] RET return kobj; VAL [\result={19:0}, kobj={19:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1437] RET kobj = ldv_kobject_create() [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 65 locations, 9 error locations. UNSAFE Result, 24.1s OverallTime, 26 OverallIterations, 16 TraceHistogramMax, 13.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1289 SDtfs, 263 SDslu, 9962 SDs, 0 SdLazy, 2292 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1134 GetRequests, 826 SyntacticMatches, 1 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1958 ConstructedInterpolants, 53 QuantifiedInterpolants, 225017 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3798 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 49/1396 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-40-33-067.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-40-33-067.csv Received shutdown request...