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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:55:51,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:55:51,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:55:51,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:55:51,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:55:51,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:55:51,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:55:51,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:55:51,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:55:51,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:55:51,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:55:51,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:55:51,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:55:51,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:55:51,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:55:51,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:55:51,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:55:51,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:55:51,134 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:55:51,135 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:55:51,138 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:55:51,138 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:55:51,138 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:55:51,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:55:51,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:55:51,141 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:55:51,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:55:51,142 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:55:51,142 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:55:51,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:55:51,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:55:51,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:55:51,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:55:51,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:55:51,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:55:51,156 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:55:51,156 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:55:51,156 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:55:51,156 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:55:51,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:55:51,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:55:51,157 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:55:51,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:55:51,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:55:51,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:55:51,158 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:55:51,158 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:55:51,159 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:55:51,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:55:51,159 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:55:51,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:55:51,159 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:55:51,160 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:55:51,160 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:55:51,160 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:55:51,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:55:51,160 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:55:51,161 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:55:51,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:55:51,161 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:55:51,161 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:55:51,161 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:55:51,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:55:51,162 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:55:51,163 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:55:51,163 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:55:51,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:55:51,211 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:55:51,214 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:55:51,216 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:55:51,216 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:55:51,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-31 08:55:51,421 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:55:51,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:55:51,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:55:51,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:55:51,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:55:51,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,447 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a301ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51, skipping insertion in model container [2018-01-31 08:55:51,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,468 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:55:51,547 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:55:51,734 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:55:51,767 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:55:51,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51 WrapperNode [2018-01-31 08:55:51,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:55:51,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:55:51,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:55:51,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:55:51,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... [2018-01-31 08:55:51,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:55:51,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:55:51,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:55:51,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:55:51,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (1/1) ... No working directory specified, using /storage/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-01-31 08:55:51,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:55:51,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:55:51,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:55:51,908 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:55:51,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-31 08:55:51,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-31 08:55:51,908 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-31 08:55:51,909 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-31 08:55:51,909 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:55:51,909 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:55:51,909 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:55:51,909 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:55:51,909 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:55:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:55:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:55:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:55:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:55:51,910 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-31 08:55:51,910 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-31 08:55:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:55:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:55:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-31 08:55:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:55:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-31 08:55:51,911 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-31 08:55:51,912 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-31 08:55:51,912 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-31 08:55:51,912 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-31 08:55:51,912 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:55:51,912 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:55:51,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:55:51,912 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:55:52,237 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-31 08:55:52,437 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:55:52,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:55:52 BoogieIcfgContainer [2018-01-31 08:55:52,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:55:52,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:55:52,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:55:52,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:55:52,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:55:51" (1/3) ... [2018-01-31 08:55:52,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c812769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:55:52, skipping insertion in model container [2018-01-31 08:55:52,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:55:51" (2/3) ... [2018-01-31 08:55:52,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c812769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:55:52, skipping insertion in model container [2018-01-31 08:55:52,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:55:52" (3/3) ... [2018-01-31 08:55:52,446 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-31 08:55:52,456 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:55:52,467 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 08:55:52,512 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:55:52,512 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:55:52,512 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:55:52,513 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:55:52,513 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:55:52,513 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:55:52,513 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:55:52,513 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:55:52,513 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:55:52,540 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-01-31 08:55:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-31 08:55:52,547 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:52,550 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-01-31 08:55:52,550 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-01-31 08:55:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash -319557672, now seen corresponding path program 1 times [2018-01-31 08:55:52,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:52,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:52,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:52,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:52,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:52,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:53,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:53,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:55:53,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:55:53,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:55:53,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:55:53,262 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 5 states. [2018-01-31 08:55:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:53,472 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2018-01-31 08:55:53,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:55:53,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-31 08:55:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:53,487 INFO L225 Difference]: With dead ends: 136 [2018-01-31 08:55:53,488 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 08:55:53,491 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:55:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 08:55:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-01-31 08:55:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 08:55:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-31 08:55:53,532 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 22 [2018-01-31 08:55:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:53,532 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-31 08:55:53,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:55:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-31 08:55:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:55:53,536 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:53,536 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:53,537 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-01-31 08:55:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash -285015550, now seen corresponding path program 1 times [2018-01-31 08:55:53,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:53,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:53,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:53,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:53,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:53,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:54,027 WARN L146 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:55:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:54,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:54,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:55:54,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:55:54,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:55:54,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:55:54,195 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 7 states. [2018-01-31 08:55:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:54,701 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-31 08:55:54,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:55:54,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-31 08:55:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:54,705 INFO L225 Difference]: With dead ends: 82 [2018-01-31 08:55:54,705 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 08:55:54,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:55:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 08:55:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-01-31 08:55:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 08:55:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-31 08:55:54,724 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 23 [2018-01-31 08:55:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:54,724 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-31 08:55:54,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:55:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-31 08:55:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-31 08:55:54,728 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:54,728 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:54,728 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-01-31 08:55:54,729 INFO L82 PathProgramCache]: Analyzing trace with hash -285015551, now seen corresponding path program 1 times [2018-01-31 08:55:54,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:54,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:54,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:54,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:54,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:54,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:54,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:54,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:55:54,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:55:54,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:55:54,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:55:54,830 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 6 states. [2018-01-31 08:55:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:55,074 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-31 08:55:55,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:55:55,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-31 08:55:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:55,097 INFO L225 Difference]: With dead ends: 81 [2018-01-31 08:55:55,098 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:55:55,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:55:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:55:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-31 08:55:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 08:55:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-01-31 08:55:55,109 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 23 [2018-01-31 08:55:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:55,110 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-01-31 08:55:55,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:55:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-01-31 08:55:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:55:55,111 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:55,112 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] [2018-01-31 08:55:55,112 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-01-31 08:55:55,114 INFO L82 PathProgramCache]: Analyzing trace with hash 295001646, now seen corresponding path program 1 times [2018-01-31 08:55:55,114 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:55,114 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:55,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:55,115 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:55,115 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:55,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:55,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:55,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:55:55,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:55:55,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:55:55,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:55:55,200 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 3 states. [2018-01-31 08:55:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:55,311 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-01-31 08:55:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:55:55,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-31 08:55:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:55,312 INFO L225 Difference]: With dead ends: 86 [2018-01-31 08:55:55,313 INFO L226 Difference]: Without dead ends: 70 [2018-01-31 08:55:55,313 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-01-31 08:55:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-31 08:55:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-31 08:55:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 08:55:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-01-31 08:55:55,322 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 29 [2018-01-31 08:55:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:55,322 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-01-31 08:55:55,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:55:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-01-31 08:55:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-31 08:55:55,323 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:55,324 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] [2018-01-31 08:55:55,324 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-01-31 08:55:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1354721476, now seen corresponding path program 1 times [2018-01-31 08:55:55,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:55,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:55,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:55,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:55,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:55,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:55,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:55,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:55:55,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:55:55,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:55:55,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:55:55,407 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2018-01-31 08:55:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:55,481 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-01-31 08:55:55,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:55:55,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-31 08:55:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:55,483 INFO L225 Difference]: With dead ends: 78 [2018-01-31 08:55:55,484 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 08:55:55,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:55:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 08:55:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-31 08:55:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 08:55:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-31 08:55:55,493 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2018-01-31 08:55:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:55,493 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-31 08:55:55,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:55:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-31 08:55:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:55:55,495 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:55,495 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:55,495 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-01-31 08:55:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1004761274, now seen corresponding path program 1 times [2018-01-31 08:55:55,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:55,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:55,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:55,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:55,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:55,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:55,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:55,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:55:55,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:55:55,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:55:55,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:55:55,686 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 10 states. [2018-01-31 08:55:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:56,690 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-01-31 08:55:56,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:55:56,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-31 08:55:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:56,692 INFO L225 Difference]: With dead ends: 69 [2018-01-31 08:55:56,692 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 08:55:56,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:55:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 08:55:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-31 08:55:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 08:55:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-01-31 08:55:56,701 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 39 [2018-01-31 08:55:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:56,702 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-01-31 08:55:56,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:55:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-01-31 08:55:56,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:55:56,703 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:56,703 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:56,703 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-01-31 08:55:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1004761275, now seen corresponding path program 1 times [2018-01-31 08:55:56,704 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:56,704 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:56,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:56,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:56,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:56,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:56,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:55:56,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:55:56,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:55:56,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:55:56,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:55:56,804 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 4 states. [2018-01-31 08:55:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:56,854 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-01-31 08:55:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:55:56,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-31 08:55:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:56,856 INFO L225 Difference]: With dead ends: 110 [2018-01-31 08:55:56,856 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 08:55:56,857 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-01-31 08:55:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 08:55:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-01-31 08:55:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 08:55:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-01-31 08:55:56,866 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 39 [2018-01-31 08:55:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:56,866 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-01-31 08:55:56,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:55:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-01-31 08:55:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:55:56,868 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:56,868 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:56,869 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-01-31 08:55:56,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1624195129, now seen corresponding path program 1 times [2018-01-31 08:55:56,869 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:56,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:56,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:56,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:56,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:56,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:56,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:56,961 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:55:56,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:57,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:57,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:55:57,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-31 08:55:57,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:55:57,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:55:57,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:55:57,143 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 6 states. [2018-01-31 08:55:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:55:57,206 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2018-01-31 08:55:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:55:57,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-31 08:55:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:55:57,207 INFO L225 Difference]: With dead ends: 114 [2018-01-31 08:55:57,207 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 08:55:57,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:55:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 08:55:57,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-01-31 08:55:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:55:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-01-31 08:55:57,218 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 43 [2018-01-31 08:55:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:55:57,218 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-01-31 08:55:57,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:55:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-01-31 08:55:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:55:57,220 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:55:57,220 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:55:57,220 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-01-31 08:55:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash -2077548361, now seen corresponding path program 2 times [2018-01-31 08:55:57,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:55:57,221 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:55:57,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:57,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:55:57,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:55:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:55:57,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:55:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:55:57,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:55:57,596 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:55:57,603 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:55:57,635 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:55:57,648 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:55:57,656 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:55:57,714 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-01-31 08:55:57,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:57,871 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-01-31 08:55:57,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:55:57,887 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-01-31 08:55:57,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:55:58,687 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 45 DAG size of output 17 [2018-01-31 08:55:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:55:59,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:55:59,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-31 08:55:59,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:55:59,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:55:59,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:55:59,025 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 19 states. [2018-01-31 08:56:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:00,521 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-31 08:56:00,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:56:00,554 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-31 08:56:00,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:00,556 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:56:00,556 INFO L226 Difference]: Without dead ends: 79 [2018-01-31 08:56:00,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:56:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-31 08:56:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-01-31 08:56:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 08:56:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-01-31 08:56:00,569 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 47 [2018-01-31 08:56:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:00,569 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-01-31 08:56:00,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:56:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-01-31 08:56:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:56:00,571 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:00,571 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:00,572 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-01-31 08:56:00,572 INFO L82 PathProgramCache]: Analyzing trace with hash 557031604, now seen corresponding path program 1 times [2018-01-31 08:56:00,572 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:00,572 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:00,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:00,574 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:00,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:00,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-31 08:56:00,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:00,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 08:56:00,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:56:00,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:56:00,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:56:00,729 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 12 states. [2018-01-31 08:56:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:01,068 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-01-31 08:56:01,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:56:01,068 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-31 08:56:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:01,069 INFO L225 Difference]: With dead ends: 76 [2018-01-31 08:56:01,069 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 08:56:01,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:56:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 08:56:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 08:56:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 08:56:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-01-31 08:56:01,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 56 [2018-01-31 08:56:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:01,078 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-01-31 08:56:01,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:56:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-01-31 08:56:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 08:56:01,080 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:01,080 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:01,080 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-01-31 08:56:01,080 INFO L82 PathProgramCache]: Analyzing trace with hash 557031605, now seen corresponding path program 1 times [2018-01-31 08:56:01,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:01,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:01,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:01,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:01,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:01,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:01,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:01,611 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:01,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:01,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:01,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:01,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:01,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-31 08:56:01,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:56:01,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:56:01,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:56:01,719 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 8 states. [2018-01-31 08:56:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:01,836 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2018-01-31 08:56:01,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:56:01,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-31 08:56:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:01,841 INFO L225 Difference]: With dead ends: 116 [2018-01-31 08:56:01,841 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 08:56:01,841 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:56:01,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 08:56:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-01-31 08:56:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 08:56:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-01-31 08:56:01,852 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 56 [2018-01-31 08:56:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:01,852 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-01-31 08:56:01,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:56:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-01-31 08:56:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 08:56:01,854 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:01,854 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:01,854 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-01-31 08:56:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -984810249, now seen corresponding path program 2 times [2018-01-31 08:56:01,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:01,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:01,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:01,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:01,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:01,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:02,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:02,002 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:02,017 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:56:02,040 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:02,044 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:02,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:02,068 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-01-31 08:56:02,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:02,163 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-01-31 08:56:02,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:56:02,175 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-01-31 08:56:02,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-31 08:56:04,446 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-31 08:56:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-31 08:56:05,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:56:05,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-31 08:56:05,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:56:05,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:56:05,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:56:05,009 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 22 states. [2018-01-31 08:56:07,285 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:56:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:08,897 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-01-31 08:56:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:56:08,898 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-31 08:56:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:08,898 INFO L225 Difference]: With dead ends: 118 [2018-01-31 08:56:08,898 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:56:08,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:56:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:56:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-01-31 08:56:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:56:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-01-31 08:56:08,912 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 60 [2018-01-31 08:56:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:08,913 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-01-31 08:56:08,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:56:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-01-31 08:56:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-31 08:56:08,920 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:08,920 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:08,920 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-01-31 08:56:08,920 INFO L82 PathProgramCache]: Analyzing trace with hash 554912594, now seen corresponding path program 1 times [2018-01-31 08:56:08,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:08,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:08,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:08,922 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:08,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:08,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:56:09,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:09,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:56:09,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:56:09,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:56:09,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:56:09,070 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 8 states. [2018-01-31 08:56:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:09,119 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-01-31 08:56:09,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:56:09,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-31 08:56:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:09,120 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:56:09,120 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:56:09,120 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:56:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:56:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-31 08:56:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:56:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-01-31 08:56:09,134 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 63 [2018-01-31 08:56:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:09,134 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-01-31 08:56:09,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:56:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-01-31 08:56:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:56:09,135 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:09,136 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:09,136 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-01-31 08:56:09,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1424216055, now seen corresponding path program 1 times [2018-01-31 08:56:09,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:09,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:09,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:09,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:09,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:09,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-31 08:56:09,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:56:09,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:56:09,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:56:09,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:56:09,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:56:09,738 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 10 states. [2018-01-31 08:56:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:09,837 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-01-31 08:56:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:56:09,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-01-31 08:56:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:09,839 INFO L225 Difference]: With dead ends: 93 [2018-01-31 08:56:09,839 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:56:09,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:56:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:56:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-31 08:56:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-31 08:56:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-01-31 08:56:09,850 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 68 [2018-01-31 08:56:09,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:09,850 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-01-31 08:56:09,850 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:56:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-01-31 08:56:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:56:09,854 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:09,854 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:56:09,854 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-01-31 08:56:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2116538207, now seen corresponding path program 1 times [2018-01-31 08:56:09,855 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:09,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:09,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:09,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:09,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:09,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:10,020 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:10,020 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:10,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:10,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:10,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:10,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-31 08:56:10,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:56:10,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:56:10,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:56:10,131 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 10 states. [2018-01-31 08:56:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:10,299 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-01-31 08:56:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:56:10,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-01-31 08:56:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:10,300 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:56:10,301 INFO L226 Difference]: Without dead ends: 87 [2018-01-31 08:56:10,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 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-01-31 08:56:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-31 08:56:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-31 08:56:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:56:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-01-31 08:56:10,311 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 79 [2018-01-31 08:56:10,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:10,312 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-01-31 08:56:10,312 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:56:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-01-31 08:56:10,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-31 08:56:10,313 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:10,313 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:56:10,313 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-01-31 08:56:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash -648140257, now seen corresponding path program 2 times [2018-01-31 08:56:10,313 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:10,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:10,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:10,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:10,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:10,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:10,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:10,609 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:10,614 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:56:10,643 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:10,655 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:10,656 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:10,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:10,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:10,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-31 08:56:10,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:56:10,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:56:10,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:56:10,707 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 11 states. [2018-01-31 08:56:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:10,832 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-01-31 08:56:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:56:10,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2018-01-31 08:56:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:10,833 INFO L225 Difference]: With dead ends: 124 [2018-01-31 08:56:10,833 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 08:56:10,834 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:56:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 08:56:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2018-01-31 08:56:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:56:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-01-31 08:56:10,842 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 83 [2018-01-31 08:56:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:10,842 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-01-31 08:56:10,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:56:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-01-31 08:56:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-01-31 08:56:10,843 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:10,843 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:56:10,843 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-01-31 08:56:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1573964643, now seen corresponding path program 3 times [2018-01-31 08:56:10,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:10,844 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:10,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:10,844 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:10,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:10,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:10,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:11,018 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:11,023 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:56:11,049 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,058 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,068 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,094 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,185 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,301 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,378 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,411 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:11,412 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:11,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:11,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:11,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-01-31 08:56:11,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:56:11,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:56:11,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:56:11,633 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 25 states. [2018-01-31 08:56:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:11,819 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-01-31 08:56:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:56:11,819 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2018-01-31 08:56:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:11,820 INFO L225 Difference]: With dead ends: 128 [2018-01-31 08:56:11,820 INFO L226 Difference]: Without dead ends: 95 [2018-01-31 08:56:11,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-01-31 08:56:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-31 08:56:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-01-31 08:56:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-31 08:56:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-01-31 08:56:11,835 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 87 [2018-01-31 08:56:11,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:11,835 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-01-31 08:56:11,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:56:11,836 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-01-31 08:56:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-31 08:56:11,837 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:11,837 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:56:11,837 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-01-31 08:56:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash 777703451, now seen corresponding path program 4 times [2018-01-31 08:56:11,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:11,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:11,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:11,839 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:11,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:11,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:11,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:11,961 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:11,967 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:56:12,021 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:12,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:12,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:12,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-31 08:56:12,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:56:12,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:56:12,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:56:12,081 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 13 states. [2018-01-31 08:56:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:12,292 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-01-31 08:56:12,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:56:12,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2018-01-31 08:56:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:12,293 INFO L225 Difference]: With dead ends: 132 [2018-01-31 08:56:12,293 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 08:56:12,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 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-01-31 08:56:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 08:56:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-01-31 08:56:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-31 08:56:12,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-01-31 08:56:12,304 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 91 [2018-01-31 08:56:12,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:12,305 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-01-31 08:56:12,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:56:12,305 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-01-31 08:56:12,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-31 08:56:12,306 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:12,306 INFO L351 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:56:12,306 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-01-31 08:56:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1009810585, now seen corresponding path program 5 times [2018-01-31 08:56:12,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:12,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:12,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:12,308 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:12,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:12,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:12,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:12,899 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:12,905 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:56:12,918 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:12,920 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:12,922 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:12,926 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:12,933 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:12,940 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:12,961 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:13,042 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:13,162 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:13,222 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:13,225 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:13,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:13,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:13,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-01-31 08:56:13,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 08:56:13,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 08:56:13,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:56:13,295 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 14 states. [2018-01-31 08:56:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:13,398 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-01-31 08:56:13,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:56:13,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-01-31 08:56:13,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:13,399 INFO L225 Difference]: With dead ends: 136 [2018-01-31 08:56:13,399 INFO L226 Difference]: Without dead ends: 103 [2018-01-31 08:56:13,400 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:56:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-31 08:56:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-01-31 08:56:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 08:56:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-01-31 08:56:13,414 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 95 [2018-01-31 08:56:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:13,414 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-01-31 08:56:13,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 08:56:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-01-31 08:56:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-31 08:56:13,417 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:13,417 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-31 08:56:13,417 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-01-31 08:56:13,417 INFO L82 PathProgramCache]: Analyzing trace with hash -700466665, now seen corresponding path program 6 times [2018-01-31 08:56:13,418 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:13,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:13,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:13,419 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:13,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:13,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:13,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:13,655 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:13,660 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:56:13,685 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:13,694 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:13,701 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:13,743 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:13,848 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:13,994 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:14,697 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:16,137 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:17,204 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:18,151 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:20,033 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:56:20,035 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:20,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:20,084 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:20,084 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-31 08:56:20,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:56:20,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:56:20,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:56:20,085 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 15 states. [2018-01-31 08:56:20,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:20,326 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-01-31 08:56:20,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:56:20,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-01-31 08:56:20,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:20,327 INFO L225 Difference]: With dead ends: 140 [2018-01-31 08:56:20,327 INFO L226 Difference]: Without dead ends: 107 [2018-01-31 08:56:20,328 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:56:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-31 08:56:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-01-31 08:56:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-31 08:56:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-01-31 08:56:20,346 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 99 [2018-01-31 08:56:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:20,347 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-01-31 08:56:20,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:56:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-01-31 08:56:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-01-31 08:56:20,348 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:20,348 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 11, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:20,348 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-01-31 08:56:20,348 INFO L82 PathProgramCache]: Analyzing trace with hash 861407381, now seen corresponding path program 7 times [2018-01-31 08:56:20,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:20,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:20,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:20,349 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:20,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:20,370 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:21,058 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:21,058 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:21,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:21,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:21,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:21,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-31 08:56:21,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:56:21,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:56:21,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:56:21,156 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 16 states. [2018-01-31 08:56:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:21,573 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-01-31 08:56:21,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:56:21,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-01-31 08:56:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:21,574 INFO L225 Difference]: With dead ends: 144 [2018-01-31 08:56:21,574 INFO L226 Difference]: Without dead ends: 111 [2018-01-31 08:56:21,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:56:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-31 08:56:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-01-31 08:56:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-31 08:56:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-01-31 08:56:21,589 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 103 [2018-01-31 08:56:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:21,589 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-01-31 08:56:21,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:56:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-01-31 08:56:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-31 08:56:21,590 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:21,590 INFO L351 BasicCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:21,590 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-01-31 08:56:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1769412589, now seen corresponding path program 8 times [2018-01-31 08:56:21,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:21,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:21,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:21,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:56:21,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:21,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:21,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:21,991 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:21,996 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:56:22,028 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:22,043 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:22,045 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:22,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:22,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:22,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-31 08:56:22,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-31 08:56:22,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-31 08:56:22,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:56:22,084 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 17 states. [2018-01-31 08:56:22,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:22,237 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-01-31 08:56:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-31 08:56:22,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-01-31 08:56:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:22,275 INFO L225 Difference]: With dead ends: 148 [2018-01-31 08:56:22,275 INFO L226 Difference]: Without dead ends: 115 [2018-01-31 08:56:22,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:56:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-31 08:56:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-31 08:56:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:56:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-01-31 08:56:22,288 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 107 [2018-01-31 08:56:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:22,288 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-01-31 08:56:22,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-31 08:56:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-01-31 08:56:22,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-01-31 08:56:22,289 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:22,289 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:22,289 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-01-31 08:56:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash 790747281, now seen corresponding path program 9 times [2018-01-31 08:56:22,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:22,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:22,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:22,290 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:22,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:22,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:22,529 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:22,529 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:22,534 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:56:22,566 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:22,580 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:22,601 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:22,694 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:22,794 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:23,051 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:23,128 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:23,247 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:23,675 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:23,843 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:24,082 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:24,408 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:25,207 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:25,459 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:56:25,461 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:25,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:25,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:25,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2018-01-31 08:56:25,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:56:25,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:56:25,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:56:25,739 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 37 states. [2018-01-31 08:56:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:25,954 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-01-31 08:56:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:56:25,954 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 111 [2018-01-31 08:56:25,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:25,955 INFO L225 Difference]: With dead ends: 152 [2018-01-31 08:56:25,955 INFO L226 Difference]: Without dead ends: 119 [2018-01-31 08:56:25,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:56:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-31 08:56:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-01-31 08:56:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:56:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-01-31 08:56:25,971 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 111 [2018-01-31 08:56:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:25,971 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-01-31 08:56:25,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:56:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-01-31 08:56:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-31 08:56:25,972 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:25,973 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:25,973 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-01-31 08:56:25,973 INFO L82 PathProgramCache]: Analyzing trace with hash -122529265, now seen corresponding path program 10 times [2018-01-31 08:56:25,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:25,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:25,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:25,974 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:25,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:25,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:26,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:26,280 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:26,286 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:56:26,490 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:26,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:26,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:26,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-31 08:56:26,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:56:26,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:56:26,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:56:26,536 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 19 states. [2018-01-31 08:56:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:26,628 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-01-31 08:56:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:56:26,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 115 [2018-01-31 08:56:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:26,629 INFO L225 Difference]: With dead ends: 156 [2018-01-31 08:56:26,629 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 08:56:26,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:56:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 08:56:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-01-31 08:56:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 08:56:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-01-31 08:56:26,643 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 115 [2018-01-31 08:56:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:26,643 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-01-31 08:56:26,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:56:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-01-31 08:56:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-31 08:56:26,644 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:26,644 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:26,644 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-01-31 08:56:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1693848435, now seen corresponding path program 11 times [2018-01-31 08:56:26,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:26,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:26,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:26,646 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:26,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:56:26,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:56:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:27,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:56:27,027 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-31 08:56:27,032 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:56:27,044 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,051 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,053 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,057 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,070 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,081 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,099 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,159 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,211 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,301 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,329 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,373 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,487 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,661 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,751 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,862 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:56:27,865 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:56:27,870 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:56:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:56:27,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:56:27,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-01-31 08:56:27,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-31 08:56:27,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-31 08:56:27,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:56:27,928 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 20 states. [2018-01-31 08:56:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:56:28,046 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-01-31 08:56:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:56:28,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-01-31 08:56:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:56:28,047 INFO L225 Difference]: With dead ends: 160 [2018-01-31 08:56:28,047 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 08:56:28,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:56:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 08:56:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2018-01-31 08:56:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-31 08:56:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-01-31 08:56:28,059 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 119 [2018-01-31 08:56:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:56:28,059 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-01-31 08:56:28,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-31 08:56:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-01-31 08:56:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-01-31 08:56:28,060 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:56:28,061 INFO L351 BasicCegarLoop]: trace histogram [16, 16, 16, 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, 1, 1, 1, 1, 1, 1] [2018-01-31 08:56:28,061 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-01-31 08:56:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1245188107, now seen corresponding path program 12 times [2018-01-31 08:56:28,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:56:28,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:56:28,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:28,062 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:56:28,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:56:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:56:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:56:28,181 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 08:56:28,239 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-31 08:56:28,242 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 08:56:28,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:56:28 BoogieIcfgContainer [2018-01-31 08:56:28,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:56:28,270 INFO L168 Benchmark]: Toolchain (without parser) took 36848.30 ms. Allocated memory was 308.3 MB in the beginning and 615.0 MB in the end (delta: 306.7 MB). Free memory was 267.0 MB in the beginning and 532.2 MB in the end (delta: -265.2 MB). Peak memory consumption was 41.5 MB. Max. memory is 5.3 GB. [2018-01-31 08:56:28,271 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 308.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:56:28,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.65 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 254.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:56:28,274 INFO L168 Benchmark]: Boogie Preprocessor took 46.18 ms. Allocated memory is still 308.3 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:56:28,275 INFO L168 Benchmark]: RCFGBuilder took 593.47 ms. Allocated memory is still 308.3 MB. Free memory was 252.1 MB in the beginning and 228.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:56:28,275 INFO L168 Benchmark]: TraceAbstraction took 35830.62 ms. Allocated memory was 308.3 MB in the beginning and 615.0 MB in the end (delta: 306.7 MB). Free memory was 228.8 MB in the beginning and 532.2 MB in the end (delta: -303.4 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:56:28,277 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.17 ms. Allocated memory is still 308.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 364.65 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 254.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.18 ms. Allocated memory is still 308.3 MB. Free memory was 254.1 MB in the beginning and 252.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 593.47 ms. Allocated memory is still 308.3 MB. Free memory was 252.1 MB in the beginning and 228.8 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 35830.62 ms. Allocated memory was 308.3 MB in the beginning and 615.0 MB in the end (delta: 306.7 MB). Free memory was 228.8 MB in the beginning and 532.2 MB in the end (delta: -303.4 MB). Peak memory consumption was 3.3 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() VAL [\old(size)=16, __VERIFIER_nondet_int()=1, size=16] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={20:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={20:0}, malloc(size)={20:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={20:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) VAL [kobj={20:0}, ldv_malloc(sizeof(*kobj))={20:0}] [L1409] COND FALSE !(!kobj) VAL [kobj={20:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={20:0}, memset(kobj, 0, sizeof(*kobj))={20:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={20:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={20:0}, kobj={20:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={20:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={20:0}, kobj={20:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={20:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={20:12}, kref={20:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={20:0}, kobj={20:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={20:4}] [L1099] FCALL list->next = list VAL [list={20:4}, list={20:4}] [L1100] FCALL list->prev = list VAL [list={20:4}, list={20:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={20:0}, kobj={20:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={20:0}] [L1414] RET return kobj; VAL [\result={20:0}, kobj={20:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={20:0}] [L1437] RET kobj = ldv_kobject_create() VAL [kobj={20:0}, ldv_kobject_create()={20:0}] [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 77 locations, 9 error locations. UNSAFE Result, 35.7s OverallTime, 26 OverallIterations, 16 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1474 SDtfs, 758 SDslu, 10130 SDs, 0 SdLazy, 3101 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1596 GetRequests, 1259 SyntacticMatches, 1 SemanticMatches, 336 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred 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.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 56 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 11.7s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 3105 NumberOfCodeBlocks, 3081 NumberOfCodeBlocksAsserted, 99 NumberOfCheckSat, 2942 ConstructedInterpolants, 75 QuantifiedInterpolants, 645449 SizeOfPredicates, 41 NumberOfNonLiveVariables, 3839 ConjunctsInSsa, 279 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 139/4825 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 /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-56-28-287.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-56-28-287.csv Received shutdown request...