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.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:24:37,335 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:24:37,337 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:24:37,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:24:37,351 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:24:37,352 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:24:37,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:24:37,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:24:37,357 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:24:37,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:24:37,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:24:37,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:24:37,359 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:24:37,360 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:24:37,361 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:24:37,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:24:37,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:24:37,368 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:24:37,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:24:37,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:24:37,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:24:37,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:24:37,373 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:24:37,374 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:24:37,375 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:24:37,376 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:24:37,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:24:37,377 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:24:37,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:24:37,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:24:37,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:24:37,378 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.epf [2018-01-24 12:24:37,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:24:37,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:24:37,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:24:37,390 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:24:37,390 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:24:37,390 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:24:37,390 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:24:37,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:24:37,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:24:37,391 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:24:37,392 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:24:37,392 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:24:37,392 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:24:37,392 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:24:37,392 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:24:37,393 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:24:37,393 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:24:37,393 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:24:37,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:24:37,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:24:37,394 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:24:37,394 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:24:37,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:24:37,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:24:37,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:24:37,395 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:24:37,395 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:24:37,395 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:24:37,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:24:37,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:24:37,396 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:24:37,396 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:24:37,397 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:24:37,397 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:24:37,433 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:24:37,446 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:24:37,450 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:24:37,451 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:24:37,452 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:24:37,453 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-24 12:24:37,646 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:24:37,650 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:24:37,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:24:37,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:24:37,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:24:37,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37, skipping insertion in model container [2018-01-24 12:24:37,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,674 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:24:37,722 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:24:37,840 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:24:37,860 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:24:37,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37 WrapperNode [2018-01-24 12:24:37,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:24:37,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:24:37,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:24:37,872 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:24:37,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (1/1) ... [2018-01-24 12:24:37,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:24:37,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:24:37,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:24:37,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:24:37,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (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-24 12:24:37,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:24:37,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:24:37,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 12:24:37,968 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 12:24:37,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-24 12:24:37,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-24 12:24:37,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-24 12:24:37,969 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-24 12:24:37,969 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:24:37,969 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:24:37,969 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 12:24:37,970 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-24 12:24:37,970 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-24 12:24:37,971 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-24 12:24:37,971 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:24:37,971 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:24:37,971 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:24:37,971 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:24:38,111 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 12:24:38,206 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:24:38,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:24:38 BoogieIcfgContainer [2018-01-24 12:24:38,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:24:38,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:24:38,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:24:38,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:24:38,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:24:37" (1/3) ... [2018-01-24 12:24:38,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5974053a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:24:38, skipping insertion in model container [2018-01-24 12:24:38,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:24:37" (2/3) ... [2018-01-24 12:24:38,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5974053a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:24:38, skipping insertion in model container [2018-01-24 12:24:38,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:24:38" (3/3) ... [2018-01-24 12:24:38,214 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-01-24 12:24:38,223 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:24:38,231 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 12:24:38,282 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:24:38,282 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:24:38,282 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:24:38,282 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:24:38,282 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:24:38,283 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:24:38,283 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:24:38,283 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:24:38,284 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:24:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-24 12:24:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:24:38,308 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:38,309 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:38,310 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-24 12:24:38,314 INFO L82 PathProgramCache]: Analyzing trace with hash 13572496, now seen corresponding path program 1 times [2018-01-24 12:24:38,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:38,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:38,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:38,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:38,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:38,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:38,571 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-24 12:24:38,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:38,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:24:38,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:24:38,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:24:38,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:24:38,664 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 5 states. [2018-01-24 12:24:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:38,723 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-01-24 12:24:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:24:38,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:24:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:38,745 INFO L225 Difference]: With dead ends: 118 [2018-01-24 12:24:38,745 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:24:38,749 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:24:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:24:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-01-24 12:24:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 12:24:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-24 12:24:38,797 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 17 [2018-01-24 12:24:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:38,798 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-24 12:24:38,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:24:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-24 12:24:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:24:38,799 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:38,799 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:38,799 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-24 12:24:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash 64872882, now seen corresponding path program 1 times [2018-01-24 12:24:38,800 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:38,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:38,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:38,802 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:38,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:38,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:38,924 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-24 12:24:38,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:38,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:24:38,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:24:38,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:24:38,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:24:38,927 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-01-24 12:24:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:39,048 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-24 12:24:39,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:24:39,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 12:24:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:39,050 INFO L225 Difference]: With dead ends: 68 [2018-01-24 12:24:39,050 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:24:39,051 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:24:39,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-01-24 12:24:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 12:24:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-24 12:24:39,061 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 19 [2018-01-24 12:24:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:39,062 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-24 12:24:39,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:24:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-24 12:24:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:24:39,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:39,063 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:39,063 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-24 12:24:39,064 INFO L82 PathProgramCache]: Analyzing trace with hash 64872883, now seen corresponding path program 1 times [2018-01-24 12:24:39,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:39,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:39,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:39,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:39,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:39,362 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-24 12:24:39,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:39,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:24:39,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:24:39,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:24:39,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:39,364 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2018-01-24 12:24:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:39,567 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-24 12:24:39,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:24:39,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 12:24:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:39,569 INFO L225 Difference]: With dead ends: 67 [2018-01-24 12:24:39,570 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 12:24:39,570 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:24:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 12:24:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-01-24 12:24:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 12:24:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-24 12:24:39,580 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2018-01-24 12:24:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:39,581 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-24 12:24:39,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:24:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-24 12:24:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:24:39,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:39,582 INFO L322 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-24 12:24:39,583 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-24 12:24:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1610907055, now seen corresponding path program 1 times [2018-01-24 12:24:39,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:39,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:39,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:39,586 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:39,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:39,636 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-24 12:24:39,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:39,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:24:39,636 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:24:39,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:24:39,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:24:39,637 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2018-01-24 12:24:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:39,700 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2018-01-24 12:24:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:24:39,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 12:24:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:39,702 INFO L225 Difference]: With dead ends: 71 [2018-01-24 12:24:39,703 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:24:39,703 INFO L525 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-24 12:24:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:24:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:24:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:24:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-01-24 12:24:39,712 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 22 [2018-01-24 12:24:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:39,713 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-01-24 12:24:39,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:24:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-01-24 12:24:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:24:39,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:39,714 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:39,714 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-24 12:24:39,715 INFO L82 PathProgramCache]: Analyzing trace with hash -655458449, now seen corresponding path program 1 times [2018-01-24 12:24:39,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:39,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:39,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:39,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:39,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:39,793 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-24 12:24:39,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:39,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:24:39,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:24:39,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:24:39,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:24:39,795 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 6 states. [2018-01-24 12:24:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:39,831 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-01-24 12:24:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:24:39,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 12:24:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:39,836 INFO L225 Difference]: With dead ends: 67 [2018-01-24 12:24:39,836 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:24:39,837 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:24:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:24:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:24:39,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-24 12:24:39,843 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 24 [2018-01-24 12:24:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:39,844 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-24 12:24:39,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:24:39,844 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-24 12:24:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:24:39,844 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:39,845 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:39,845 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-24 12:24:39,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666846, now seen corresponding path program 1 times [2018-01-24 12:24:39,845 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:39,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:39,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:39,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:39,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:39,946 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-24 12:24:39,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:39,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:24:39,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:24:39,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:24:39,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:24:39,947 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2018-01-24 12:24:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:40,199 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-01-24 12:24:40,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:24:40,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-24 12:24:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:40,201 INFO L225 Difference]: With dead ends: 60 [2018-01-24 12:24:40,201 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:24:40,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:24:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:24:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 12:24:40,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 12:24:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-24 12:24:40,210 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 34 [2018-01-24 12:24:40,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:40,211 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-24 12:24:40,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:24:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-24 12:24:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:24:40,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:40,212 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:40,213 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-24 12:24:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1673666845, now seen corresponding path program 1 times [2018-01-24 12:24:40,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:40,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:40,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:40,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:40,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:40,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:40,284 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-24 12:24:40,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:40,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:24:40,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:24:40,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:24:40,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:24:40,286 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 4 states. [2018-01-24 12:24:40,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:40,314 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-01-24 12:24:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:24:40,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-24 12:24:40,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:40,316 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:24:40,316 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:24:40,317 INFO L525 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-24 12:24:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:24:40,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:24:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:24:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-24 12:24:40,324 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-01-24 12:24:40,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:40,324 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-24 12:24:40,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:24:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-24 12:24:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 12:24:40,325 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:40,325 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:40,325 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-24 12:24:40,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1908152085, now seen corresponding path program 1 times [2018-01-24 12:24:40,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:40,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:40,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:40,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:40,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:40,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:40,395 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-24 12:24:40,395 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:40,395 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-24 12:24:40,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:40,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:40,472 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-24 12:24:40,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:40,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-24 12:24:40,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:24:40,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:24:40,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:24:40,496 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2018-01-24 12:24:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:40,523 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2018-01-24 12:24:40,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:24:40,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 12:24:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:40,525 INFO L225 Difference]: With dead ends: 98 [2018-01-24 12:24:40,525 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 12:24:40,525 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:24:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 12:24:40,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 12:24:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:24:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-24 12:24:40,533 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 35 [2018-01-24 12:24:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:40,533 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-24 12:24:40,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:24:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-24 12:24:40,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:24:40,535 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:40,535 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:40,535 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-24 12:24:40,535 INFO L82 PathProgramCache]: Analyzing trace with hash -587259933, now seen corresponding path program 2 times [2018-01-24 12:24:40,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:40,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:40,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:40,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:40,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:40,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:40,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:40,625 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-24 12:24:40,638 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:24:40,671 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:40,675 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:40,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:40,719 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-24 12:24:40,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:40,749 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-24 12:24:40,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:40,804 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-24 12:24:40,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:24:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:24:41,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:24:41,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-24 12:24:41,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:24:41,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:24:41,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:24:41,647 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 19 states. [2018-01-24 12:24:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:42,531 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2018-01-24 12:24:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:24:42,531 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-01-24 12:24:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:42,532 INFO L225 Difference]: With dead ends: 98 [2018-01-24 12:24:42,532 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 12:24:42,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:24:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 12:24:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 12:24:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:24:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-24 12:24:42,542 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 36 [2018-01-24 12:24:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:42,542 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-24 12:24:42,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:24:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-24 12:24:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:24:42,544 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:42,544 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:42,544 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-24 12:24:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463170, now seen corresponding path program 1 times [2018-01-24 12:24:42,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:42,545 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:42,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:42,546 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:42,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:42,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:42,682 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-24 12:24:42,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:42,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:24:42,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:24:42,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:24:42,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:24:42,684 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 10 states. [2018-01-24 12:24:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:42,907 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-01-24 12:24:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:24:42,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 12:24:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:42,908 INFO L225 Difference]: With dead ends: 61 [2018-01-24 12:24:42,908 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:24:42,909 INFO L525 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-24 12:24:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:24:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 12:24:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 12:24:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-24 12:24:42,921 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 42 [2018-01-24 12:24:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:42,922 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-24 12:24:42,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:24:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-24 12:24:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:24:42,923 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:42,923 INFO L322 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:42,923 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-24 12:24:42,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1225463169, now seen corresponding path program 1 times [2018-01-24 12:24:42,924 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:42,924 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:42,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:42,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:42,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:42,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:43,013 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-24 12:24:43,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:43,013 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-24 12:24:43,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:43,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:43,054 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-24 12:24:43,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:43,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-24 12:24:43,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:24:43,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:24:43,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:24:43,078 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-01-24 12:24:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:43,101 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-01-24 12:24:43,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:24:43,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-24 12:24:43,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:43,102 INFO L225 Difference]: With dead ends: 94 [2018-01-24 12:24:43,102 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:24:43,103 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:24:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:24:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:24:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:24:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-01-24 12:24:43,111 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 42 [2018-01-24 12:24:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:43,111 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-01-24 12:24:43,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:24:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-01-24 12:24:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:24:43,112 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:43,112 INFO L322 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:43,112 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-24 12:24:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1854641017, now seen corresponding path program 2 times [2018-01-24 12:24:43,113 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:43,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:43,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:43,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:43,114 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:43,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:43,179 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:43,179 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-24 12:24:43,187 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:24:43,210 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:43,215 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:43,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:43,231 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-24 12:24:43,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:43,275 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-24 12:24:43,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:24:43,290 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-24 12:24:43,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-24 12:24:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-24 12:24:43,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:24:43,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-24 12:24:43,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:24:43,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:24:43,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:24:43,858 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 22 states. [2018-01-24 12:24:46,229 WARN L143 SmtUtils]: Spent 2045ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 12:24:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:46,640 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-24 12:24:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:24:46,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-01-24 12:24:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:46,641 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:24:46,641 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:24:46,642 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2018-01-24 12:24:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:24:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 12:24:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 12:24:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-24 12:24:46,652 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 43 [2018-01-24 12:24:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:46,652 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-24 12:24:46,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:24:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-24 12:24:46,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:24:46,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:46,653 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:46,653 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-24 12:24:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash -796850259, now seen corresponding path program 1 times [2018-01-24 12:24:46,654 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:46,654 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:46,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:46,655 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:46,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:46,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:46,727 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-24 12:24:46,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:46,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:24:46,728 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:24:46,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:24:46,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:24:46,729 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 8 states. [2018-01-24 12:24:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:46,768 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-01-24 12:24:46,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:24:46,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-24 12:24:46,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:46,769 INFO L225 Difference]: With dead ends: 69 [2018-01-24 12:24:46,769 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:24:46,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:24:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:24:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 12:24:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 12:24:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-01-24 12:24:46,782 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 42 [2018-01-24 12:24:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:46,782 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-01-24 12:24:46,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:24:46,783 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-01-24 12:24:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:24:46,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:46,784 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:46,784 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-24 12:24:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1073611946, now seen corresponding path program 1 times [2018-01-24 12:24:46,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:46,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:46,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:46,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:46,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:46,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:46,879 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-24 12:24:46,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:24:46,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:24:46,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:24:46,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:24:46,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:24:46,880 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 10 states. [2018-01-24 12:24:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:46,966 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-01-24 12:24:46,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:24:46,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-01-24 12:24:46,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:46,967 INFO L225 Difference]: With dead ends: 71 [2018-01-24 12:24:46,967 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 12:24:46,968 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:24:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 12:24:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 12:24:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 12:24:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-01-24 12:24:46,976 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 47 [2018-01-24 12:24:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:46,976 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-01-24 12:24:46,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:24:46,976 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-01-24 12:24:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-24 12:24:46,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:46,977 INFO L322 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:46,978 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-24 12:24:46,978 INFO L82 PathProgramCache]: Analyzing trace with hash 348696970, now seen corresponding path program 1 times [2018-01-24 12:24:46,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:46,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:46,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:46,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:46,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:46,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:47,068 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-24 12:24:47,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:47,069 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-24 12:24:47,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:47,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:47,131 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-24 12:24:47,151 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:47,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-24 12:24:47,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:24:47,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:24:47,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:24:47,152 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 10 states. [2018-01-24 12:24:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:47,185 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-01-24 12:24:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:24:47,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-01-24 12:24:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:47,187 INFO L225 Difference]: With dead ends: 92 [2018-01-24 12:24:47,187 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 12:24:47,188 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:24:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 12:24:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 12:24:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 12:24:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-01-24 12:24:47,199 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-01-24 12:24:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:47,199 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-01-24 12:24:47,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:24:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-01-24 12:24:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 12:24:47,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:47,200 INFO L322 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:47,200 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-24 12:24:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash -648862830, now seen corresponding path program 2 times [2018-01-24 12:24:47,200 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:47,200 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:47,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:47,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:47,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:47,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:47,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:47,298 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-24 12:24:47,303 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:24:47,325 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:47,333 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:47,334 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:47,337 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:47,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:47,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-01-24 12:24:47,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:24:47,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:24:47,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:24:47,388 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 11 states. [2018-01-24 12:24:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:47,414 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-01-24 12:24:47,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:24:47,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2018-01-24 12:24:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:47,415 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:24:47,415 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 12:24:47,416 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:24:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 12:24:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 12:24:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 12:24:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-01-24 12:24:47,424 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-01-24 12:24:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:47,424 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-01-24 12:24:47,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:24:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-01-24 12:24:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-24 12:24:47,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:47,426 INFO L322 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:47,426 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-24 12:24:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1508445558, now seen corresponding path program 3 times [2018-01-24 12:24:47,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:47,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:47,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:47,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:47,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:47,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:47,524 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-24 12:24:47,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:47,524 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-24 12:24:47,531 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:24:47,556 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:47,562 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:47,584 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:47,742 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:48,395 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:48,396 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:48,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:48,417 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-24 12:24:48,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:48,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-01-24 12:24:48,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:24:48,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:24:48,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:24:48,438 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 12 states. [2018-01-24 12:24:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:48,470 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-01-24 12:24:48,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:24:48,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2018-01-24 12:24:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:48,471 INFO L225 Difference]: With dead ends: 94 [2018-01-24 12:24:48,471 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 12:24:48,471 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:24:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 12:24:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-24 12:24:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 12:24:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-01-24 12:24:48,481 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-01-24 12:24:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:48,481 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-01-24 12:24:48,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:24:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-01-24 12:24:48,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 12:24:48,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:48,481 INFO L322 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:48,482 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-24 12:24:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1909260946, now seen corresponding path program 4 times [2018-01-24 12:24:48,482 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:48,482 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:48,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:48,483 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:48,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:48,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:48,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:48,628 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-24 12:24:48,633 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:24:48,673 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:48,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:48,724 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:48,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-24 12:24:48,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:24:48,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:24:48,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:24:48,725 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 13 states. [2018-01-24 12:24:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:48,808 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-01-24 12:24:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 12:24:48,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-01-24 12:24:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:48,809 INFO L225 Difference]: With dead ends: 95 [2018-01-24 12:24:48,809 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 12:24:48,809 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:24:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 12:24:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-24 12:24:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 12:24:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-01-24 12:24:48,819 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-01-24 12:24:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:48,819 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-01-24 12:24:48,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:24:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-01-24 12:24:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 12:24:48,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:48,820 INFO L322 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:48,820 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-24 12:24:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash 483980170, now seen corresponding path program 5 times [2018-01-24 12:24:48,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:48,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:48,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:48,821 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:48,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:48,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:49,010 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-24 12:24:49,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:49,011 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-24 12:24:49,018 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 12:24:49,032 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:49,035 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:49,040 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:49,051 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:49,083 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:49,151 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:49,154 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:49,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:49,170 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-24 12:24:49,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:49,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-01-24 12:24:49,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:24:49,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:24:49,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:24:49,192 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 14 states. [2018-01-24 12:24:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:49,257 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-01-24 12:24:49,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:24:49,258 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-01-24 12:24:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:49,258 INFO L225 Difference]: With dead ends: 96 [2018-01-24 12:24:49,258 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 12:24:49,259 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:24:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 12:24:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-24 12:24:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 12:24:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-01-24 12:24:49,267 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-01-24 12:24:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:49,267 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-01-24 12:24:49,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:24:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-01-24 12:24:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-24 12:24:49,268 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:49,268 INFO L322 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:49,268 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-24 12:24:49,269 INFO L82 PathProgramCache]: Analyzing trace with hash -750050926, now seen corresponding path program 6 times [2018-01-24 12:24:49,269 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:49,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:49,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:49,270 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:49,270 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:49,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:49,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:49,423 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-24 12:24:49,429 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 12:24:49,451 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:49,458 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:49,477 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:49,557 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:49,873 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:50,289 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:24:50,290 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:50,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:50,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:50,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-24 12:24:50,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:24:50,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:24:50,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:24:50,347 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 15 states. [2018-01-24 12:24:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:50,387 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-01-24 12:24:50,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:24:50,387 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-01-24 12:24:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:50,388 INFO L225 Difference]: With dead ends: 97 [2018-01-24 12:24:50,388 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 12:24:50,388 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 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-24 12:24:50,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 12:24:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-24 12:24:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 12:24:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-01-24 12:24:50,397 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-01-24 12:24:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:50,397 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-01-24 12:24:50,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:24:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-01-24 12:24:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-24 12:24:50,398 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:50,398 INFO L322 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:50,398 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-24 12:24:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -350309238, now seen corresponding path program 7 times [2018-01-24 12:24:50,399 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:50,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:50,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:50,399 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:50,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:50,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:50,660 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-24 12:24:50,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:50,695 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-24 12:24:50,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:50,731 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:50,744 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-24 12:24:50,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:50,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-24 12:24:50,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:24:50,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:24:50,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:24:50,765 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 16 states. [2018-01-24 12:24:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:50,813 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-01-24 12:24:50,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:24:50,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2018-01-24 12:24:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:50,814 INFO L225 Difference]: With dead ends: 98 [2018-01-24 12:24:50,814 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 12:24:50,815 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:24:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 12:24:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-24 12:24:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 12:24:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-01-24 12:24:50,828 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-01-24 12:24:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:50,828 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-01-24 12:24:50,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:24:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-01-24 12:24:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-24 12:24:50,829 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:50,829 INFO L322 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:50,830 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-24 12:24:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash -843218798, now seen corresponding path program 8 times [2018-01-24 12:24:50,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:50,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:50,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:50,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:24:50,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:50,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:51,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:51,069 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-24 12:24:51,074 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:24:51,100 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:51,112 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:51,114 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:51,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:51,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:51,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-01-24 12:24:51,149 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 12:24:51,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 12:24:51,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:24:51,149 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 17 states. [2018-01-24 12:24:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:51,197 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-01-24 12:24:51,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:24:51,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-01-24 12:24:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:51,198 INFO L225 Difference]: With dead ends: 99 [2018-01-24 12:24:51,198 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:24:51,199 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=180, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:24:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:24:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 12:24:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 12:24:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-01-24 12:24:51,209 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-01-24 12:24:51,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:51,210 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-01-24 12:24:51,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 12:24:51,210 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-01-24 12:24:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-24 12:24:51,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:51,211 INFO L322 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:51,211 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-24 12:24:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1056454026, now seen corresponding path program 9 times [2018-01-24 12:24:51,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:51,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:51,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:51,212 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:51,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:51,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:51,396 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-24 12:24:51,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:51,397 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-24 12:24:51,402 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:24:51,432 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:51,443 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:51,476 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:51,699 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:51,900 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:52,291 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:53,522 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:55,877 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:24:55,880 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:55,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:56,104 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-24 12:24:56,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:56,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2018-01-24 12:24:56,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-24 12:24:56,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-24 12:24:56,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=959, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 12:24:56,131 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 37 states. [2018-01-24 12:24:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:56,288 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-01-24 12:24:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 12:24:56,288 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2018-01-24 12:24:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:56,289 INFO L225 Difference]: With dead ends: 100 [2018-01-24 12:24:56,289 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:24:56,289 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1145, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 12:24:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:24:56,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-24 12:24:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 12:24:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-01-24 12:24:56,299 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-01-24 12:24:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:56,299 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-01-24 12:24:56,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-24 12:24:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-01-24 12:24:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-24 12:24:56,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:56,301 INFO L322 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:56,301 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-24 12:24:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash -183230574, now seen corresponding path program 10 times [2018-01-24 12:24:56,301 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:56,301 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:56,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:56,302 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:56,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:56,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:56,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:56,584 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-24 12:24:56,595 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:24:56,646 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:56,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:56,665 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:24:56,699 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:56,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-24 12:24:56,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 12:24:56,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 12:24:56,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:24:56,699 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 19 states. [2018-01-24 12:24:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:56,744 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-01-24 12:24:56,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:24:56,745 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2018-01-24 12:24:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:56,745 INFO L225 Difference]: With dead ends: 101 [2018-01-24 12:24:56,745 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 12:24:56,746 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 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-24 12:24:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 12:24:56,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-24 12:24:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 12:24:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-01-24 12:24:56,755 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-01-24 12:24:56,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:56,756 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-01-24 12:24:56,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 12:24:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-01-24 12:24:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-24 12:24:56,757 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:56,757 INFO L322 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:56,757 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-24 12:24:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 41252490, now seen corresponding path program 11 times [2018-01-24 12:24:56,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:56,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:56,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:56,758 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:56,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:24:56,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:24:56,991 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-24 12:24:56,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:24:56,992 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-24 12:24:56,998 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 12:24:57,010 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:57,013 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:57,016 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:57,029 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:57,057 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:57,085 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:57,346 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:57,723 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:58,066 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:24:58,070 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:24:58,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:24:58,101 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-24 12:24:58,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:24:58,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-01-24 12:24:58,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 12:24:58,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 12:24:58,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2018-01-24 12:24:58,125 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 20 states. [2018-01-24 12:24:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:24:58,171 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-01-24 12:24:58,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:24:58,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-01-24 12:24:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:24:58,172 INFO L225 Difference]: With dead ends: 102 [2018-01-24 12:24:58,172 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 12:24:58,172 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=243, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:24:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 12:24:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 12:24:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 12:24:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-01-24 12:24:58,181 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-01-24 12:24:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:24:58,182 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-01-24 12:24:58,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 12:24:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-01-24 12:24:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-24 12:24:58,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:24:58,182 INFO L322 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:24:58,183 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-24 12:24:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1589707118, now seen corresponding path program 12 times [2018-01-24 12:24:58,183 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:24:58,183 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:24:58,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:58,184 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:24:58,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:24:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:24:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:24:58,258 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 12:24:58,275 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2018-01-24 12:24:58,280 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 12:24:58,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:24:58 BoogieIcfgContainer [2018-01-24 12:24:58,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:24:58,298 INFO L168 Benchmark]: Toolchain (without parser) took 20651.29 ms. Allocated memory was 304.6 MB in the beginning and 573.6 MB in the end (delta: 269.0 MB). Free memory was 263.7 MB in the beginning and 320.6 MB in the end (delta: -56.9 MB). Peak memory consumption was 212.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:58,299 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:24:58,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.32 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 250.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:58,300 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 304.6 MB. Free memory was 250.6 MB in the beginning and 248.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:58,300 INFO L168 Benchmark]: RCFGBuilder took 296.29 ms. Allocated memory is still 304.6 MB. Free memory was 248.5 MB in the beginning and 227.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:58,300 INFO L168 Benchmark]: TraceAbstraction took 20089.15 ms. Allocated memory was 304.6 MB in the beginning and 573.6 MB in the end (delta: 269.0 MB). Free memory was 227.8 MB in the beginning and 320.6 MB in the end (delta: -92.9 MB). Peak memory consumption was 176.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:24:58,302 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 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.32 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 250.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.13 ms. Allocated memory is still 304.6 MB. Free memory was 250.6 MB in the beginning and 248.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 296.29 ms. Allocated memory is still 304.6 MB. Free memory was 248.5 MB in the beginning and 227.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20089.15 ms. Allocated memory was 304.6 MB in the beginning and 573.6 MB in the end (delta: 269.0 MB). Free memory was 227.8 MB in the beginning and 320.6 MB in the end (delta: -92.9 MB). Peak memory consumption was 176.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1441]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1441. Possible FailurePath: [L1442] CALL entry_point() [L1436] struct ldv_kobject *kobj; [L1437] CALL, EXPR ldv_kobject_create() [L1406] struct ldv_kobject *kobj; [L1408] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=16, malloc(size)={19:0}, size=16] [L1074] RET return malloc(size); VAL [\old(size)=16, \result={19:0}, malloc(size)={19:0}, size=16] [L1408] EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_malloc(sizeof(*kobj))={19:0}] [L1408] kobj = ldv_malloc(sizeof(*kobj)) [L1409] COND FALSE !(!kobj) VAL [kobj={19:0}] [L1411] FCALL memset(kobj, 0, sizeof(*kobj)) VAL [kobj={19:0}, memset(kobj, 0, sizeof(*kobj))={19:0}] [L1413] CALL ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1394] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1398] CALL ldv_kobject_init_internal(kobj) VAL [kobj={19:0}] [L1380] COND FALSE !(!kobj) VAL [kobj={19:0}, kobj={19:0}] [L1382] CALL ldv_kref_init(&kobj->kref) VAL [kref={19:12}] [L1294] RET, FCALL ((&kref->refcount)->counter) = (1) VAL [kref={19:12}, kref={19:12}] [L1382] ldv_kref_init(&kobj->kref) VAL [kobj={19:0}, kobj={19:0}] [L1383] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [list={19:4}] [L1099] FCALL list->next = list VAL [list={19:4}, list={19:4}] [L1100] FCALL list->prev = list VAL [list={19:4}, list={19:4}] [L1383] RET, FCALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={19:0}, kobj={19:0}] [L1413] ldv_kobject_init(kobj) VAL [kobj={19:0}] [L1414] RET return kobj; VAL [\result={19:0}, kobj={19:0}] [L1437] EXPR ldv_kobject_create() VAL [ldv_kobject_create()={19:0}] [L1437] RET kobj = ldv_kobject_create() [L1442] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 65 locations, 9 error locations. UNSAFE Result, 20.0s OverallTime, 26 OverallIterations, 16 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1289 SDtfs, 256 SDslu, 9631 SDs, 0 SdLazy, 2310 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1134 GetRequests, 826 SyntacticMatches, 1 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 7.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2061 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1958 ConstructedInterpolants, 53 QuantifiedInterpolants, 225017 SizeOfPredicates, 34 NumberOfNonLiveVariables, 3798 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 40 InterpolantComputations, 12 PerfectInterpolantSequences, 49/1396 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-24-58-309.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-24-58-309.csv Received shutdown request...