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_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test12_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:59:00,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:59:00,997 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:59:01,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:59:01,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:59:01,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:59:01,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:59:01,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:59:01,021 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:59:01,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:59:01,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:59:01,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:59:01,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:59:01,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:59:01,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:59:01,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:59:01,031 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:59:01,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:59:01,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:59:01,036 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:59:01,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:59:01,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:59:01,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:59:01,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:59:01,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:59:01,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:59:01,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:59:01,044 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:59:01,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:59:01,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:59:01,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:59:01,045 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-24 15:59:01,056 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:59:01,056 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:59:01,057 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:59:01,057 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:59:01,057 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:59:01,058 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:59:01,058 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:59:01,058 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:59:01,059 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:59:01,059 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:59:01,059 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:59:01,059 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:59:01,059 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:59:01,060 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:59:01,060 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:59:01,060 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:59:01,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:59:01,060 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:59:01,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:59:01,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:59:01,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:59:01,061 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:59:01,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:59:01,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:59:01,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:59:01,062 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:59:01,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:59:01,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:59:01,063 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:59:01,063 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:59:01,063 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:59:01,063 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:59:01,063 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:59:01,064 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:59:01,064 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:59:01,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:59:01,115 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:59:01,119 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:59:01,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:59:01,122 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:59:01,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test12_true-valid-memsafety.i [2018-01-24 15:59:01,332 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:59:01,338 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:59:01,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:59:01,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:59:01,344 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:59:01,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6fdad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01, skipping insertion in model container [2018-01-24 15:59:01,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,361 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:59:01,414 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:59:01,557 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:59:01,596 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:59:01,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01 WrapperNode [2018-01-24 15:59:01,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:59:01,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:59:01,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:59:01,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:59:01,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... [2018-01-24 15:59:01,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:59:01,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:59:01,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:59:01,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:59:01,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:59:01,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:59:01,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:59:01,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-01-24 15:59:01,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2018-01-24 15:59:01,712 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure master_xfer [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_i2c_transfer [2018-01-24 15:59:01,713 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_m88ts2022_rd_reg [2018-01-24 15:59:01,714 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_fix_12 [2018-01-24 15:59:01,714 INFO L136 BoogieDeclarations]: Found implementation of procedure free_12 [2018-01-24 15:59:01,714 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 15:59:01,714 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:59:01,714 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 15:59:01,714 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 15:59:01,714 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:59:01,714 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:59:01,714 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-24 15:59:01,715 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 15:59:01,715 INFO L128 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-01-24 15:59:01,716 INFO L128 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-01-24 15:59:01,716 INFO L128 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-01-24 15:59:01,716 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-01-24 15:59:01,716 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-01-24 15:59:01,716 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2018-01-24 15:59:01,716 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2018-01-24 15:59:01,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2018-01-24 15:59:01,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2018-01-24 15:59:01,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2018-01-24 15:59:01,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-24 15:59:01,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-24 15:59:01,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-01-24 15:59:01,717 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-01-24 15:59:01,718 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2018-01-24 15:59:01,718 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2018-01-24 15:59:01,718 INFO L128 BoogieDeclarations]: Found specification of procedure master_xfer [2018-01-24 15:59:01,718 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_i2c_transfer [2018-01-24 15:59:01,718 INFO L128 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-01-24 15:59:01,718 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_m88ts2022_rd_reg [2018-01-24 15:59:01,719 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_fix_12 [2018-01-24 15:59:01,719 INFO L128 BoogieDeclarations]: Found specification of procedure free_12 [2018-01-24 15:59:01,719 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 15:59:01,719 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:59:01,719 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:59:01,719 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:59:02,664 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 15:59:02,792 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:59:02,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:59:02 BoogieIcfgContainer [2018-01-24 15:59:02,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:59:02,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:59:02,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:59:02,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:59:02,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:59:01" (1/3) ... [2018-01-24 15:59:02,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bc3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:59:02, skipping insertion in model container [2018-01-24 15:59:02,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:59:01" (2/3) ... [2018-01-24 15:59:02,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9bc3e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:59:02, skipping insertion in model container [2018-01-24 15:59:02,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:59:02" (3/3) ... [2018-01-24 15:59:02,801 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test12_true-valid-memsafety.i [2018-01-24 15:59:02,810 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:59:02,820 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-01-24 15:59:02,878 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:59:02,878 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:59:02,878 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:59:02,878 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:59:02,878 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:59:02,879 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:59:02,879 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:59:02,879 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:59:02,880 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:59:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states. [2018-01-24 15:59:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 15:59:02,919 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:59:02,920 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 15:59:02,920 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, alloc_fix_12Err4RequiresViolation, alloc_fix_12Err0RequiresViolation, alloc_fix_12Err5RequiresViolation, alloc_fix_12Err12RequiresViolation, alloc_fix_12Err3RequiresViolation, alloc_fix_12Err1RequiresViolation, alloc_fix_12Err13RequiresViolation, alloc_fix_12Err8RequiresViolation, alloc_fix_12Err15RequiresViolation, alloc_fix_12Err10RequiresViolation, alloc_fix_12Err6RequiresViolation, alloc_fix_12Err14RequiresViolation, alloc_fix_12Err11RequiresViolation, alloc_fix_12Err7RequiresViolation, alloc_fix_12Err9RequiresViolation, alloc_fix_12Err2RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-24 15:59:02,926 INFO L82 PathProgramCache]: Analyzing trace with hash 18685926, now seen corresponding path program 1 times [2018-01-24 15:59:02,929 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:59:02,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:02,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:59:02,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:02,997 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:59:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:59:03,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:59:03,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:59:03,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:59:03,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:59:03,196 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:59:03,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:59:03,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:59:03,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:59:03,212 INFO L87 Difference]: Start difference. First operand 398 states. Second operand 3 states. [2018-01-24 15:59:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:59:03,686 INFO L93 Difference]: Finished difference Result 668 states and 724 transitions. [2018-01-24 15:59:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:59:03,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 15:59:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:59:03,703 INFO L225 Difference]: With dead ends: 668 [2018-01-24 15:59:03,703 INFO L226 Difference]: Without dead ends: 481 [2018-01-24 15:59:03,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:59:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-01-24 15:59:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 436. [2018-01-24 15:59:03,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-01-24 15:59:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 491 transitions. [2018-01-24 15:59:03,772 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 491 transitions. Word has length 4 [2018-01-24 15:59:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:59:03,772 INFO L432 AbstractCegarLoop]: Abstraction has 436 states and 491 transitions. [2018-01-24 15:59:03,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:59:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 491 transitions. [2018-01-24 15:59:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 15:59:03,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:59:03,773 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 15:59:03,773 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, alloc_fix_12Err4RequiresViolation, alloc_fix_12Err0RequiresViolation, alloc_fix_12Err5RequiresViolation, alloc_fix_12Err12RequiresViolation, alloc_fix_12Err3RequiresViolation, alloc_fix_12Err1RequiresViolation, alloc_fix_12Err13RequiresViolation, alloc_fix_12Err8RequiresViolation, alloc_fix_12Err15RequiresViolation, alloc_fix_12Err10RequiresViolation, alloc_fix_12Err6RequiresViolation, alloc_fix_12Err14RequiresViolation, alloc_fix_12Err11RequiresViolation, alloc_fix_12Err7RequiresViolation, alloc_fix_12Err9RequiresViolation, alloc_fix_12Err2RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-24 15:59:03,774 INFO L82 PathProgramCache]: Analyzing trace with hash 18685927, now seen corresponding path program 1 times [2018-01-24 15:59:03,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:59:03,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:03,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:59:03,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:03,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:59:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:59:03,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:59:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:59:03,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:59:03,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:59:03,854 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:59:03,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:59:03,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:59:03,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:59:03,856 INFO L87 Difference]: Start difference. First operand 436 states and 491 transitions. Second operand 3 states. [2018-01-24 15:59:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:59:04,054 INFO L93 Difference]: Finished difference Result 570 states and 656 transitions. [2018-01-24 15:59:04,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:59:04,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 15:59:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:59:04,058 INFO L225 Difference]: With dead ends: 570 [2018-01-24 15:59:04,058 INFO L226 Difference]: Without dead ends: 567 [2018-01-24 15:59:04,059 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:59:04,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-01-24 15:59:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 497. [2018-01-24 15:59:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-01-24 15:59:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 602 transitions. [2018-01-24 15:59:04,090 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 602 transitions. Word has length 4 [2018-01-24 15:59:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:59:04,091 INFO L432 AbstractCegarLoop]: Abstraction has 497 states and 602 transitions. [2018-01-24 15:59:04,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:59:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 602 transitions. [2018-01-24 15:59:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:59:04,092 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:59:04,092 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:59:04,092 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, alloc_fix_12Err4RequiresViolation, alloc_fix_12Err0RequiresViolation, alloc_fix_12Err5RequiresViolation, alloc_fix_12Err12RequiresViolation, alloc_fix_12Err3RequiresViolation, alloc_fix_12Err1RequiresViolation, alloc_fix_12Err13RequiresViolation, alloc_fix_12Err8RequiresViolation, alloc_fix_12Err15RequiresViolation, alloc_fix_12Err10RequiresViolation, alloc_fix_12Err6RequiresViolation, alloc_fix_12Err14RequiresViolation, alloc_fix_12Err11RequiresViolation, alloc_fix_12Err7RequiresViolation, alloc_fix_12Err9RequiresViolation, alloc_fix_12Err2RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-24 15:59:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash -769194584, now seen corresponding path program 1 times [2018-01-24 15:59:04,092 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:59:04,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:04,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:59:04,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:04,094 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:59:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:59:04,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:59:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:59:04,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:59:04,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:59:04,195 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:59:04,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:59:04,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:59:04,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:59:04,195 INFO L87 Difference]: Start difference. First operand 497 states and 602 transitions. Second operand 6 states. [2018-01-24 15:59:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:59:04,317 INFO L93 Difference]: Finished difference Result 624 states and 762 transitions. [2018-01-24 15:59:04,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:59:04,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 15:59:04,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:59:04,323 INFO L225 Difference]: With dead ends: 624 [2018-01-24 15:59:04,323 INFO L226 Difference]: Without dead ends: 543 [2018-01-24 15:59:04,324 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:59:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-01-24 15:59:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 496. [2018-01-24 15:59:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-01-24 15:59:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 604 transitions. [2018-01-24 15:59:04,359 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 604 transitions. Word has length 21 [2018-01-24 15:59:04,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:59:04,360 INFO L432 AbstractCegarLoop]: Abstraction has 496 states and 604 transitions. [2018-01-24 15:59:04,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:59:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 604 transitions. [2018-01-24 15:59:04,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:59:04,361 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:59:04,361 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:59:04,361 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, alloc_fix_12Err4RequiresViolation, alloc_fix_12Err0RequiresViolation, alloc_fix_12Err5RequiresViolation, alloc_fix_12Err12RequiresViolation, alloc_fix_12Err3RequiresViolation, alloc_fix_12Err1RequiresViolation, alloc_fix_12Err13RequiresViolation, alloc_fix_12Err8RequiresViolation, alloc_fix_12Err15RequiresViolation, alloc_fix_12Err10RequiresViolation, alloc_fix_12Err6RequiresViolation, alloc_fix_12Err14RequiresViolation, alloc_fix_12Err11RequiresViolation, alloc_fix_12Err7RequiresViolation, alloc_fix_12Err9RequiresViolation, alloc_fix_12Err2RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-24 15:59:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 976272294, now seen corresponding path program 1 times [2018-01-24 15:59:04,362 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:59:04,363 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:04,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:59:04,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:04,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:59:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:59:04,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:59:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:59:04,491 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:59:04,491 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:59:04,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:59:04,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:59:04,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:59:04,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:59:04,493 INFO L87 Difference]: Start difference. First operand 496 states and 604 transitions. Second operand 5 states. [2018-01-24 15:59:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:59:05,023 INFO L93 Difference]: Finished difference Result 572 states and 705 transitions. [2018-01-24 15:59:05,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:59:05,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-24 15:59:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:59:05,026 INFO L225 Difference]: With dead ends: 572 [2018-01-24 15:59:05,026 INFO L226 Difference]: Without dead ends: 571 [2018-01-24 15:59:05,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:59:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-01-24 15:59:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 538. [2018-01-24 15:59:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-01-24 15:59:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 661 transitions. [2018-01-24 15:59:05,057 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 661 transitions. Word has length 21 [2018-01-24 15:59:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:59:05,057 INFO L432 AbstractCegarLoop]: Abstraction has 538 states and 661 transitions. [2018-01-24 15:59:05,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:59:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 661 transitions. [2018-01-24 15:59:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:59:05,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:59:05,058 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:59:05,058 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, alloc_fix_12Err4RequiresViolation, alloc_fix_12Err0RequiresViolation, alloc_fix_12Err5RequiresViolation, alloc_fix_12Err12RequiresViolation, alloc_fix_12Err3RequiresViolation, alloc_fix_12Err1RequiresViolation, alloc_fix_12Err13RequiresViolation, alloc_fix_12Err8RequiresViolation, alloc_fix_12Err15RequiresViolation, alloc_fix_12Err10RequiresViolation, alloc_fix_12Err6RequiresViolation, alloc_fix_12Err14RequiresViolation, alloc_fix_12Err11RequiresViolation, alloc_fix_12Err7RequiresViolation, alloc_fix_12Err9RequiresViolation, alloc_fix_12Err2RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-24 15:59:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash 976272295, now seen corresponding path program 1 times [2018-01-24 15:59:05,059 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:59:05,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:05,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:59:05,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:05,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:59:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:59:05,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:59:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:59:05,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:59:05,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:59:05,213 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:59:05,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:59:05,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:59:05,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:59:05,214 INFO L87 Difference]: Start difference. First operand 538 states and 661 transitions. Second operand 7 states. [2018-01-24 15:59:06,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:59:06,582 INFO L93 Difference]: Finished difference Result 669 states and 772 transitions. [2018-01-24 15:59:06,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:59:06,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 15:59:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:59:06,586 INFO L225 Difference]: With dead ends: 669 [2018-01-24 15:59:06,586 INFO L226 Difference]: Without dead ends: 668 [2018-01-24 15:59:06,587 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:59:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-01-24 15:59:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 538. [2018-01-24 15:59:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-01-24 15:59:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 660 transitions. [2018-01-24 15:59:06,629 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 660 transitions. Word has length 21 [2018-01-24 15:59:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:59:06,629 INFO L432 AbstractCegarLoop]: Abstraction has 538 states and 660 transitions. [2018-01-24 15:59:06,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:59:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 660 transitions. [2018-01-24 15:59:06,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:59:06,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:59:06,631 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:59:06,631 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, alloc_fix_12Err4RequiresViolation, alloc_fix_12Err0RequiresViolation, alloc_fix_12Err5RequiresViolation, alloc_fix_12Err12RequiresViolation, alloc_fix_12Err3RequiresViolation, alloc_fix_12Err1RequiresViolation, alloc_fix_12Err13RequiresViolation, alloc_fix_12Err8RequiresViolation, alloc_fix_12Err15RequiresViolation, alloc_fix_12Err10RequiresViolation, alloc_fix_12Err6RequiresViolation, alloc_fix_12Err14RequiresViolation, alloc_fix_12Err11RequiresViolation, alloc_fix_12Err7RequiresViolation, alloc_fix_12Err9RequiresViolation, alloc_fix_12Err2RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-24 15:59:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash 886332479, now seen corresponding path program 1 times [2018-01-24 15:59:06,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:59:06,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:06,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:59:06,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:06,633 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:59:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:59:06,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:59:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:59:06,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:59:06,694 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:59:06,695 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:59:06,697 INFO L201 CegarAbsIntRunner]: [273], [278], [280], [283], [348], [479], [485], [486], [487], [488], [489], [492], [495], [516], [546], [547], [548], [549], [580], [581], [582] [2018-01-24 15:59:06,764 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:59:06,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:59:10,400 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:59:10,401 INFO L268 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Never found a fixpoint. Largest state had 26 variables. [2018-01-24 15:59:10,411 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:59:11,554 INFO L232 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 90.06% of their original sizes. [2018-01-24 15:59:11,554 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:59:11,621 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:59:11,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:59:11,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2018-01-24 15:59:11,622 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:59:11,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:59:11,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:59:11,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:59:11,623 INFO L87 Difference]: Start difference. First operand 538 states and 660 transitions. Second operand 9 states. [2018-01-24 15:59:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:59:24,408 INFO L93 Difference]: Finished difference Result 1062 states and 1246 transitions. [2018-01-24 15:59:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 15:59:24,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 15:59:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:59:24,412 INFO L225 Difference]: With dead ends: 1062 [2018-01-24 15:59:24,412 INFO L226 Difference]: Without dead ends: 546 [2018-01-24 15:59:24,415 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:59:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-01-24 15:59:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 501. [2018-01-24 15:59:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-01-24 15:59:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 579 transitions. [2018-01-24 15:59:24,458 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 579 transitions. Word has length 24 [2018-01-24 15:59:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:59:24,458 INFO L432 AbstractCegarLoop]: Abstraction has 501 states and 579 transitions. [2018-01-24 15:59:24,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:59:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 579 transitions. [2018-01-24 15:59:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:59:24,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:59:24,459 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:59:24,460 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr0RequiresViolation, ldv_list_addErr1RequiresViolation, ldv_destroy_msgsErr5RequiresViolation, ldv_destroy_msgsErr3RequiresViolation, ldv_destroy_msgsErr4RequiresViolation, ldv_destroy_msgsErr0RequiresViolation, ldv_destroy_msgsErr2RequiresViolation, ldv_destroy_msgsErr1RequiresViolation, ldv_msg_fillErr3RequiresViolation, ldv_msg_fillErr1RequiresViolation, ldv_msg_fillErr5RequiresViolation, ldv_msg_fillErr0RequiresViolation, ldv_msg_fillErr4RequiresViolation, ldv_msg_fillErr2RequiresViolation, __ldv_list_delErr2RequiresViolation, __ldv_list_delErr0RequiresViolation, __ldv_list_delErr1RequiresViolation, __ldv_list_delErr3RequiresViolation, ldv_kobject_cleanupErr4RequiresViolation, ldv_kobject_cleanupErr2RequiresViolation, ldv_kobject_cleanupErr5RequiresViolation, ldv_kobject_cleanupErr3RequiresViolation, ldv_kobject_cleanupErr0RequiresViolation, ldv_kobject_cleanupErr1RequiresViolation, ldv_msg_freeErr5RequiresViolation, ldv_msg_freeErr3RequiresViolation, ldv_msg_freeErr1RequiresViolation, ldv_msg_freeErr0RequiresViolation, ldv_msg_freeErr4RequiresViolation, ldv_msg_freeErr2RequiresViolation, mainErr0EnsuresViolation, ldv_list_delErr3RequiresViolation, ldv_list_delErr1RequiresViolation, ldv_list_delErr0RequiresViolation, ldv_list_delErr2RequiresViolation, ldv_m88ts2022_rd_regErr30RequiresViolation, ldv_m88ts2022_rd_regErr25RequiresViolation, ldv_m88ts2022_rd_regErr20RequiresViolation, ldv_m88ts2022_rd_regErr15RequiresViolation, ldv_m88ts2022_rd_regErr2RequiresViolation, ldv_m88ts2022_rd_regErr10RequiresViolation, ldv_m88ts2022_rd_regErr17RequiresViolation, ldv_m88ts2022_rd_regErr22RequiresViolation, ldv_m88ts2022_rd_regErr12RequiresViolation, ldv_m88ts2022_rd_regErr8RequiresViolation, ldv_m88ts2022_rd_regErr31RequiresViolation, ldv_m88ts2022_rd_regErr28RequiresViolation, ldv_m88ts2022_rd_regErr18RequiresViolation, ldv_m88ts2022_rd_regErr21RequiresViolation, ldv_m88ts2022_rd_regErr5RequiresViolation, ldv_m88ts2022_rd_regErr1RequiresViolation, ldv_m88ts2022_rd_regErr11RequiresViolation, ldv_m88ts2022_rd_regErr29RequiresViolation, ldv_m88ts2022_rd_regErr16RequiresViolation, ldv_m88ts2022_rd_regErr24RequiresViolation, ldv_m88ts2022_rd_regErr4RequiresViolation, ldv_m88ts2022_rd_regErr14RequiresViolation, ldv_m88ts2022_rd_regErr6RequiresViolation, ldv_m88ts2022_rd_regErr9RequiresViolation, ldv_m88ts2022_rd_regErr19RequiresViolation, ldv_m88ts2022_rd_regErr27RequiresViolation, ldv_m88ts2022_rd_regErr13RequiresViolation, ldv_m88ts2022_rd_regErr3RequiresViolation, ldv_m88ts2022_rd_regErr23RequiresViolation, ldv_m88ts2022_rd_regErr32RequiresViolation, ldv_m88ts2022_rd_regErr7RequiresViolation, ldv_m88ts2022_rd_regErr33RequiresViolation, ldv_m88ts2022_rd_regErr0RequiresViolation, ldv_m88ts2022_rd_regErr26RequiresViolation, LDV_INIT_LIST_HEADErr1RequiresViolation, LDV_INIT_LIST_HEADErr3RequiresViolation, LDV_INIT_LIST_HEADErr2RequiresViolation, LDV_INIT_LIST_HEADErr0RequiresViolation, __ldv_list_addErr6RequiresViolation, __ldv_list_addErr1RequiresViolation, __ldv_list_addErr7RequiresViolation, __ldv_list_addErr0RequiresViolation, __ldv_list_addErr2RequiresViolation, __ldv_list_addErr4RequiresViolation, __ldv_list_addErr5RequiresViolation, __ldv_list_addErr3RequiresViolation, alloc_fix_12Err4RequiresViolation, alloc_fix_12Err0RequiresViolation, alloc_fix_12Err5RequiresViolation, alloc_fix_12Err12RequiresViolation, alloc_fix_12Err3RequiresViolation, alloc_fix_12Err1RequiresViolation, alloc_fix_12Err13RequiresViolation, alloc_fix_12Err8RequiresViolation, alloc_fix_12Err15RequiresViolation, alloc_fix_12Err10RequiresViolation, alloc_fix_12Err6RequiresViolation, alloc_fix_12Err14RequiresViolation, alloc_fix_12Err11RequiresViolation, alloc_fix_12Err7RequiresViolation, alloc_fix_12Err9RequiresViolation, alloc_fix_12Err2RequiresViolation, master_xferErr0RequiresViolation, master_xferErr3RequiresViolation, master_xferErr1RequiresViolation, master_xferErr2RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, ldv_i2c_transferErr0RequiresViolation, ldv_i2c_transferErr1RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, free_12Err1RequiresViolation, free_12Err6RequiresViolation, free_12Err3RequiresViolation, free_12Err2RequiresViolation, free_12Err0RequiresViolation, free_12Err7RequiresViolation, free_12Err4RequiresViolation, free_12Err5RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr18RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr19RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_msg_allocErr0RequiresViolation, ldv_msg_allocErr1RequiresViolation]=== [2018-01-24 15:59:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1359343331, now seen corresponding path program 1 times [2018-01-24 15:59:24,460 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:59:24,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:24,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:59:24,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:59:24,462 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:59:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:59:24,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:59:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 15:59:24,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:59:24,563 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:59:24,563 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 15:59:24,563 INFO L201 CegarAbsIntRunner]: [273], [278], [280], [283], [348], [479], [482], [483], [484], [485], [486], [487], [488], [489], [492], [495], [516], [546], [547], [548], [549], [580], [581], [582] [2018-01-24 15:59:24,564 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:59:24,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:59:27,549 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 15:59:27,549 INFO L268 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 6 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 15:59:27,552 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 15:59:28,980 INFO L232 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 84.15% of their original sizes. [2018-01-24 15:59:28,980 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 15:59:29,095 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 15:59:29,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:59:29,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [5] total 18 [2018-01-24 15:59:29,095 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:59:29,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:59:29,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:59:29,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:59:29,096 INFO L87 Difference]: Start difference. First operand 501 states and 579 transitions. Second operand 15 states. Received shutdown request... [2018-01-24 15:59:48,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-01-24 15:59:48,039 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:59:48,046 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:59:48,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:59:48 BoogieIcfgContainer [2018-01-24 15:59:48,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:59:48,047 INFO L168 Benchmark]: Toolchain (without parser) took 46714.48 ms. Allocated memory was 304.1 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 263.0 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 468.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:59:48,048 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:59:48,048 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.80 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 246.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:59:48,049 INFO L168 Benchmark]: Boogie Preprocessor took 51.53 ms. Allocated memory is still 304.1 MB. Free memory was 246.0 MB in the beginning and 243.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:59:48,049 INFO L168 Benchmark]: RCFGBuilder took 1128.68 ms. Allocated memory was 304.1 MB in the beginning and 329.3 MB in the end (delta: 25.2 MB). Free memory was 243.0 MB in the beginning and 262.9 MB in the end (delta: -19.9 MB). Peak memory consumption was 69.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:59:48,049 INFO L168 Benchmark]: TraceAbstraction took 45252.63 ms. Allocated memory was 329.3 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 262.9 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 443.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:59:48,051 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.24 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 273.80 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 246.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.53 ms. Allocated memory is still 304.1 MB. Free memory was 246.0 MB in the beginning and 243.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1128.68 ms. Allocated memory was 304.1 MB in the beginning and 329.3 MB in the end (delta: 25.2 MB). Free memory was 243.0 MB in the beginning and 262.9 MB in the end (delta: -19.9 MB). Peak memory consumption was 69.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 45252.63 ms. Allocated memory was 329.3 MB in the beginning and 2.2 GB in the end (delta: 1.8 GB). Free memory was 262.9 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 443.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 15 LocStat_MAX_WEQGRAPH_SIZE : 12 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 171 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -30 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.044332 RENAME_VARIABLES(MILLISECONDS) : 0.834213 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.392721 PROJECTAWAY(MILLISECONDS) : 0.021160 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.113752 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.857026 ADD_EQUALITY(MILLISECONDS) : 0.014594 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005898 #CONJOIN_DISJUNCTIVE : 32 #RENAME_VARIABLES : 47 #UNFREEZE : 0 #CONJOIN : 95 #PROJECTAWAY : 48 #ADD_WEAK_EQUALITY : 15 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 46 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 12 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 235 LocStat_NO_SUPPORTING_DISEQUALITIES : 130 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 77 TransStat_NO_SUPPORTING_DISEQUALITIES : 10 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.365142 RENAME_VARIABLES(MILLISECONDS) : 0.904326 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.341899 PROJECTAWAY(MILLISECONDS) : 0.152726 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.029277 DISJOIN(MILLISECONDS) : 4.354486 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.927739 ADD_EQUALITY(MILLISECONDS) : 0.007099 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009578 #CONJOIN_DISJUNCTIVE : 67 #RENAME_VARIABLES : 126 #UNFREEZE : 0 #CONJOIN : 157 #PROJECTAWAY : 104 #ADD_WEAK_EQUALITY : 17 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 85 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1121). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1121). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1179). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1157). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1157). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1156). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1116). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1115). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1115). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1116). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1344). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1340). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1339). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1164). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1164). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1163). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1620). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1131). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1512). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1522). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1515). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1530). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1512). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1100). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1099). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1110). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1107). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1110). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1107). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1108). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1109). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1109). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1108). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1541). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1560). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1542). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1541). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1560). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1546). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1564). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1551). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1564). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1551). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1545). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1546). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1542). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1135). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1508). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1508). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1570). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1575). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1571). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1571). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1570). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1575). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1572). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1572). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1593). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1610). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1614). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1585). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1585). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1608). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1614). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1598). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1600). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1606). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1589). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1612). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1598). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1608). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1610). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1612). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1593). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1589). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1600). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1606). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1146). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1146). Cancelled while BasicCegarLoop was constructing difference of abstraction (501states) and interpolant automaton (currently 29 states, 15 states before enhancement), while ReachableStatesComputation was computing reachable states (336 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 416 locations, 141 error locations. TIMEOUT Result, 45.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 34.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2332 SDtfs, 2118 SDslu, 5924 SDs, 0 SdLazy, 2171 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=538occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.7s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.9498084908011378 AbsIntWeakeningRatio, 0.875 AbsIntAvgWeakeningVarsNumRemoved, 10.708333333333334 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 370 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 12790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_test12_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-59-48-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-59-48-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-59-48-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-59-48-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-59-48-066.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test12_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-59-48-066.csv Completed graceful shutdown