java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:54:45,773 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:54:45,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:54:45,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:54:45,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:54:45,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:54:45,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:54:45,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:54:45,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:54:45,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:54:45,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:54:45,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:54:45,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:54:45,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:54:45,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:54:45,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:54:45,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:54:45,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:54:45,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:54:45,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:54:45,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:54:45,812 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:54:45,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:54:45,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:54:45,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:54:45,816 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:54:45,816 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:54:45,817 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:54:45,817 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:54:45,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:54:45,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:54:45,818 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:54:45,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:54:45,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:54:45,830 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:54:45,830 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:54:45,830 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:54:45,830 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:54:45,830 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:54:45,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:54:45,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:54:45,832 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:54:45,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:54:45,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:54:45,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:54:45,832 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:54:45,833 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:54:45,833 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:54:45,833 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:54:45,833 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:54:45,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:54:45,834 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:54:45,834 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:54:45,834 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:54:45,834 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:54:45,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:54:45,835 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:54:45,835 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:54:45,835 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:54:45,835 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:54:45,835 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:54:45,836 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:54:45,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:54:45,836 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:54:45,837 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:54:45,837 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:54:45,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:54:45,885 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:54:45,890 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:54:45,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:54:45,892 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:54:45,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test22_3_false-valid-deref.i [2018-01-29 23:54:46,078 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:54:46,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:54:46,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:54:46,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:54:46,092 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:54:46,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5e0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46, skipping insertion in model container [2018-01-29 23:54:46,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,116 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:54:46,171 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:54:46,299 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:54:46,322 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:54:46,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46 WrapperNode [2018-01-29 23:54:46,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:54:46,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:54:46,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:54:46,335 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:54:46,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (1/1) ... [2018-01-29 23:54:46,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:54:46,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:54:46,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:54:46,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:54:46,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (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-29 23:54:46,421 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:54:46,421 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-29 23:54:46,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-01-29 23:54:46,423 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-01-29 23:54:46,423 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-01-29 23:54:46,423 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-01-29 23:54:46,423 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-29 23:54:46,423 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:54:46,423 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-29 23:54:46,423 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-29 23:54:46,423 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:54:46,424 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:54:46,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:54:46,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:54:46,424 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:54:46,424 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-29 23:54:46,424 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-29 23:54:46,425 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-29 23:54:46,425 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-29 23:54:46,425 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:54:46,425 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-29 23:54:46,425 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-29 23:54:46,426 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-29 23:54:46,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-01-29 23:54:46,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-01-29 23:54:46,426 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-01-29 23:54:46,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-01-29 23:54:46,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-01-29 23:54:46,426 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-29 23:54:46,427 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-29 23:54:46,427 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-01-29 23:54:46,427 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-01-29 23:54:46,427 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-01-29 23:54:46,427 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-01-29 23:54:46,427 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-29 23:54:46,427 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:54:46,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:54:46,428 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:54:46,680 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-29 23:54:46,853 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:54:46,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:54:46 BoogieIcfgContainer [2018-01-29 23:54:46,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:54:46,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:54:46,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:54:46,857 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:54:46,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:54:46" (1/3) ... [2018-01-29 23:54:46,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f15a942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:54:46, skipping insertion in model container [2018-01-29 23:54:46,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:54:46" (2/3) ... [2018-01-29 23:54:46,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f15a942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:54:46, skipping insertion in model container [2018-01-29 23:54:46,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:54:46" (3/3) ... [2018-01-29 23:54:46,860 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3_false-valid-deref.i [2018-01-29 23:54:46,866 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:54:46,875 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-29 23:54:46,931 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:54:46,931 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:54:46,931 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:54:46,931 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:54:46,931 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:54:46,932 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:54:46,932 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:54:46,932 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:54:46,933 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:54:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-01-29 23:54:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-29 23:54:46,962 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:46,963 INFO L350 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-29 23:54:46,963 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:46,968 INFO L82 PathProgramCache]: Analyzing trace with hash -970088742, now seen corresponding path program 1 times [2018-01-29 23:54:46,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:46,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:47,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:47,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:47,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:47,257 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-29 23:54:47,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:47,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:54:47,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:54:47,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:54:47,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:54:47,344 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 5 states. [2018-01-29 23:54:47,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:47,437 INFO L93 Difference]: Finished difference Result 276 states and 291 transitions. [2018-01-29 23:54:47,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 23:54:47,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-29 23:54:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:47,456 INFO L225 Difference]: With dead ends: 276 [2018-01-29 23:54:47,456 INFO L226 Difference]: Without dead ends: 151 [2018-01-29 23:54:47,461 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:54:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-29 23:54:47,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-01-29 23:54:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-29 23:54:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 157 transitions. [2018-01-29 23:54:47,514 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 157 transitions. Word has length 22 [2018-01-29 23:54:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:47,514 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 157 transitions. [2018-01-29 23:54:47,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:54:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 157 transitions. [2018-01-29 23:54:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:54:47,516 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:47,516 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:47,516 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1498971100, now seen corresponding path program 1 times [2018-01-29 23:54:47,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:47,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:47,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:47,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:47,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:47,608 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-29 23:54:47,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:47,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 23:54:47,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:54:47,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:54:47,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:54:47,610 INFO L87 Difference]: Start difference. First operand 149 states and 157 transitions. Second operand 6 states. [2018-01-29 23:54:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:47,833 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-01-29 23:54:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:54:47,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-29 23:54:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:47,835 INFO L225 Difference]: With dead ends: 152 [2018-01-29 23:54:47,835 INFO L226 Difference]: Without dead ends: 151 [2018-01-29 23:54:47,836 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:54:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-29 23:54:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-01-29 23:54:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-29 23:54:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2018-01-29 23:54:47,847 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 23 [2018-01-29 23:54:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:47,847 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2018-01-29 23:54:47,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:54:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2018-01-29 23:54:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:54:47,848 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:47,848 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:47,848 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1498971101, now seen corresponding path program 1 times [2018-01-29 23:54:47,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:47,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:47,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:47,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:47,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:48,236 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-29 23:54:48,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:48,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:54:48,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:54:48,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:54:48,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:54:48,238 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 7 states. [2018-01-29 23:54:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:48,514 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-01-29 23:54:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 23:54:48,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-29 23:54:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:48,517 INFO L225 Difference]: With dead ends: 151 [2018-01-29 23:54:48,517 INFO L226 Difference]: Without dead ends: 150 [2018-01-29 23:54:48,518 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:54:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-29 23:54:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-01-29 23:54:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-29 23:54:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-29 23:54:48,531 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 23 [2018-01-29 23:54:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:48,532 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-29 23:54:48,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:54:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-29 23:54:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:54:48,534 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:48,534 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:48,535 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:48,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1204324785, now seen corresponding path program 1 times [2018-01-29 23:54:48,536 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:48,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:48,537 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:48,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:48,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:48,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:54:48,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:48,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 23:54:48,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:54:48,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:54:48,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:54:48,671 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 10 states. [2018-01-29 23:54:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:48,963 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2018-01-29 23:54:48,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 23:54:48,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-29 23:54:48,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:48,991 INFO L225 Difference]: With dead ends: 149 [2018-01-29 23:54:48,991 INFO L226 Difference]: Without dead ends: 148 [2018-01-29 23:54:48,991 INFO L553 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-29 23:54:48,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-29 23:54:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-01-29 23:54:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-29 23:54:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2018-01-29 23:54:49,003 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 39 [2018-01-29 23:54:49,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,004 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2018-01-29 23:54:49,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:54:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2018-01-29 23:54:49,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:54:49,006 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,006 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:49,006 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1204324784, now seen corresponding path program 1 times [2018-01-29 23:54:49,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,069 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-29 23:54:49,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:49,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:54:49,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:54:49,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:54:49,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:54:49,070 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand 4 states. [2018-01-29 23:54:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,105 INFO L93 Difference]: Finished difference Result 258 states and 272 transitions. [2018-01-29 23:54:49,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:54:49,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-01-29 23:54:49,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,107 INFO L225 Difference]: With dead ends: 258 [2018-01-29 23:54:49,108 INFO L226 Difference]: Without dead ends: 150 [2018-01-29 23:54:49,108 INFO L553 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-29 23:54:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-29 23:54:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-01-29 23:54:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-29 23:54:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-01-29 23:54:49,120 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 39 [2018-01-29 23:54:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,120 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-01-29 23:54:49,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:54:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-01-29 23:54:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 23:54:49,122 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,123 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:49,123 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash 734700400, now seen corresponding path program 1 times [2018-01-29 23:54:49,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,310 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-29 23:54:49,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:49,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 23:54:49,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 23:54:49,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 23:54:49,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:54:49,311 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 7 states. [2018-01-29 23:54:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,371 INFO L93 Difference]: Finished difference Result 234 states and 249 transitions. [2018-01-29 23:54:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:54:49,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-29 23:54:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,373 INFO L225 Difference]: With dead ends: 234 [2018-01-29 23:54:49,373 INFO L226 Difference]: Without dead ends: 161 [2018-01-29 23:54:49,374 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-29 23:54:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-29 23:54:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-01-29 23:54:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-29 23:54:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2018-01-29 23:54:49,389 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 41 [2018-01-29 23:54:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,389 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2018-01-29 23:54:49,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 23:54:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2018-01-29 23:54:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 23:54:49,391 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,391 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:49,392 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 547481290, now seen corresponding path program 1 times [2018-01-29 23:54:49,392 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,392 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:54:49,439 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:49,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 23:54:49,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 23:54:49,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 23:54:49,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 23:54:49,440 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 3 states. [2018-01-29 23:54:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,541 INFO L93 Difference]: Finished difference Result 179 states and 190 transitions. [2018-01-29 23:54:49,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 23:54:49,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-29 23:54:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,543 INFO L225 Difference]: With dead ends: 179 [2018-01-29 23:54:49,543 INFO L226 Difference]: Without dead ends: 161 [2018-01-29 23:54:49,543 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-29 23:54:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-29 23:54:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 150. [2018-01-29 23:54:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:54:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-01-29 23:54:49,555 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 39 [2018-01-29 23:54:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,555 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-01-29 23:54:49,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 23:54:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-01-29 23:54:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 23:54:49,557 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,557 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:49,557 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:49,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2146406904, now seen corresponding path program 1 times [2018-01-29 23:54:49,558 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,558 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,559 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:54:49,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:49,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 23:54:49,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:54:49,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:54:49,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:54:49,658 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 6 states. [2018-01-29 23:54:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:49,766 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-01-29 23:54:49,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:54:49,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-29 23:54:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:49,767 INFO L225 Difference]: With dead ends: 154 [2018-01-29 23:54:49,767 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 23:54:49,768 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:54:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 23:54:49,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-01-29 23:54:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-01-29 23:54:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2018-01-29 23:54:49,777 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 40 [2018-01-29 23:54:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:49,777 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2018-01-29 23:54:49,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:54:49,777 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2018-01-29 23:54:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 23:54:49,778 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:49,778 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:49,778 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1583567538, now seen corresponding path program 1 times [2018-01-29 23:54:49,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:49,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:49,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:49,851 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-29 23:54:49,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:49,852 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-29 23:54:49,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:49,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:49,980 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-29 23:54:50,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:54:50,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-01-29 23:54:50,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 23:54:50,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 23:54:50,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:54:50,005 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand 6 states. [2018-01-29 23:54:50,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:50,125 INFO L93 Difference]: Finished difference Result 254 states and 266 transitions. [2018-01-29 23:54:50,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:54:50,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-29 23:54:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:50,128 INFO L225 Difference]: With dead ends: 254 [2018-01-29 23:54:50,128 INFO L226 Difference]: Without dead ends: 146 [2018-01-29 23:54:50,129 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-29 23:54:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-29 23:54:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-01-29 23:54:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-29 23:54:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-01-29 23:54:50,139 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 43 [2018-01-29 23:54:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:50,140 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-01-29 23:54:50,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 23:54:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-01-29 23:54:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 23:54:50,141 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:50,141 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:50,141 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:50,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1467102540, now seen corresponding path program 2 times [2018-01-29 23:54:50,142 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:50,142 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:50,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:50,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:50,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:50,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:50,223 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-29 23:54:50,224 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:50,224 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-29 23:54:50,233 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:54:50,262 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:54:50,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:54:50,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:50,318 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-29 23:54:50,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:50,342 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-29 23:54:50,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:50,401 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-29 23:54:50,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:54:51,274 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-29 23:54:51,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:54:51,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 19 [2018-01-29 23:54:51,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:54:51,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:54:51,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:54:51,301 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 19 states. [2018-01-29 23:54:52,495 WARN L143 SmtUtils]: Spent 702ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-29 23:54:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:53,197 INFO L93 Difference]: Finished difference Result 257 states and 270 transitions. [2018-01-29 23:54:53,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 23:54:53,197 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-01-29 23:54:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:53,198 INFO L225 Difference]: With dead ends: 257 [2018-01-29 23:54:53,198 INFO L226 Difference]: Without dead ends: 149 [2018-01-29 23:54:53,199 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2018-01-29 23:54:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-29 23:54:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-01-29 23:54:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-29 23:54:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2018-01-29 23:54:53,212 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 47 [2018-01-29 23:54:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:53,212 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2018-01-29 23:54:53,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:54:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2018-01-29 23:54:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-29 23:54:53,213 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:53,213 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:53,213 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1733956539, now seen corresponding path program 1 times [2018-01-29 23:54:53,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:53,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:53,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:53,215 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:54:53,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:53,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:53,353 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-29 23:54:53,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:54:53,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-29 23:54:53,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 23:54:53,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 23:54:53,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-01-29 23:54:53,354 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 12 states. [2018-01-29 23:54:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:53,646 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-01-29 23:54:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 23:54:53,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-01-29 23:54:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:53,647 INFO L225 Difference]: With dead ends: 146 [2018-01-29 23:54:53,647 INFO L226 Difference]: Without dead ends: 144 [2018-01-29 23:54:53,647 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:54:53,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-29 23:54:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-29 23:54:53,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-29 23:54:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2018-01-29 23:54:53,661 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 56 [2018-01-29 23:54:53,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:53,662 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2018-01-29 23:54:53,662 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 23:54:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2018-01-29 23:54:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-29 23:54:53,663 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:53,663 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:53,663 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1733956538, now seen corresponding path program 1 times [2018-01-29 23:54:53,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:53,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:53,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:53,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:53,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:53,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:53,741 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-29 23:54:53,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:53,741 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-29 23:54:53,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:53,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:53,822 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-29 23:54:53,854 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:54:53,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-01-29 23:54:53,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:54:53,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:54:53,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:54:53,854 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand 8 states. [2018-01-29 23:54:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:54:53,934 INFO L93 Difference]: Finished difference Result 256 states and 268 transitions. [2018-01-29 23:54:53,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 23:54:53,935 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-01-29 23:54:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:54:53,936 INFO L225 Difference]: With dead ends: 256 [2018-01-29 23:54:53,936 INFO L226 Difference]: Without dead ends: 151 [2018-01-29 23:54:53,936 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 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-29 23:54:53,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-29 23:54:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2018-01-29 23:54:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-01-29 23:54:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 154 transitions. [2018-01-29 23:54:53,952 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 154 transitions. Word has length 56 [2018-01-29 23:54:53,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:54:53,952 INFO L432 AbstractCegarLoop]: Abstraction has 148 states and 154 transitions. [2018-01-29 23:54:53,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:54:53,952 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 154 transitions. [2018-01-29 23:54:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 23:54:53,953 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:54:53,953 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:54:53,953 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:54:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash -732835576, now seen corresponding path program 2 times [2018-01-29 23:54:53,954 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:54:53,954 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:54:53,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:53,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:54:53,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:54:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:54:53,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:54:54,098 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-29 23:54:54,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:54:54,098 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-29 23:54:54,106 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:54:54,136 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:54:54,141 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:54:54,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:54:54,153 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-29 23:54:54,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:54,182 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-29 23:54:54,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:54:54,195 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-29 23:54:54,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:54:56,371 WARN L143 SmtUtils]: Spent 1956ms on a formula simplification that was a NOOP. DAG size: 27 [2018-01-29 23:54:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-29 23:54:56,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:54:56,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 22 [2018-01-29 23:54:56,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-29 23:54:56,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-29 23:54:56,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-01-29 23:54:56,741 INFO L87 Difference]: Start difference. First operand 148 states and 154 transitions. Second operand 22 states. [2018-01-29 23:54:59,087 WARN L143 SmtUtils]: Spent 2039ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-29 23:55:05,140 WARN L143 SmtUtils]: Spent 6026ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-29 23:55:07,421 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 32 [2018-01-29 23:55:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:07,992 INFO L93 Difference]: Finished difference Result 258 states and 272 transitions. [2018-01-29 23:55:07,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:55:07,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-01-29 23:55:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:07,993 INFO L225 Difference]: With dead ends: 258 [2018-01-29 23:55:07,994 INFO L226 Difference]: Without dead ends: 153 [2018-01-29 23:55:07,994 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2018-01-29 23:55:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-29 23:55:08,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-01-29 23:55:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:55:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2018-01-29 23:55:08,016 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 60 [2018-01-29 23:55:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:08,016 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2018-01-29 23:55:08,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-29 23:55:08,016 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2018-01-29 23:55:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-29 23:55:08,017 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:08,017 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:55:08,018 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1348894730, now seen corresponding path program 1 times [2018-01-29 23:55:08,018 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:08,018 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:08,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:08,019 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:08,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:08,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-29 23:55:08,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:08,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 23:55:08,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 23:55:08,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 23:55:08,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 23:55:08,109 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 8 states. [2018-01-29 23:55:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:08,161 INFO L93 Difference]: Finished difference Result 231 states and 240 transitions. [2018-01-29 23:55:08,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:55:08,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-01-29 23:55:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:08,163 INFO L225 Difference]: With dead ends: 231 [2018-01-29 23:55:08,163 INFO L226 Difference]: Without dead ends: 150 [2018-01-29 23:55:08,164 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:55:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-29 23:55:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-29 23:55:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:55:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2018-01-29 23:55:08,182 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 75 [2018-01-29 23:55:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:08,183 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2018-01-29 23:55:08,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 23:55:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2018-01-29 23:55:08,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-29 23:55:08,184 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:08,184 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:55:08,184 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:08,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1029372655, now seen corresponding path program 1 times [2018-01-29 23:55:08,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:08,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:08,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:08,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:08,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:08,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-29 23:55:08,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:08,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 23:55:08,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:55:08,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:55:08,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:55:08,281 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand 10 states. [2018-01-29 23:55:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:08,352 INFO L93 Difference]: Finished difference Result 233 states and 241 transitions. [2018-01-29 23:55:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 23:55:08,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-01-29 23:55:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:08,353 INFO L225 Difference]: With dead ends: 233 [2018-01-29 23:55:08,353 INFO L226 Difference]: Without dead ends: 150 [2018-01-29 23:55:08,354 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:55:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-29 23:55:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-29 23:55:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-29 23:55:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2018-01-29 23:55:08,368 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 80 [2018-01-29 23:55:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:08,368 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2018-01-29 23:55:08,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:55:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2018-01-29 23:55:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-29 23:55:08,369 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:08,369 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:55:08,369 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1148809107, now seen corresponding path program 1 times [2018-01-29 23:55:08,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:08,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:08,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:08,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:08,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:08,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-01-29 23:55:08,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:08,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-01-29 23:55:08,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 23:55:08,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 23:55:08,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-01-29 23:55:08,639 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 21 states. [2018-01-29 23:55:09,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:09,081 INFO L93 Difference]: Finished difference Result 192 states and 204 transitions. [2018-01-29 23:55:09,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-29 23:55:09,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 91 [2018-01-29 23:55:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:09,083 INFO L225 Difference]: With dead ends: 192 [2018-01-29 23:55:09,083 INFO L226 Difference]: Without dead ends: 190 [2018-01-29 23:55:09,084 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:55:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-01-29 23:55:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2018-01-29 23:55:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-01-29 23:55:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2018-01-29 23:55:09,106 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 91 [2018-01-29 23:55:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:09,106 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2018-01-29 23:55:09,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 23:55:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2018-01-29 23:55:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-29 23:55:09,108 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:09,108 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:55:09,108 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1148809106, now seen corresponding path program 1 times [2018-01-29 23:55:09,108 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:09,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:09,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:09,110 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:09,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:09,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:09,208 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-29 23:55:09,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:09,208 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-29 23:55:09,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:09,249 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:09,265 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-29 23:55:09,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:09,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-29 23:55:09,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 23:55:09,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 23:55:09,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-01-29 23:55:09,286 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand 10 states. [2018-01-29 23:55:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:09,338 INFO L93 Difference]: Finished difference Result 328 states and 352 transitions. [2018-01-29 23:55:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 23:55:09,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-01-29 23:55:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:09,339 INFO L225 Difference]: With dead ends: 328 [2018-01-29 23:55:09,339 INFO L226 Difference]: Without dead ends: 191 [2018-01-29 23:55:09,340 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 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-29 23:55:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-29 23:55:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-01-29 23:55:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-01-29 23:55:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 200 transitions. [2018-01-29 23:55:09,357 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 200 transitions. Word has length 91 [2018-01-29 23:55:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:09,357 INFO L432 AbstractCegarLoop]: Abstraction has 188 states and 200 transitions. [2018-01-29 23:55:09,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 23:55:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 200 transitions. [2018-01-29 23:55:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-01-29 23:55:09,358 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:09,358 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:55:09,358 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1374100372, now seen corresponding path program 2 times [2018-01-29 23:55:09,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:09,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:09,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:09,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:09,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:09,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:09,650 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-29 23:55:09,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:09,650 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-29 23:55:09,664 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:55:09,701 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:09,714 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:09,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:09,738 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-29 23:55:09,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:09,852 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-29 23:55:09,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:09,918 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-29 23:55:09,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:55:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-01-29 23:55:10,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:55:10,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 29 [2018-01-29 23:55:10,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 23:55:10,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 23:55:10,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2018-01-29 23:55:10,819 INFO L87 Difference]: Start difference. First operand 188 states and 200 transitions. Second operand 29 states. [2018-01-29 23:55:13,133 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-29 23:55:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:14,464 INFO L93 Difference]: Finished difference Result 330 states and 356 transitions. [2018-01-29 23:55:14,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 23:55:14,485 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 95 [2018-01-29 23:55:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:14,486 INFO L225 Difference]: With dead ends: 330 [2018-01-29 23:55:14,487 INFO L226 Difference]: Without dead ends: 193 [2018-01-29 23:55:14,488 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:55:14,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-01-29 23:55:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2018-01-29 23:55:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-29 23:55:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 200 transitions. [2018-01-29 23:55:14,515 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 200 transitions. Word has length 95 [2018-01-29 23:55:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:14,516 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 200 transitions. [2018-01-29 23:55:14,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 23:55:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 200 transitions. [2018-01-29 23:55:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-29 23:55:14,517 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:14,517 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:14,518 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1296004867, now seen corresponding path program 1 times [2018-01-29 23:55:14,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:14,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:14,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:14,519 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:14,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:14,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-01-29 23:55:14,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:14,644 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-29 23:55:14,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:14,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-29 23:55:14,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:14,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-29 23:55:14,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 23:55:14,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 23:55:14,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:55:14,829 INFO L87 Difference]: Start difference. First operand 190 states and 200 transitions. Second operand 20 states. [2018-01-29 23:55:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:15,047 INFO L93 Difference]: Finished difference Result 333 states and 351 transitions. [2018-01-29 23:55:15,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:55:15,047 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-01-29 23:55:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:15,048 INFO L225 Difference]: With dead ends: 333 [2018-01-29 23:55:15,048 INFO L226 Difference]: Without dead ends: 194 [2018-01-29 23:55:15,049 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2018-01-29 23:55:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-29 23:55:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-01-29 23:55:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-29 23:55:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 197 transitions. [2018-01-29 23:55:15,066 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 197 transitions. Word has length 97 [2018-01-29 23:55:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:15,066 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 197 transitions. [2018-01-29 23:55:15,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 23:55:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 197 transitions. [2018-01-29 23:55:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-29 23:55:15,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:15,068 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:15,068 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1377544229, now seen corresponding path program 1 times [2018-01-29 23:55:15,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:15,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:15,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:15,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:15,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:15,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-29 23:55:15,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:55:15,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-01-29 23:55:15,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-29 23:55:15,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-29 23:55:15,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-01-29 23:55:15,521 INFO L87 Difference]: Start difference. First operand 191 states and 197 transitions. Second operand 27 states. [2018-01-29 23:55:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:16,095 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-01-29 23:55:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-29 23:55:16,096 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-01-29 23:55:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:16,097 INFO L225 Difference]: With dead ends: 207 [2018-01-29 23:55:16,097 INFO L226 Difference]: Without dead ends: 205 [2018-01-29 23:55:16,098 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=1375, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:55:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-29 23:55:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2018-01-29 23:55:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-29 23:55:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 210 transitions. [2018-01-29 23:55:16,116 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 210 transitions. Word has length 122 [2018-01-29 23:55:16,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:16,116 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 210 transitions. [2018-01-29 23:55:16,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-29 23:55:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 210 transitions. [2018-01-29 23:55:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-01-29 23:55:16,117 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:16,117 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:16,117 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1377544228, now seen corresponding path program 1 times [2018-01-29 23:55:16,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:16,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:16,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:16,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:16,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:16,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:16,527 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-29 23:55:16,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:16,528 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-29 23:55:16,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:16,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:16,715 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-29 23:55:16,736 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:16,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-01-29 23:55:16,736 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 23:55:16,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 23:55:16,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-01-29 23:55:16,737 INFO L87 Difference]: Start difference. First operand 200 states and 210 transitions. Second operand 13 states. [2018-01-29 23:55:17,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:17,023 INFO L93 Difference]: Finished difference Result 348 states and 368 transitions. [2018-01-29 23:55:17,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-29 23:55:17,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-01-29 23:55:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:17,026 INFO L225 Difference]: With dead ends: 348 [2018-01-29 23:55:17,026 INFO L226 Difference]: Without dead ends: 207 [2018-01-29 23:55:17,027 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2018-01-29 23:55:17,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-29 23:55:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2018-01-29 23:55:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-01-29 23:55:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 214 transitions. [2018-01-29 23:55:17,056 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 214 transitions. Word has length 122 [2018-01-29 23:55:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:17,056 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 214 transitions. [2018-01-29 23:55:17,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 23:55:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 214 transitions. [2018-01-29 23:55:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-01-29 23:55:17,057 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:17,057 INFO L350 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:17,058 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1381563362, now seen corresponding path program 2 times [2018-01-29 23:55:17,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:17,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:17,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:17,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:17,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:17,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:17,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:17,278 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-29 23:55:17,286 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:55:17,337 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:17,345 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:17,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:17,357 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-29 23:55:17,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:17,373 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-29 23:55:17,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:17,385 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-29 23:55:17,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:36 [2018-01-29 23:55:19,804 WARN L146 SmtUtils]: Spent 2037ms on a formula simplification. DAG size of input: 46 DAG size of output 17 [2018-01-29 23:55:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-01-29 23:55:20,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 23:55:20,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [13] total 38 [2018-01-29 23:55:20,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 23:55:20,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 23:55:20,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 23:55:20,659 INFO L87 Difference]: Start difference. First operand 204 states and 214 transitions. Second operand 38 states. [2018-01-29 23:55:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:22,847 INFO L93 Difference]: Finished difference Result 350 states and 372 transitions. [2018-01-29 23:55:22,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-29 23:55:22,848 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 126 [2018-01-29 23:55:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:22,849 INFO L225 Difference]: With dead ends: 350 [2018-01-29 23:55:22,849 INFO L226 Difference]: Without dead ends: 209 [2018-01-29 23:55:22,850 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=385, Invalid=3275, Unknown=0, NotChecked=0, Total=3660 [2018-01-29 23:55:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-29 23:55:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-01-29 23:55:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-01-29 23:55:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 215 transitions. [2018-01-29 23:55:22,871 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 215 transitions. Word has length 126 [2018-01-29 23:55:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:22,871 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 215 transitions. [2018-01-29 23:55:22,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 23:55:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 215 transitions. [2018-01-29 23:55:22,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-01-29 23:55:22,873 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:22,873 INFO L350 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:22,873 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:22,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1179612011, now seen corresponding path program 1 times [2018-01-29 23:55:22,873 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:22,873 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:22,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:22,875 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:22,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:22,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:23,081 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:23,081 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-29 23:55:23,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:23,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:23,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:23,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-01-29 23:55:23,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 23:55:23,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 23:55:23,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:55:23,196 INFO L87 Difference]: Start difference. First operand 206 states and 215 transitions. Second operand 15 states. [2018-01-29 23:55:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:23,267 INFO L93 Difference]: Finished difference Result 352 states and 370 transitions. [2018-01-29 23:55:23,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 23:55:23,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2018-01-29 23:55:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:23,269 INFO L225 Difference]: With dead ends: 352 [2018-01-29 23:55:23,269 INFO L226 Difference]: Without dead ends: 213 [2018-01-29 23:55:23,270 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 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-29 23:55:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-29 23:55:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2018-01-29 23:55:23,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-01-29 23:55:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 219 transitions. [2018-01-29 23:55:23,293 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 219 transitions. Word has length 135 [2018-01-29 23:55:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:23,294 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 219 transitions. [2018-01-29 23:55:23,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 23:55:23,294 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 219 transitions. [2018-01-29 23:55:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-01-29 23:55:23,295 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:23,295 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:23,295 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 601054099, now seen corresponding path program 2 times [2018-01-29 23:55:23,295 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:23,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:23,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:23,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:23,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:23,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:23,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:23,894 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-29 23:55:23,900 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 23:55:23,945 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:23,965 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:23,978 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:23,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:24,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:24,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-01-29 23:55:24,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 23:55:24,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 23:55:24,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2018-01-29 23:55:24,106 INFO L87 Difference]: Start difference. First operand 210 states and 219 transitions. Second operand 16 states. [2018-01-29 23:55:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:24,223 INFO L93 Difference]: Finished difference Result 356 states and 374 transitions. [2018-01-29 23:55:24,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:55:24,224 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 139 [2018-01-29 23:55:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:24,226 INFO L225 Difference]: With dead ends: 356 [2018-01-29 23:55:24,226 INFO L226 Difference]: Without dead ends: 217 [2018-01-29 23:55:24,226 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=161, Unknown=0, NotChecked=0, Total=272 [2018-01-29 23:55:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-29 23:55:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2018-01-29 23:55:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-29 23:55:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 223 transitions. [2018-01-29 23:55:24,263 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 223 transitions. Word has length 139 [2018-01-29 23:55:24,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:24,263 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 223 transitions. [2018-01-29 23:55:24,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 23:55:24,263 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 223 transitions. [2018-01-29 23:55:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-29 23:55:24,265 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:24,265 INFO L350 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:24,265 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash 299531153, now seen corresponding path program 3 times [2018-01-29 23:55:24,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:24,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:24,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:24,267 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:24,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:24,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:24,474 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:24,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:24,474 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-29 23:55:24,479 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 23:55:24,517 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:24,528 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:24,544 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:24,576 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:24,610 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:24,730 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:24,883 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:25,335 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:25,395 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:25,589 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:25,875 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:26,853 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:27,406 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 23:55:27,408 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:27,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:27,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:27,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 35 [2018-01-29 23:55:27,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 23:55:27,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 23:55:27,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=862, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 23:55:27,656 INFO L87 Difference]: Start difference. First operand 214 states and 223 transitions. Second operand 35 states. [2018-01-29 23:55:27,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:27,849 INFO L93 Difference]: Finished difference Result 360 states and 378 transitions. [2018-01-29 23:55:27,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-29 23:55:27,849 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2018-01-29 23:55:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:27,850 INFO L225 Difference]: With dead ends: 360 [2018-01-29 23:55:27,850 INFO L226 Difference]: Without dead ends: 221 [2018-01-29 23:55:27,851 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 23:55:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-01-29 23:55:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-01-29 23:55:27,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-29 23:55:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 227 transitions. [2018-01-29 23:55:27,880 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 227 transitions. Word has length 143 [2018-01-29 23:55:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:27,881 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 227 transitions. [2018-01-29 23:55:27,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 23:55:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 227 transitions. [2018-01-29 23:55:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-01-29 23:55:27,882 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:27,882 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:27,882 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1731554447, now seen corresponding path program 4 times [2018-01-29 23:55:27,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:27,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:27,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:27,883 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:27,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:27,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:28,218 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:28,218 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-29 23:55:28,231 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 23:55:28,362 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:28,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:28,405 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:28,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-01-29 23:55:28,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-29 23:55:28,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-29 23:55:28,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2018-01-29 23:55:28,406 INFO L87 Difference]: Start difference. First operand 218 states and 227 transitions. Second operand 18 states. [2018-01-29 23:55:28,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:28,497 INFO L93 Difference]: Finished difference Result 364 states and 382 transitions. [2018-01-29 23:55:28,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-29 23:55:28,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2018-01-29 23:55:28,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:28,498 INFO L225 Difference]: With dead ends: 364 [2018-01-29 23:55:28,498 INFO L226 Difference]: Without dead ends: 225 [2018-01-29 23:55:28,499 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=200, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:55:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-01-29 23:55:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-01-29 23:55:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-29 23:55:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 231 transitions. [2018-01-29 23:55:28,524 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 231 transitions. Word has length 147 [2018-01-29 23:55:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:28,525 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 231 transitions. [2018-01-29 23:55:28,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-29 23:55:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 231 transitions. [2018-01-29 23:55:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-01-29 23:55:28,525 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:28,525 INFO L350 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:28,526 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1013731699, now seen corresponding path program 5 times [2018-01-29 23:55:28,526 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:28,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:28,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:28,527 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:28,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:28,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:28,728 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:28,728 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-29 23:55:28,733 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 23:55:28,748 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,763 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,766 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,770 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,779 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,791 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,805 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,836 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,892 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:28,933 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:29,058 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:29,128 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:29,154 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:29,256 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:29,486 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 23:55:29,491 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:29,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:29,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:29,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-01-29 23:55:29,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 23:55:29,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 23:55:29,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-01-29 23:55:29,548 INFO L87 Difference]: Start difference. First operand 222 states and 231 transitions. Second operand 19 states. [2018-01-29 23:55:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:29,640 INFO L93 Difference]: Finished difference Result 368 states and 386 transitions. [2018-01-29 23:55:29,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 23:55:29,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 151 [2018-01-29 23:55:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:29,642 INFO L225 Difference]: With dead ends: 368 [2018-01-29 23:55:29,642 INFO L226 Difference]: Without dead ends: 229 [2018-01-29 23:55:29,643 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-01-29 23:55:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-29 23:55:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-01-29 23:55:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-01-29 23:55:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 235 transitions. [2018-01-29 23:55:29,683 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 235 transitions. Word has length 151 [2018-01-29 23:55:29,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:29,683 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 235 transitions. [2018-01-29 23:55:29,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 23:55:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 235 transitions. [2018-01-29 23:55:29,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-01-29 23:55:29,685 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:29,685 INFO L350 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:29,685 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:29,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1659158923, now seen corresponding path program 6 times [2018-01-29 23:55:29,685 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:29,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:29,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:29,686 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:29,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:29,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:30,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:30,327 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-29 23:55:30,345 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 23:55:30,406 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:30,416 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:30,428 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:30,492 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:30,692 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:31,000 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:31,234 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:31,644 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:32,078 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:32,792 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:35,026 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:36,653 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:37,561 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:40,044 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:45,628 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:48,870 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 23:55:48,873 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 23:55:48,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:49,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 23:55:49,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 41 [2018-01-29 23:55:49,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 23:55:49,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 23:55:49,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1168, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 23:55:49,196 INFO L87 Difference]: Start difference. First operand 226 states and 235 transitions. Second operand 41 states. [2018-01-29 23:55:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:55:49,564 INFO L93 Difference]: Finished difference Result 372 states and 390 transitions. [2018-01-29 23:55:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 23:55:49,565 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 155 [2018-01-29 23:55:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:55:49,566 INFO L225 Difference]: With dead ends: 372 [2018-01-29 23:55:49,566 INFO L226 Difference]: Without dead ends: 233 [2018-01-29 23:55:49,567 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=522, Invalid=1458, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 23:55:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-29 23:55:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-01-29 23:55:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-01-29 23:55:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 239 transitions. [2018-01-29 23:55:49,597 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 239 transitions. Word has length 155 [2018-01-29 23:55:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:55:49,597 INFO L432 AbstractCegarLoop]: Abstraction has 230 states and 239 transitions. [2018-01-29 23:55:49,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 23:55:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 239 transitions. [2018-01-29 23:55:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-01-29 23:55:49,598 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:55:49,598 INFO L350 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 23:55:49,599 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0RequiresViolation, ldv_kref_initErr1RequiresViolation, ldv_kobject_createErr0RequiresViolation, ldv_kobject_createErr1RequiresViolation, ldv_atomic_sub_returnErr1RequiresViolation, ldv_atomic_sub_returnErr0RequiresViolation, ldv_atomic_sub_returnErr3RequiresViolation, ldv_atomic_sub_returnErr2RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, mainErr0EnsuresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation]=== [2018-01-29 23:55:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash -44554871, now seen corresponding path program 7 times [2018-01-29 23:55:49,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:55:49,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:55:49,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:49,600 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 23:55:49,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:55:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:49,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:55:51,667 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 48 DAG size of output 18 [2018-01-29 23:55:51,857 WARN L146 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 56 DAG size of output 26 [2018-01-29 23:55:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 23:55:54,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 23:55:54,389 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 23:55:54,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:55:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:55:54,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 23:55:54,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-29 23:55:54,596 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 12 treesize of output 11 [2018-01-29 23:55:54,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-01-29 23:55:54,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-01-29 23:55:54,727 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:54,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-29 23:55:54,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-01-29 23:55:54,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-01-29 23:55:54,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:54,910 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:54,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:54,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 52 [2018-01-29 23:55:54,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:54,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 23:55:54,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-01-29 23:55:55,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-01-29 23:55:55,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 85 [2018-01-29 23:55:55,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:55,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:55,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 23:55:55,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-01-29 23:55:55,534 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-29 23:55:55,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 47 [2018-01-29 23:55:55,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,548 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,550 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,551 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,552 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,553 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,554 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:55,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 126 [2018-01-29 23:55:55,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:55,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:55,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 23:55:55,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:75 [2018-01-29 23:55:55,956 WARN L143 SmtUtils]: Spent 258ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-29 23:55:56,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-01-29 23:55:56,095 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,096 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,097 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,098 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,099 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,102 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,103 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,104 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,105 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,106 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 175 [2018-01-29 23:55:56,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:56,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:56,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 23:55:56,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:91 [2018-01-29 23:55:56,511 WARN L143 SmtUtils]: Spent 221ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-29 23:55:56,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-01-29 23:55:56,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,726 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,729 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,730 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,732 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,733 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,734 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,735 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,736 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,740 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,748 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:56,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 232 [2018-01-29 23:55:56,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:56,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:56,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-29 23:55:56,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:111, output treesize:107 [2018-01-29 23:55:57,612 WARN L143 SmtUtils]: Spent 577ms on a formula simplification that was a NOOP. DAG size: 50 [2018-01-29 23:55:58,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 74 [2018-01-29 23:55:58,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,992 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,993 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,994 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,997 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:58,999 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,000 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,001 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,002 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,007 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,010 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,011 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,013 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,014 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:55:59,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 297 [2018-01-29 23:55:59,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:55:59,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:55:59,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-29 23:55:59,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:127, output treesize:123 [2018-01-29 23:56:11,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 83 [2018-01-29 23:56:11,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,343 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,349 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,350 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,351 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,353 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,354 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,355 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,356 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,357 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,359 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,360 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,361 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,362 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,363 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,365 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,367 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,371 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,374 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,378 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:11,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 370 [2018-01-29 23:56:11,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:11,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:11,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-01-29 23:56:11,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:143, output treesize:139 [2018-01-29 23:56:46,841 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 65 [2018-01-29 23:56:46,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 92 [2018-01-29 23:56:46,859 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,860 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,862 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,865 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,867 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,869 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,870 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,871 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,874 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,877 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,878 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,879 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,880 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,881 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,887 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,893 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,894 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,905 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,907 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 23:56:46,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 451 [2018-01-29 23:56:46,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 23:56:47,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 23:56:47,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-01-29 23:56:47,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:159, output treesize:155 Received shutdown request... [2018-01-29 23:57:04,066 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 23:57:04,066 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 23:57:04,070 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 23:57:04,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:57:04 BoogieIcfgContainer [2018-01-29 23:57:04,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:57:04,071 INFO L168 Benchmark]: Toolchain (without parser) took 137991.95 ms. Allocated memory was 297.3 MB in the beginning and 969.9 MB in the end (delta: 672.7 MB). Free memory was 256.3 MB in the beginning and 503.6 MB in the end (delta: -247.3 MB). Peak memory consumption was 425.4 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:04,072 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 297.3 MB. Free memory is still 262.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:57:04,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.86 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 242.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:04,072 INFO L168 Benchmark]: Boogie Preprocessor took 41.21 ms. Allocated memory is still 297.3 MB. Free memory was 242.4 MB in the beginning and 240.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:04,072 INFO L168 Benchmark]: RCFGBuilder took 477.20 ms. Allocated memory is still 297.3 MB. Free memory was 240.4 MB in the beginning and 205.7 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:04,073 INFO L168 Benchmark]: TraceAbstraction took 137216.16 ms. Allocated memory was 297.3 MB in the beginning and 969.9 MB in the end (delta: 672.7 MB). Free memory was 205.7 MB in the beginning and 503.6 MB in the end (delta: -297.9 MB). Peak memory consumption was 374.8 MB. Max. memory is 5.3 GB. [2018-01-29 23:57:04,074 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.21 ms. Allocated memory is still 297.3 MB. Free memory is still 262.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 248.86 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 242.4 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.21 ms. Allocated memory is still 297.3 MB. Free memory was 242.4 MB in the beginning and 240.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 477.20 ms. Allocated memory is still 297.3 MB. Free memory was 240.4 MB in the beginning and 205.7 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 137216.16 ms. Allocated memory was 297.3 MB in the beginning and 969.9 MB in the end (delta: 672.7 MB). Free memory was 205.7 MB in the beginning and 503.6 MB in the end (delta: -297.9 MB). Peak memory consumption was 374.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1294). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1411). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1265). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1267). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1443]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1443). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was analyzing trace of length 160 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 81 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 147 locations, 19 error locations. TIMEOUT Result, 137.1s OverallTime, 29 OverallIterations, 16 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3564 SDtfs, 1585 SDslu, 34931 SDs, 0 SdLazy, 8575 SolverSat, 258 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2029 GetRequests, 1518 SyntacticMatches, 5 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3040 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 84 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 23.0s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 3904 NumberOfCodeBlocks, 3820 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 3861 ConstructedInterpolants, 264 QuantifiedInterpolants, 1606700 SizeOfPredicates, 84 NumberOfNonLiveVariables, 5327 ConjunctsInSsa, 429 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 627/5006 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-57-04-080.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test22_3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-57-04-080.csv Completed graceful shutdown