./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:50:08,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:50:08,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:50:08,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:50:08,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:50:08,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:50:08,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:50:08,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:50:08,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:50:08,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:50:08,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:50:08,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:50:08,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:50:08,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:50:08,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:50:08,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:50:08,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:50:08,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:50:08,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:50:08,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:50:08,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:50:08,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:50:08,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:50:08,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:50:08,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:50:08,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:50:08,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:50:08,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:50:08,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:50:08,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:50:08,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:50:08,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:50:08,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:50:08,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:50:08,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:50:08,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:50:08,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:50:08,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:50:08,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:50:08,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:50:08,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:50:08,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 20:50:08,971 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:50:08,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:50:08,971 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:50:08,972 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:50:08,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:50:08,973 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:50:08,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:50:08,974 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:50:08,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:50:08,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:50:08,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:50:08,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:50:08,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:50:08,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:50:08,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:50:08,975 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:50:08,975 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 20:50:08,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 20:50:08,975 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:50:08,975 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:50:08,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:50:08,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:50:08,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb [2021-11-22 20:50:09,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:50:09,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:50:09,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:50:09,199 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:50:09,200 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:50:09,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-11-22 20:50:09,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be68bc0e/5f522bc708fa496592c1d44643bee844/FLAG43e3b21db [2021-11-22 20:50:09,943 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:50:09,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-11-22 20:50:09,984 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be68bc0e/5f522bc708fa496592c1d44643bee844/FLAG43e3b21db [2021-11-22 20:50:10,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be68bc0e/5f522bc708fa496592c1d44643bee844 [2021-11-22 20:50:10,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:50:10,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:50:10,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:50:10,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:50:10,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:50:10,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:50:10" (1/1) ... [2021-11-22 20:50:10,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5094b119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:10, skipping insertion in model container [2021-11-22 20:50:10,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:50:10" (1/1) ... [2021-11-22 20:50:10,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:50:10,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:50:12,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2021-11-22 20:50:12,098 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:50:12,137 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:50:12,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2021-11-22 20:50:12,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:50:12,610 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:50:12,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12 WrapperNode [2021-11-22 20:50:12,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:50:12,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:50:12,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:50:12,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:50:12,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:12,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:12,990 INFO L137 Inliner]: procedures = 309, calls = 2428, calls flagged for inlining = 573, calls inlined = 887, statements flattened = 13102 [2021-11-22 20:50:12,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:50:12,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:50:12,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:50:12,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:50:13,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:50:13,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:50:13,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:50:13,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:50:13,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (1/1) ... [2021-11-22 20:50:13,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:50:13,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:50:13,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 20:50:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 20:50:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 20:50:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 20:50:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:50:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:50:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:50:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:50:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-22 20:50:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2021-11-22 20:50:13,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2021-11-22 20:50:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-22 20:50:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 20:50:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 20:50:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:50:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:50:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:50:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_check_events [2021-11-22 20:50:13,674 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_check_events [2021-11-22 20:50:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 20:50:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:50:13,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:50:14,359 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:50:14,361 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:50:14,483 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,518 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,525 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,528 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,546 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,550 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,574 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,577 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:14,592 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:50:23,084 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1046: assume false; [2021-11-22 20:50:23,084 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1047: assume !false; [2021-11-22 20:50:23,085 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##503: assume !false; [2021-11-22 20:50:23,085 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##502: assume false; [2021-11-22 20:50:23,085 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##65: assume false; [2021-11-22 20:50:23,085 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume !false; [2021-11-22 20:50:23,085 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##589: assume false; [2021-11-22 20:50:23,085 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##590: assume !false; [2021-11-22 20:50:23,085 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##627: assume !false; [2021-11-22 20:50:23,086 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##626: assume false; [2021-11-22 20:50:23,086 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1663: assume false; [2021-11-22 20:50:23,086 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1664: assume !false; [2021-11-22 20:50:23,086 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1409: assume false; [2021-11-22 20:50:23,086 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1410: assume !false; [2021-11-22 20:50:23,086 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1462: assume false; [2021-11-22 20:50:23,087 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1463: assume !false; [2021-11-22 20:50:23,087 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##958: assume !false; [2021-11-22 20:50:23,087 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##957: assume false; [2021-11-22 20:50:23,088 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 20:50:23,116 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 20:50:23,116 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-22 20:50:23,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:50:23 BoogieIcfgContainer [2021-11-22 20:50:23,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 20:50:23,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 20:50:23,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 20:50:23,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 20:50:23,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:50:10" (1/3) ... [2021-11-22 20:50:23,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2692b039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:50:23, skipping insertion in model container [2021-11-22 20:50:23,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:50:12" (2/3) ... [2021-11-22 20:50:23,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2692b039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:50:23, skipping insertion in model container [2021-11-22 20:50:23,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:50:23" (3/3) ... [2021-11-22 20:50:23,130 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-11-22 20:50:23,134 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 20:50:23,134 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 20:50:23,220 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 20:50:23,235 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 20:50:23,236 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 20:50:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 1991 states, 1980 states have (on average 1.3853535353535353) internal successors, (2743), 1985 states have internal predecessors, (2743), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-22 20:50:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 20:50:23,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:23,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:23,304 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:23,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1629111837, now seen corresponding path program 1 times [2021-11-22 20:50:23,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326859954] [2021-11-22 20:50:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:23,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:23,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:23,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326859954] [2021-11-22 20:50:23,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326859954] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:23,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:23,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 20:50:23,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376065919] [2021-11-22 20:50:23,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:23,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:50:23,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:50:23,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:50:23,933 INFO L87 Difference]: Start difference. First operand has 1991 states, 1980 states have (on average 1.3853535353535353) internal successors, (2743), 1985 states have internal predecessors, (2743), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:24,211 INFO L93 Difference]: Finished difference Result 5885 states and 8139 transitions. [2021-11-22 20:50:24,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:50:24,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-22 20:50:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:24,252 INFO L225 Difference]: With dead ends: 5885 [2021-11-22 20:50:24,252 INFO L226 Difference]: Without dead ends: 3872 [2021-11-22 20:50:24,262 INFO L932 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 [2021-11-22 20:50:24,266 INFO L933 BasicCegarLoop]: 2749 mSDtfsCounter, 2651 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 5329 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:24,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2651 Valid, 5329 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2021-11-22 20:50:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3864. [2021-11-22 20:50:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3849 states have (on average 1.3507404520654716) internal successors, (5199), 3853 states have internal predecessors, (5199), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5211 transitions. [2021-11-22 20:50:24,469 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5211 transitions. Word has length 14 [2021-11-22 20:50:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:24,470 INFO L470 AbstractCegarLoop]: Abstraction has 3864 states and 5211 transitions. [2021-11-22 20:50:24,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5211 transitions. [2021-11-22 20:50:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 20:50:24,484 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:24,484 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:24,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 20:50:24,485 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -771767355, now seen corresponding path program 1 times [2021-11-22 20:50:24,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:24,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649601655] [2021-11-22 20:50:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:24,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:24,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:24,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649601655] [2021-11-22 20:50:24,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649601655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:24,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:24,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:50:24,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126659619] [2021-11-22 20:50:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:24,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:50:24,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:50:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:50:24,723 INFO L87 Difference]: Start difference. First operand 3864 states and 5211 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:24,859 INFO L93 Difference]: Finished difference Result 7669 states and 10349 transitions. [2021-11-22 20:50:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 20:50:24,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-22 20:50:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:24,877 INFO L225 Difference]: With dead ends: 7669 [2021-11-22 20:50:24,878 INFO L226 Difference]: Without dead ends: 3864 [2021-11-22 20:50:24,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:50:24,889 INFO L933 BasicCegarLoop]: 2659 mSDtfsCounter, 1 mSDsluCounter, 5312 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7971 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:24,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 7971 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2021-11-22 20:50:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3864. [2021-11-22 20:50:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3849 states have (on average 1.350480644323201) internal successors, (5198), 3853 states have internal predecessors, (5198), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5210 transitions. [2021-11-22 20:50:25,004 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5210 transitions. Word has length 65 [2021-11-22 20:50:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:25,004 INFO L470 AbstractCegarLoop]: Abstraction has 3864 states and 5210 transitions. [2021-11-22 20:50:25,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5210 transitions. [2021-11-22 20:50:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 20:50:25,010 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:25,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:25,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 20:50:25,010 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash -998593620, now seen corresponding path program 1 times [2021-11-22 20:50:25,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:25,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234797418] [2021-11-22 20:50:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:25,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:25,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:25,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234797418] [2021-11-22 20:50:25,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234797418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:25,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:25,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:50:25,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854621260] [2021-11-22 20:50:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:25,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:50:25,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:50:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:50:25,259 INFO L87 Difference]: Start difference. First operand 3864 states and 5210 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:25,502 INFO L93 Difference]: Finished difference Result 11438 states and 15442 transitions. [2021-11-22 20:50:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:50:25,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 20:50:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:25,538 INFO L225 Difference]: With dead ends: 11438 [2021-11-22 20:50:25,538 INFO L226 Difference]: Without dead ends: 7635 [2021-11-22 20:50:25,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:50:25,550 INFO L933 BasicCegarLoop]: 5098 mSDtfsCounter, 2555 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 7740 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:25,550 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2556 Valid, 7740 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2021-11-22 20:50:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 3884. [2021-11-22 20:50:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 3869 states have (on average 1.3507366244507624) internal successors, (5226), 3873 states have internal predecessors, (5226), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5238 transitions. [2021-11-22 20:50:25,784 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5238 transitions. Word has length 69 [2021-11-22 20:50:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:25,785 INFO L470 AbstractCegarLoop]: Abstraction has 3884 states and 5238 transitions. [2021-11-22 20:50:25,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5238 transitions. [2021-11-22 20:50:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 20:50:25,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:25,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:25,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 20:50:25,789 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1492151091, now seen corresponding path program 1 times [2021-11-22 20:50:25,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:25,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7753787] [2021-11-22 20:50:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:25,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:25,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:25,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7753787] [2021-11-22 20:50:25,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7753787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:25,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:25,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:50:25,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869699141] [2021-11-22 20:50:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:25,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:50:25,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:25,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:50:25,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:50:25,995 INFO L87 Difference]: Start difference. First operand 3884 states and 5238 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:26,154 INFO L93 Difference]: Finished difference Result 7711 states and 10406 transitions. [2021-11-22 20:50:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:50:26,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-22 20:50:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:26,171 INFO L225 Difference]: With dead ends: 7711 [2021-11-22 20:50:26,172 INFO L226 Difference]: Without dead ends: 3884 [2021-11-22 20:50:26,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:50:26,185 INFO L933 BasicCegarLoop]: 2657 mSDtfsCounter, 3 mSDsluCounter, 7957 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10614 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:26,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 10614 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2021-11-22 20:50:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3884. [2021-11-22 20:50:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 3869 states have (on average 1.3504781597311968) internal successors, (5225), 3873 states have internal predecessors, (5225), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5237 transitions. [2021-11-22 20:50:26,296 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5237 transitions. Word has length 72 [2021-11-22 20:50:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:26,298 INFO L470 AbstractCegarLoop]: Abstraction has 3884 states and 5237 transitions. [2021-11-22 20:50:26,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:26,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5237 transitions. [2021-11-22 20:50:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-22 20:50:26,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:26,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:26,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 20:50:26,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:26,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1797547184, now seen corresponding path program 1 times [2021-11-22 20:50:26,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:26,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298821336] [2021-11-22 20:50:26,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:26,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:26,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298821336] [2021-11-22 20:50:26,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298821336] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:26,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:26,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:50:26,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576352987] [2021-11-22 20:50:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:26,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:50:26,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:26,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:50:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:50:26,539 INFO L87 Difference]: Start difference. First operand 3884 states and 5237 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:26,701 INFO L93 Difference]: Finished difference Result 7746 states and 10447 transitions. [2021-11-22 20:50:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:50:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-22 20:50:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:26,717 INFO L225 Difference]: With dead ends: 7746 [2021-11-22 20:50:26,717 INFO L226 Difference]: Without dead ends: 3884 [2021-11-22 20:50:26,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-22 20:50:26,726 INFO L933 BasicCegarLoop]: 2654 mSDtfsCounter, 10 mSDsluCounter, 10604 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 13258 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:26,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 13258 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2021-11-22 20:50:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3884. [2021-11-22 20:50:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 3869 states have (on average 1.350219695011631) internal successors, (5224), 3873 states have internal predecessors, (5224), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5236 transitions. [2021-11-22 20:50:26,830 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5236 transitions. Word has length 84 [2021-11-22 20:50:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:26,830 INFO L470 AbstractCegarLoop]: Abstraction has 3884 states and 5236 transitions. [2021-11-22 20:50:26,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5236 transitions. [2021-11-22 20:50:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-22 20:50:26,833 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:26,833 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:26,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 20:50:26,834 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:26,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:26,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1895987161, now seen corresponding path program 1 times [2021-11-22 20:50:26,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:26,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824937439] [2021-11-22 20:50:26,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:26,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:26,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:26,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824937439] [2021-11-22 20:50:26,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824937439] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:26,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:26,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 20:50:26,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116922051] [2021-11-22 20:50:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:26,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 20:50:26,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 20:50:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 20:50:26,977 INFO L87 Difference]: Start difference. First operand 3884 states and 5236 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:27,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:27,469 INFO L93 Difference]: Finished difference Result 19135 states and 25834 transitions. [2021-11-22 20:50:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:50:27,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-11-22 20:50:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:27,521 INFO L225 Difference]: With dead ends: 19135 [2021-11-22 20:50:27,521 INFO L226 Difference]: Without dead ends: 15306 [2021-11-22 20:50:27,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:50:27,538 INFO L933 BasicCegarLoop]: 5231 mSDtfsCounter, 10341 mSDsluCounter, 10422 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10343 SdHoareTripleChecker+Valid, 15653 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:27,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10343 Valid, 15653 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15306 states. [2021-11-22 20:50:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15306 to 3886. [2021-11-22 20:50:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3871 states have (on average 1.350038749677086) internal successors, (5226), 3875 states have internal predecessors, (5226), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5238 transitions. [2021-11-22 20:50:27,791 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5238 transitions. Word has length 86 [2021-11-22 20:50:27,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:27,791 INFO L470 AbstractCegarLoop]: Abstraction has 3886 states and 5238 transitions. [2021-11-22 20:50:27,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5238 transitions. [2021-11-22 20:50:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-22 20:50:27,794 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:27,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:27,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 20:50:27,795 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2119250742, now seen corresponding path program 1 times [2021-11-22 20:50:27,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:27,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664962144] [2021-11-22 20:50:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:27,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:28,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664962144] [2021-11-22 20:50:28,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664962144] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:28,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:28,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:50:28,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633261059] [2021-11-22 20:50:28,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:28,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:50:28,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:28,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:50:28,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:50:28,016 INFO L87 Difference]: Start difference. First operand 3886 states and 5238 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:29,490 INFO L93 Difference]: Finished difference Result 18120 states and 24584 transitions. [2021-11-22 20:50:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 20:50:29,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-22 20:50:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:29,528 INFO L225 Difference]: With dead ends: 18120 [2021-11-22 20:50:29,528 INFO L226 Difference]: Without dead ends: 14242 [2021-11-22 20:50:29,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-11-22 20:50:29,547 INFO L933 BasicCegarLoop]: 4696 mSDtfsCounter, 12117 mSDsluCounter, 14303 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12118 SdHoareTripleChecker+Valid, 18999 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:29,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12118 Valid, 18999 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-11-22 20:50:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14242 states. [2021-11-22 20:50:29,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14242 to 3886. [2021-11-22 20:50:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3871 states have (on average 1.3497804184965125) internal successors, (5225), 3875 states have internal predecessors, (5225), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5237 transitions. [2021-11-22 20:50:29,767 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5237 transitions. Word has length 87 [2021-11-22 20:50:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:29,767 INFO L470 AbstractCegarLoop]: Abstraction has 3886 states and 5237 transitions. [2021-11-22 20:50:29,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:29,768 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5237 transitions. [2021-11-22 20:50:29,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-22 20:50:29,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:29,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:29,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 20:50:29,771 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1539068809, now seen corresponding path program 1 times [2021-11-22 20:50:29,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:29,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930227787] [2021-11-22 20:50:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:29,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:30,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:30,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930227787] [2021-11-22 20:50:30,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930227787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:30,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:30,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 20:50:30,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504104161] [2021-11-22 20:50:30,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:30,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:50:30,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:50:30,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:50:30,031 INFO L87 Difference]: Start difference. First operand 3886 states and 5237 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:35,517 INFO L93 Difference]: Finished difference Result 101242 states and 139323 transitions. [2021-11-22 20:50:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-22 20:50:35,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-22 20:50:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:35,972 INFO L225 Difference]: With dead ends: 101242 [2021-11-22 20:50:35,973 INFO L226 Difference]: Without dead ends: 97376 [2021-11-22 20:50:36,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=813, Unknown=0, NotChecked=0, Total=1056 [2021-11-22 20:50:36,016 INFO L933 BasicCegarLoop]: 5476 mSDtfsCounter, 89691 mSDsluCounter, 30720 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89695 SdHoareTripleChecker+Valid, 36196 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:36,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89695 Valid, 36196 Invalid, 1440 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [342 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-22 20:50:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97376 states. [2021-11-22 20:50:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97376 to 7699. [2021-11-22 20:50:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7699 states, 7674 states have (on average 1.350403961428199) internal successors, (10363), 7678 states have internal predecessors, (10363), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-22 20:50:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7699 states to 7699 states and 10387 transitions. [2021-11-22 20:50:37,099 INFO L78 Accepts]: Start accepts. Automaton has 7699 states and 10387 transitions. Word has length 90 [2021-11-22 20:50:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:37,099 INFO L470 AbstractCegarLoop]: Abstraction has 7699 states and 10387 transitions. [2021-11-22 20:50:37,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 7699 states and 10387 transitions. [2021-11-22 20:50:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-22 20:50:37,108 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:37,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:37,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 20:50:37,109 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1259437769, now seen corresponding path program 1 times [2021-11-22 20:50:37,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:37,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778524280] [2021-11-22 20:50:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:37,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:37,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:37,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778524280] [2021-11-22 20:50:37,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778524280] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:37,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:37,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:50:37,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262293884] [2021-11-22 20:50:37,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:37,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:50:37,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:37,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:50:37,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:50:37,562 INFO L87 Difference]: Start difference. First operand 7699 states and 10387 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:38,098 INFO L93 Difference]: Finished difference Result 11511 states and 15527 transitions. [2021-11-22 20:50:38,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:50:38,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-22 20:50:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:38,117 INFO L225 Difference]: With dead ends: 11511 [2021-11-22 20:50:38,117 INFO L226 Difference]: Without dead ends: 7682 [2021-11-22 20:50:38,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:50:38,131 INFO L933 BasicCegarLoop]: 2653 mSDtfsCounter, 13 mSDsluCounter, 7933 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 10586 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:38,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 10586 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:38,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7682 states. [2021-11-22 20:50:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7682 to 7682. [2021-11-22 20:50:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7682 states, 7657 states have (on average 1.3503983283270211) internal successors, (10340), 7661 states have internal predecessors, (10340), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-22 20:50:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7682 states to 7682 states and 10364 transitions. [2021-11-22 20:50:38,719 INFO L78 Accepts]: Start accepts. Automaton has 7682 states and 10364 transitions. Word has length 93 [2021-11-22 20:50:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:38,719 INFO L470 AbstractCegarLoop]: Abstraction has 7682 states and 10364 transitions. [2021-11-22 20:50:38,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7682 states and 10364 transitions. [2021-11-22 20:50:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 20:50:38,724 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:38,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:38,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-22 20:50:38,725 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:38,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1142154049, now seen corresponding path program 1 times [2021-11-22 20:50:38,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:38,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656961208] [2021-11-22 20:50:38,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:38,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:38,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:38,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656961208] [2021-11-22 20:50:38,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656961208] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:38,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:38,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 20:50:38,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624771292] [2021-11-22 20:50:38,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:38,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 20:50:38,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:38,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 20:50:38,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:50:38,915 INFO L87 Difference]: Start difference. First operand 7682 states and 10364 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:39,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:39,584 INFO L93 Difference]: Finished difference Result 11518 states and 15537 transitions. [2021-11-22 20:50:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 20:50:39,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 20:50:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:39,602 INFO L225 Difference]: With dead ends: 11518 [2021-11-22 20:50:39,602 INFO L226 Difference]: Without dead ends: 7695 [2021-11-22 20:50:39,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 20:50:39,614 INFO L933 BasicCegarLoop]: 2795 mSDtfsCounter, 2537 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 5407 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:39,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2537 Valid, 5407 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:50:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7695 states. [2021-11-22 20:50:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7695 to 7682. [2021-11-22 20:50:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7682 states, 7657 states have (on average 1.3492229332636803) internal successors, (10331), 7661 states have internal predecessors, (10331), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-22 20:50:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7682 states to 7682 states and 10355 transitions. [2021-11-22 20:50:40,102 INFO L78 Accepts]: Start accepts. Automaton has 7682 states and 10355 transitions. Word has length 99 [2021-11-22 20:50:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:40,103 INFO L470 AbstractCegarLoop]: Abstraction has 7682 states and 10355 transitions. [2021-11-22 20:50:40,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7682 states and 10355 transitions. [2021-11-22 20:50:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 20:50:40,111 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:40,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:40,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 20:50:40,112 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash -502359136, now seen corresponding path program 1 times [2021-11-22 20:50:40,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:40,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177767412] [2021-11-22 20:50:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:40,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:40,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:40,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:40,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177767412] [2021-11-22 20:50:40,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177767412] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:40,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:40,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 20:50:40,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114624518] [2021-11-22 20:50:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:40,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 20:50:40,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 20:50:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 20:50:40,504 INFO L87 Difference]: Start difference. First operand 7682 states and 10355 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:40,768 INFO L93 Difference]: Finished difference Result 7703 states and 10371 transitions. [2021-11-22 20:50:40,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 20:50:40,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-22 20:50:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:40,776 INFO L225 Difference]: With dead ends: 7703 [2021-11-22 20:50:40,776 INFO L226 Difference]: Without dead ends: 3871 [2021-11-22 20:50:40,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:50:40,785 INFO L933 BasicCegarLoop]: 2633 mSDtfsCounter, 3 mSDsluCounter, 7884 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10517 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:40,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 10517 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 20:50:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2021-11-22 20:50:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3871. [2021-11-22 20:50:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3871 states, 3856 states have (on average 1.3472510373443984) internal successors, (5195), 3860 states have internal predecessors, (5195), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 5207 transitions. [2021-11-22 20:50:41,005 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 5207 transitions. Word has length 100 [2021-11-22 20:50:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:41,006 INFO L470 AbstractCegarLoop]: Abstraction has 3871 states and 5207 transitions. [2021-11-22 20:50:41,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 5207 transitions. [2021-11-22 20:50:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 20:50:41,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:41,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:41,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 20:50:41,009 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:41,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -437713273, now seen corresponding path program 1 times [2021-11-22 20:50:41,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:41,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494051511] [2021-11-22 20:50:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:41,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:41,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:41,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494051511] [2021-11-22 20:50:41,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494051511] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:41,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:41,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 20:50:41,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877155781] [2021-11-22 20:50:41,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:41,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 20:50:41,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:41,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 20:50:41,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 20:50:41,347 INFO L87 Difference]: Start difference. First operand 3871 states and 5207 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:50:44,500 INFO L93 Difference]: Finished difference Result 38538 states and 52438 transitions. [2021-11-22 20:50:44,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 20:50:44,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-22 20:50:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:50:44,557 INFO L225 Difference]: With dead ends: 38538 [2021-11-22 20:50:44,558 INFO L226 Difference]: Without dead ends: 34704 [2021-11-22 20:50:44,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-22 20:50:44,582 INFO L933 BasicCegarLoop]: 2605 mSDtfsCounter, 30750 mSDsluCounter, 17553 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30753 SdHoareTripleChecker+Valid, 20158 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-11-22 20:50:44,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30753 Valid, 20158 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-11-22 20:50:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34704 states. [2021-11-22 20:50:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34704 to 3875. [2021-11-22 20:50:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 3860 states have (on average 1.3468911917098445) internal successors, (5199), 3864 states have internal predecessors, (5199), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 20:50:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 5211 transitions. [2021-11-22 20:50:45,056 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 5211 transitions. Word has length 100 [2021-11-22 20:50:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:50:45,057 INFO L470 AbstractCegarLoop]: Abstraction has 3875 states and 5211 transitions. [2021-11-22 20:50:45,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:50:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 5211 transitions. [2021-11-22 20:50:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 20:50:45,059 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:50:45,060 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:50:45,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 20:50:45,060 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:50:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:50:45,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1653866999, now seen corresponding path program 1 times [2021-11-22 20:50:45,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:50:45,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125896510] [2021-11-22 20:50:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:50:45,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:50:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:50:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:50:47,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:50:47,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125896510] [2021-11-22 20:50:47,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125896510] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 20:50:47,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 20:50:47,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-22 20:50:47,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155867783] [2021-11-22 20:50:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 20:50:47,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-22 20:50:47,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:50:47,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-22 20:50:47,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-11-22 20:50:47,146 INFO L87 Difference]: Start difference. First operand 3875 states and 5211 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:51:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:51:11,113 INFO L93 Difference]: Finished difference Result 8191 states and 11029 transitions. [2021-11-22 20:51:11,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-22 20:51:11,114 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-22 20:51:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:51:11,121 INFO L225 Difference]: With dead ends: 8191 [2021-11-22 20:51:11,122 INFO L226 Difference]: Without dead ends: 4368 [2021-11-22 20:51:11,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2021-11-22 20:51:11,136 INFO L933 BasicCegarLoop]: 2528 mSDtfsCounter, 1513 mSDsluCounter, 23190 mSDsCounter, 0 mSdLazyCounter, 9698 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 25718 SdHoareTripleChecker+Invalid, 9844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 9698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2021-11-22 20:51:11,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 25718 Invalid, 9844 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [146 Valid, 9698 Invalid, 0 Unknown, 0 Unchecked, 22.5s Time] [2021-11-22 20:51:11,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2021-11-22 20:51:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 4022. [2021-11-22 20:51:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4002 states have (on average 1.3500749625187407) internal successors, (5403), 4006 states have internal predecessors, (5403), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-22 20:51:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 5421 transitions. [2021-11-22 20:51:11,530 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 5421 transitions. Word has length 100 [2021-11-22 20:51:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:51:11,530 INFO L470 AbstractCegarLoop]: Abstraction has 4022 states and 5421 transitions. [2021-11-22 20:51:11,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:51:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 5421 transitions. [2021-11-22 20:51:11,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-22 20:51:11,537 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:51:11,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:51:11,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 20:51:11,538 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:51:11,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:51:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1020627516, now seen corresponding path program 1 times [2021-11-22 20:51:11,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:51:11,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670185864] [2021-11-22 20:51:11,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:51:11,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:51:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:51:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:51:11,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:51:11,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670185864] [2021-11-22 20:51:11,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670185864] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:51:11,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961612133] [2021-11-22 20:51:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:51:11,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:51:11,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:51:11,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:51:11,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 20:51:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:51:12,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 3092 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 20:51:12,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:51:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:51:12,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:51:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:51:12,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961612133] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:51:12,728 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:51:12,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-22 20:51:12,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15070029] [2021-11-22 20:51:12,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:51:12,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 20:51:12,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:51:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 20:51:12,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:51:12,730 INFO L87 Difference]: Start difference. First operand 4022 states and 5421 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:51:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:51:13,965 INFO L93 Difference]: Finished difference Result 22893 states and 30864 transitions. [2021-11-22 20:51:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 20:51:13,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-22 20:51:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:51:13,995 INFO L225 Difference]: With dead ends: 22893 [2021-11-22 20:51:13,995 INFO L226 Difference]: Without dead ends: 19070 [2021-11-22 20:51:14,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-22 20:51:14,008 INFO L933 BasicCegarLoop]: 7589 mSDtfsCounter, 12803 mSDsluCounter, 15292 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12807 SdHoareTripleChecker+Valid, 22881 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:51:14,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12807 Valid, 22881 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 20:51:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19070 states. [2021-11-22 20:51:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19070 to 4070. [2021-11-22 20:51:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4070 states, 4050 states have (on average 1.3498765432098765) internal successors, (5467), 4054 states have internal predecessors, (5467), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2021-11-22 20:51:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4070 states to 4070 states and 5485 transitions. [2021-11-22 20:51:14,535 INFO L78 Accepts]: Start accepts. Automaton has 4070 states and 5485 transitions. Word has length 101 [2021-11-22 20:51:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:51:14,535 INFO L470 AbstractCegarLoop]: Abstraction has 4070 states and 5485 transitions. [2021-11-22 20:51:14,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:51:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 4070 states and 5485 transitions. [2021-11-22 20:51:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-22 20:51:14,538 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:51:14,538 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:51:14,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-22 20:51:14,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-22 20:51:14,757 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:51:14,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:51:14,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1781518267, now seen corresponding path program 1 times [2021-11-22 20:51:14,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:51:14,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567005486] [2021-11-22 20:51:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:51:14,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:51:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:51:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:51:16,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:51:16,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567005486] [2021-11-22 20:51:16,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567005486] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:51:16,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011876357] [2021-11-22 20:51:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:51:16,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:51:16,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:51:16,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:51:16,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 20:51:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:51:17,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 3101 conjuncts, 73 conjunts are in the unsatisfiable core [2021-11-22 20:51:17,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:51:17,072 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:51:17,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-11-22 20:51:17,085 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:51:17,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-22 20:51:17,169 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:51:17,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:51:17,265 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:51:17,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:51:17,652 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:51:17,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-11-22 20:51:17,788 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:51:17,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 41 [2021-11-22 20:51:18,592 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:51:18,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2021-11-22 20:51:18,615 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:51:18,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 51 [2021-11-22 20:51:18,734 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-22 20:51:18,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2021-11-22 20:51:19,109 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-22 20:51:19,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 34 [2021-11-22 20:51:19,426 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:51:19,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 46 [2021-11-22 20:51:19,439 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:51:19,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2021-11-22 20:51:19,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-22 20:51:19,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-22 20:51:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:51:19,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:51:20,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:20,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int)) (or (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)))) is different from false [2021-11-22 20:51:21,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int)) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:21,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| c_~class_pktcdvd~0.base v_ArrVal_695) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| c_~class_pktcdvd~0.base v_ArrVal_694) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:21,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_695) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_694) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:21,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (or (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_694) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_695) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:21,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_694) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_695) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:21,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (or (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_695) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_694) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:21,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_695 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_695) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_694) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:51:26,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:51:26,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011876357] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:51:26,726 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:51:26,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 19] total 51 [2021-11-22 20:51:26,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976607773] [2021-11-22 20:51:26,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:51:26,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-11-22 20:51:26,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:51:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-11-22 20:51:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1540, Unknown=26, NotChecked=810, Total=2652 [2021-11-22 20:51:26,729 INFO L87 Difference]: Start difference. First operand 4070 states and 5485 transitions. Second operand has 52 states, 52 states have (on average 5.038461538461538) internal successors, (262), 51 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:51:27,673 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| 162) 1)) (.cse2 (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| 162))) (.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (and (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_697 Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int)) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|))) (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) .cse1 (= |c_~#pkt_devs~0.base| 162) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (or (<= 163 |c_#StackHeapBarrier|) (and .cse1 .cse2)) (= 0 |c_~#pkt_devs~0.offset|) (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |ULTIMATE.start_ldv_malloc_~p~5#1.base|)) (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (not (= |ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)))) .cse2 (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse3) 0))) is different from false [2021-11-22 20:51:27,679 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| 162) 1)) (.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) .cse0 (= |c_~#pkt_devs~0.base| 162) (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (not (= |ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)))) (forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| Int) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_697 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| Int)) (or (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_700) |c_~#pkt_devs~0.base|) .cse1) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| v_ArrVal_699) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37| |c_#StackHeapBarrier|) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_697) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_51| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_37|) 0)))) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (or (<= 163 |c_#StackHeapBarrier|) .cse0) (= 0 |c_~#pkt_devs~0.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse2) 0) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse2) 0))) is different from false [2021-11-22 20:52:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:52:18,983 INFO L93 Difference]: Finished difference Result 16240 states and 21846 transitions. [2021-11-22 20:52:18,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-22 20:52:18,984 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.038461538461538) internal successors, (262), 51 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-11-22 20:52:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:52:19,010 INFO L225 Difference]: With dead ends: 16240 [2021-11-22 20:52:19,011 INFO L226 Difference]: Without dead ends: 12369 [2021-11-22 20:52:19,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1204, Invalid=7002, Unknown=28, NotChecked=2068, Total=10302 [2021-11-22 20:52:19,023 INFO L933 BasicCegarLoop]: 6301 mSDtfsCounter, 7782 mSDsluCounter, 105905 mSDsCounter, 0 mSdLazyCounter, 21461 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7785 SdHoareTripleChecker+Valid, 112206 SdHoareTripleChecker+Invalid, 76011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 21461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54181 IncrementalHoareTripleChecker+Unchecked, 46.9s IncrementalHoareTripleChecker+Time [2021-11-22 20:52:19,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7785 Valid, 112206 Invalid, 76011 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [369 Valid, 21461 Invalid, 0 Unknown, 54181 Unchecked, 46.9s Time] [2021-11-22 20:52:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12369 states. [2021-11-22 20:52:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12369 to 4520. [2021-11-22 20:52:19,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4520 states, 4490 states have (on average 1.353674832962138) internal successors, (6078), 4494 states have internal predecessors, (6078), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-11-22 20:52:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 6108 transitions. [2021-11-22 20:52:19,632 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 6108 transitions. Word has length 104 [2021-11-22 20:52:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:52:19,633 INFO L470 AbstractCegarLoop]: Abstraction has 4520 states and 6108 transitions. [2021-11-22 20:52:19,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.038461538461538) internal successors, (262), 51 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:52:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 6108 transitions. [2021-11-22 20:52:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 20:52:19,637 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:52:19,637 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:52:19,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-22 20:52:19,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-22 20:52:19,838 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:52:19,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:52:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1165905900, now seen corresponding path program 1 times [2021-11-22 20:52:19,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:52:19,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190010865] [2021-11-22 20:52:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:52:19,839 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:52:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:52:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:52:21,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:52:21,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190010865] [2021-11-22 20:52:21,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190010865] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:52:21,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207886222] [2021-11-22 20:52:21,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:52:21,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:52:21,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:52:21,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:52:21,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 20:52:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:52:21,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 3135 conjuncts, 77 conjunts are in the unsatisfiable core [2021-11-22 20:52:21,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:52:21,989 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:52:21,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-11-22 20:52:22,001 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:52:22,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-22 20:52:22,074 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:52:22,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:52:22,197 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-11-22 20:52:22,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 32 [2021-11-22 20:52:22,782 INFO L354 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2021-11-22 20:52:22,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2021-11-22 20:52:22,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 20:52:22,973 INFO L354 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2021-11-22 20:52:22,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 52 [2021-11-22 20:52:24,362 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:52:24,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2021-11-22 20:52:24,378 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:52:24,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2021-11-22 20:52:24,613 INFO L354 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2021-11-22 20:52:24,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 49 [2021-11-22 20:52:25,232 INFO L354 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2021-11-22 20:52:25,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2021-11-22 20:52:25,560 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-11-22 20:52:25,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 39 [2021-11-22 20:52:26,201 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:52:26,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2021-11-22 20:52:26,221 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:52:26,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2021-11-22 20:52:26,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-22 20:52:26,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-22 20:52:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:52:26,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:52:27,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int))) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (= 0 (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)))) is different from false [2021-11-22 20:52:27,689 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (= 0 (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616)))) is different from false [2021-11-22 20:52:29,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0)) (= 0 (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616))))) is different from false [2021-11-22 20:52:29,383 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| c_~class_pktcdvd~0.base v_ArrVal_810) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| c_~class_pktcdvd~0.base v_ArrVal_811) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (not (= (select (store (store (store .cse1 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (not (= (select .cse1 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0))))) is different from false [2021-11-22 20:52:29,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0)) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_810) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_811) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0)))) is different from false [2021-11-22 20:52:29,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_811) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_810) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0))))) is different from false [2021-11-22 20:52:29,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_810) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_811) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0))))) is different from false [2021-11-22 20:52:29,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0)) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_810) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_811) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0)))) is different from false [2021-11-22 20:52:29,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_810) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_811) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0))))) is different from false [2021-11-22 20:52:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:52:43,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207886222] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:52:43,152 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:52:43,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 49 [2021-11-22 20:52:43,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157761981] [2021-11-22 20:52:43,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:52:43,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-22 20:52:43,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:52:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-22 20:52:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1413, Unknown=28, NotChecked=774, Total=2450 [2021-11-22 20:52:43,154 INFO L87 Difference]: Start difference. First operand 4520 states and 6108 transitions. Second operand has 50 states, 50 states have (on average 5.42) internal successors, (271), 49 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:52:45,002 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (= (select |c_#valid| 162) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) (= |c_~#pkt_devs~0.base| 162) (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|)) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |ULTIMATE.start_ldv_malloc_~p~5#1.base|)) (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (not (= |ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)) (< |ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_#StackHeapBarrier|))) (= 0 |c_~#pkt_devs~0.offset|) (= (select |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) 1) (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| 162)) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| Int) (v_ArrVal_813 Int) (v_ArrVal_812 Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_812))) (or (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196| v_ArrVal_813) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_196|) 0)) (= 0 (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616))))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse2) 0) (not (= .cse2 0)) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse2) 0))) is different from false [2021-11-22 20:52:45,124 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (and (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (not (= |ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)) (< |ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_#StackHeapBarrier|))) (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (= (select |c_#valid| 162) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) (= |c_~#pkt_devs~0.base| 162) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (= 0 |c_~#pkt_devs~0.offset|) (= (select |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse0) 0) (not (= .cse0 0)) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| Int) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (v_ArrVal_814 Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_814) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_52| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| |c_#StackHeapBarrier|) (= 0 (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_816) |c_~#pkt_devs~0.base|) .cse1) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_38| v_ArrVal_815) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616)))) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse0) 0))) is different from false [2021-11-22 20:53:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:53:04,116 INFO L93 Difference]: Finished difference Result 10888 states and 14876 transitions. [2021-11-22 20:53:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-22 20:53:04,118 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.42) internal successors, (271), 49 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-22 20:53:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:53:04,134 INFO L225 Difference]: With dead ends: 10888 [2021-11-22 20:53:04,134 INFO L226 Difference]: Without dead ends: 7017 [2021-11-22 20:53:04,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 191 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 2 DeprecatedPredicates, 1469 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=807, Invalid=5366, Unknown=33, NotChecked=1804, Total=8010 [2021-11-22 20:53:04,143 INFO L933 BasicCegarLoop]: 3132 mSDtfsCounter, 2730 mSDsluCounter, 51892 mSDsCounter, 0 mSdLazyCounter, 6142 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2732 SdHoareTripleChecker+Valid, 55024 SdHoareTripleChecker+Invalid, 28924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 6142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22602 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2021-11-22 20:53:04,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2732 Valid, 55024 Invalid, 28924 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [180 Valid, 6142 Invalid, 0 Unknown, 22602 Unchecked, 16.4s Time] [2021-11-22 20:53:04,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2021-11-22 20:53:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 4709. [2021-11-22 20:53:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4709 states, 4674 states have (on average 1.3585793752674369) internal successors, (6350), 4678 states have internal predecessors, (6350), 18 states have call successors, (18), 12 states have call predecessors, (18), 12 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2021-11-22 20:53:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 6386 transitions. [2021-11-22 20:53:04,694 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 6386 transitions. Word has length 107 [2021-11-22 20:53:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:53:04,694 INFO L470 AbstractCegarLoop]: Abstraction has 4709 states and 6386 transitions. [2021-11-22 20:53:04,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.42) internal successors, (271), 49 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:53:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 6386 transitions. [2021-11-22 20:53:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 20:53:04,699 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:53:04,700 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:53:04,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-22 20:53:04,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:53:04,928 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:53:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:53:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1477830688, now seen corresponding path program 1 times [2021-11-22 20:53:04,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:53:04,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26013394] [2021-11-22 20:53:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:53:04,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:53:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:53:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:53:06,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:53:06,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26013394] [2021-11-22 20:53:06,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26013394] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:53:06,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300112453] [2021-11-22 20:53:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:53:06,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:53:06,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:53:06,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:53:06,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 20:53:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:53:07,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 3138 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-22 20:53:07,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:53:07,088 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:53:07,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2021-11-22 20:53:07,100 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:53:07,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-11-22 20:53:07,171 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:53:07,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2021-11-22 20:53:07,263 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-11-22 20:53:07,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2021-11-22 20:53:07,441 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-11-22 20:53:07,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2021-11-22 20:53:07,488 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 20:53:07,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-11-22 20:53:07,911 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:53:07,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2021-11-22 20:53:07,922 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:53:07,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-11-22 20:53:08,491 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-22 20:53:08,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-11-22 20:53:08,519 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-22 20:53:08,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2021-11-22 20:53:09,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-22 20:53:09,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-22 20:53:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:53:09,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:53:24,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929)) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931)) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2021-11-22 20:53:25,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_~class_pktcdvd~0.base v_ArrVal_926))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_~class_pktcdvd~0.base v_ArrVal_927))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0))) is different from false [2021-11-22 20:53:25,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0))) is different from false [2021-11-22 20:53:25,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0))) is different from false [2021-11-22 20:53:25,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_926))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_927))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|))) is different from false [2021-11-22 20:53:25,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|))) is different from false [2021-11-22 20:53:25,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|))) is different from false [2021-11-22 20:53:26,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (|v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_17| Int) (|v_ULTIMATE.start_IS_ERR_~ptr#1.base_164| Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_925 Int) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (not (= (select (store |c_#valid| |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_17| v_ArrVal_925) |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164|) 0)) (= 0 (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616)) (<= |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_17| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164|))) is different from false [2021-11-22 20:53:30,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_init_~#__key~3#1.base_16| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (|v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_17| Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_208| Int) (v_ArrVal_925 Int) (v_ArrVal_924 Int) (v_ArrVal_923 Int) (v_ArrVal_931 Int) (|v_ULTIMATE.start_IS_ERR_~ptr#1.base_164| Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_pkt_init_~#__key~3#1.base_16| v_ArrVal_923)) (.cse0 (+ |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164| 1))) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| .cse0) (not (= (select .cse1 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_208|) 0)) (not (= (select (store (store .cse1 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_208| v_ArrVal_924) |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_17| v_ArrVal_925) |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164|) 0)) (= 0 (mod (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164| v_ArrVal_927))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse3) (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_164| v_ArrVal_926))) (store .cse4 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse3))) 18446744073709551616)) (<= |v_ULTIMATE.start_pkt_init_~#__key~3#1.base_16| .cse0) (<= |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_17| .cse0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|)))) is different from false [2021-11-22 20:53:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:53:30,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300112453] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:53:30,632 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:53:30,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 18] total 46 [2021-11-22 20:53:30,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169643262] [2021-11-22 20:53:30,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:53:30,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-22 20:53:30,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:53:30,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-22 20:53:30,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1260, Unknown=17, NotChecked=720, Total=2162 [2021-11-22 20:53:30,635 INFO L87 Difference]: Start difference. First operand 4709 states and 6386 transitions. Second operand has 47 states, 47 states have (on average 5.914893617021277) internal successors, (278), 46 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:53:31,787 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= (select |c_#valid| 162) 1)) (.cse8 (= |c_~#pkt_devs~0.base| 162))) (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (and .cse7 .cse8)) (.cse3 (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (.cse9 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (<= .cse0 |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base|)) (<= .cse0 |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base|) (or (let ((.cse2 (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| 162))) (and (or .cse1 .cse2) (or (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |c_~#pkt_devs~0.base|) (not .cse2)))) .cse3) (or .cse1 .cse3) (not (= |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|)) (or (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| |c_~#pkt_devs~0.base|) (not .cse3)) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (= (mod (let ((.cse5 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_927))) (store .cse4 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse4 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse5) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_926))) (store .cse6 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse6 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse5))) 18446744073709551616) 0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|))) .cse7 (not (= c_~class_pktcdvd~0.base 162)) .cse8 (= c_~pkt_debugfs_root~0.offset 0) (= 0 |c_~#pkt_devs~0.offset|) (= c_~pkt_debugfs_root~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse9) 0) (not (= .cse9 0)) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse9) 0) (not (= |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)) (< c_~class_pktcdvd~0.base |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_#StackHeapBarrier|)))) is different from false [2021-11-22 20:53:31,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base|)) (not (= |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|)) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|))) (= |c_~#pkt_devs~0.base| 162) (= 0 |c_~#pkt_devs~0.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse3) 0) (not (= |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)) (< |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:53:31,809 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (< |c_ULTIMATE.start_ldv_malloc_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_ldv_malloc_#res#1.base| 162)) (= |c_~#pkt_devs~0.base| 162) (not (= |c_ULTIMATE.start_ldv_malloc_#res#1.base| |c_~#pkt_devs~0.base|)) (= 0 |c_~#pkt_devs~0.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse0) 0) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (= (mod (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_927))) (store .cse1 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse1 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse2) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_926))) (store .cse3 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse3 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse2))) 18446744073709551616) 0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|))) (not (= .cse0 0)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse0) 0))) is different from false [2021-11-22 20:53:31,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_ULTIMATE.start___kmalloc_#res#1.base| 162)) (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_926))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_927))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|))) (not (= |c_~#pkt_devs~0.base| |c_ULTIMATE.start___kmalloc_#res#1.base|)) (= |c_~#pkt_devs~0.base| 162) (< |c_ULTIMATE.start___kmalloc_#res#1.base| |c_#StackHeapBarrier|) (= 0 |c_~#pkt_devs~0.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse3) 0))) is different from false [2021-11-22 20:53:31,829 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_ULTIMATE.start_kmalloc_#res#1.base| 162)) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0))) (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (< |c_ULTIMATE.start_kmalloc_#res#1.base| |c_#StackHeapBarrier|) (not (= |c_~#pkt_devs~0.base| |c_ULTIMATE.start_kmalloc_#res#1.base|)) (= |c_~#pkt_devs~0.base| 162) (= 0 |c_~#pkt_devs~0.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse3) 0))) is different from false [2021-11-22 20:53:31,839 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (= |c_~#pkt_devs~0.base| 162) (< |c_ULTIMATE.start_kzalloc_#res#1.base| |c_#StackHeapBarrier|) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_927))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_926))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0))) (not (= |c_~#pkt_devs~0.base| |c_ULTIMATE.start_kzalloc_#res#1.base|)) (= 0 |c_~#pkt_devs~0.offset|) (not (= |c_ULTIMATE.start_kzalloc_#res#1.base| 162)) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0) (not (= .cse3 0)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse3) 0))) is different from false [2021-11-22 20:53:31,851 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (not (= c_~class_pktcdvd~0.base 162)) (= |c_~#pkt_devs~0.base| 162) (= 0 |c_~#pkt_devs~0.offset|) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (v_ArrVal_926 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_~class_pktcdvd~0.base v_ArrVal_926))) (store .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929))) |c_~#pkt_devs~0.base|) .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_~class_pktcdvd~0.base v_ArrVal_927))) (store .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select .cse2 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931))) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0) (not (= .cse3 0)) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse3) 0) (< c_~class_pktcdvd~0.base |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:53:33,858 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| Int) (v_ArrVal_929 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| Int) (v_ArrVal_931 Int)) (or (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| |c_#StackHeapBarrier|) (< 0 |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39|) (= (mod (let ((.cse0 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_929)) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_39|) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.offset_39| v_ArrVal_931)) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) (= |c_~#pkt_devs~0.base| 162) (= 0 |c_~#pkt_devs~0.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse1) 0) (not (= .cse1 0)) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|) .cse1) 0))) is different from false [2021-11-22 20:54:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:54:59,887 INFO L93 Difference]: Finished difference Result 21034 states and 28461 transitions. [2021-11-22 20:54:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-11-22 20:54:59,888 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.914893617021277) internal successors, (278), 46 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-22 20:54:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:54:59,918 INFO L225 Difference]: With dead ends: 21034 [2021-11-22 20:54:59,918 INFO L226 Difference]: Without dead ends: 16868 [2021-11-22 20:54:59,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=887, Invalid=5161, Unknown=26, NotChecked=2856, Total=8930 [2021-11-22 20:54:59,931 INFO L933 BasicCegarLoop]: 9159 mSDtfsCounter, 17263 mSDsluCounter, 125303 mSDsCounter, 0 mSdLazyCounter, 26053 mSolverCounterSat, 415 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17265 SdHoareTripleChecker+Valid, 134462 SdHoareTripleChecker+Invalid, 96592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 415 IncrementalHoareTripleChecker+Valid, 26053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70124 IncrementalHoareTripleChecker+Unchecked, 78.1s IncrementalHoareTripleChecker+Time [2021-11-22 20:54:59,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17265 Valid, 134462 Invalid, 96592 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [415 Valid, 26053 Invalid, 0 Unknown, 70124 Unchecked, 78.1s Time] [2021-11-22 20:54:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2021-11-22 20:55:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 9289. [2021-11-22 20:55:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9289 states, 9224 states have (on average 1.3580875975715525) internal successors, (12527), 9228 states have internal predecessors, (12527), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-11-22 20:55:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9289 states to 9289 states and 12599 transitions. [2021-11-22 20:55:00,892 INFO L78 Accepts]: Start accepts. Automaton has 9289 states and 12599 transitions. Word has length 107 [2021-11-22 20:55:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:55:00,893 INFO L470 AbstractCegarLoop]: Abstraction has 9289 states and 12599 transitions. [2021-11-22 20:55:00,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.914893617021277) internal successors, (278), 46 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:55:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 9289 states and 12599 transitions. [2021-11-22 20:55:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-22 20:55:00,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:55:00,899 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:55:00,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-22 20:55:01,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-22 20:55:01,111 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:55:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:55:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1849785954, now seen corresponding path program 1 times [2021-11-22 20:55:01,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:55:01,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396772761] [2021-11-22 20:55:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:55:01,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:55:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:55:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:55:02,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:55:02,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396772761] [2021-11-22 20:55:02,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396772761] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:55:02,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074889543] [2021-11-22 20:55:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:55:02,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:55:02,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:55:02,881 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:55:02,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 20:55:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:55:03,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 3135 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-22 20:55:03,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:55:03,919 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:55:03,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2021-11-22 20:55:03,930 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:55:03,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-11-22 20:55:04,026 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:55:04,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:55:04,144 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:55:04,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:55:04,825 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:55:04,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-11-22 20:55:05,055 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:55:05,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 41 [2021-11-22 20:55:06,670 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:55:06,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 69 [2021-11-22 20:55:06,699 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:55:06,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 63 [2021-11-22 20:55:06,973 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-22 20:55:06,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2021-11-22 20:55:07,215 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:55:07,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 37 [2021-11-22 20:55:08,177 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-11-22 20:55:08,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 37 [2021-11-22 20:55:08,661 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:55:08,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 58 [2021-11-22 20:55:08,674 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:55:08,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2021-11-22 20:55:09,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-22 20:55:09,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-22 20:55:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:55:09,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:55:10,728 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|))) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0)) (< 0 (mod (+ (select .cse0 |c_~#pkt_devs~0.offset|) (select .cse1 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (= (mod (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse2) (select .cse0 .cse2))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|)))) is different from false [2021-11-22 20:55:12,303 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|))) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0)) (< 0 (mod (+ (select .cse0 |c_~#pkt_devs~0.offset|) (select .cse1 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (= (mod (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse2) (select .cse0 .cse2))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|)))) is different from false [2021-11-22 20:55:14,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int)) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse3 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (< 0 (mod (+ (select .cse0 |c_~#pkt_devs~0.offset|) (select .cse1 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (= (mod (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse2) (select .cse0 .cse2))) 18446744073709551616) 0) (not (= (select .cse3 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (not (= (select (store (store (store .cse3 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) is different from false [2021-11-22 20:55:15,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int)) (let ((.cse3 (select (store (store |c_#memory_$Pointer$.base| c_~class_pktcdvd~0.base v_ArrVal_1041) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse1 (select (store (store |c_#memory_$Pointer$.offset| c_~class_pktcdvd~0.base v_ArrVal_1040) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (= (mod (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse2) (select .cse3 .cse2))) 18446744073709551616) 0) (< 0 (mod (+ (select .cse3 |c_~#pkt_devs~0.offset|) (select .cse1 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) is different from false [2021-11-22 20:55:15,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int) (v_ArrVal_1040 (Array Int Int)) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int)) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_1041) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse2 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_1040) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse3 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (= (mod (let ((.cse1 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse0 .cse1) (select .cse2 .cse1))) 18446744073709551616) 0) (not (= (select .cse3 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (< 0 (mod (+ (select .cse0 |c_~#pkt_devs~0.offset|) (select .cse2 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= (select (store (store (store .cse3 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) is different from false [2021-11-22 20:55:15,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_1040) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse3 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_1041) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (= (mod (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse2) (select .cse3 .cse2))) 18446744073709551616) 0) (< 0 (mod (+ (select .cse1 |c_~#pkt_devs~0.offset|) (select .cse3 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) is different from false [2021-11-22 20:55:15,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int)) (let ((.cse3 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_1041) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse1 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_1040) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (not (= (select .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (= (mod (let ((.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse2) (select .cse3 .cse2))) 18446744073709551616) 0) (< 0 (mod (+ (select .cse3 |c_~#pkt_devs~0.offset|) (select .cse1 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= (select (store (store (store .cse0 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) is different from false [2021-11-22 20:55:16,195 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (v_ArrVal_1040 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_1041) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_1040) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (< 0 (mod (+ (select .cse0 |c_~#pkt_devs~0.offset|) (select .cse1 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= (select .cse2 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (= 0 (mod (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse3) (select .cse0 .cse3))) 18446744073709551616)) (not (= (select (store (store (store .cse2 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) is different from false [2021-11-22 20:55:16,466 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int) (v_ArrVal_1040 (Array Int Int)) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int)) (let ((.cse1 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_1040) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse0 (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_1041) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (< 0 (mod (+ (select .cse0 |c_~#pkt_devs~0.offset|) (select .cse1 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (not (= (select .cse2 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (= (mod (let ((.cse3 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse1 .cse3) (select .cse0 .cse3))) 18446744073709551616) 0) (not (= (select (store (store (store .cse2 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) is different from false [2021-11-22 20:55:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:55:40,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074889543] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:55:40,102 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:55:40,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 21] total 52 [2021-11-22 20:55:40,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804295562] [2021-11-22 20:55:40,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:55:40,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-11-22 20:55:40,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:55:40,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-11-22 20:55:40,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1638, Unknown=30, NotChecked=828, Total=2756 [2021-11-22 20:55:40,105 INFO L87 Difference]: Start difference. First operand 9289 states and 12599 transitions. Second operand has 53 states, 53 states have (on average 5.113207547169812) internal successors, (271), 52 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:55:42,326 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|)) (.cse6 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (= (select .cse0 |c_~#pkt_devs~0.offset|) 0) (= (select .cse1 |c_~#pkt_devs~0.offset|) 0) (forall ((v_ArrVal_1042 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1043 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int)) (let ((.cse3 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse2 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|)) (.cse5 (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1042))) (or (< 0 (mod (+ (select .cse2 |c_~#pkt_devs~0.offset|) (select .cse3 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (= (mod (let ((.cse4 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse3 .cse4) (select .cse2 .cse4))) 18446744073709551616) 0) (not (= (select .cse5 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|) (not (= (select (store (store (store .cse5 |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_213| v_ArrVal_1043) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0))))) (= (select |c_#valid| 162) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) (= |c_~#pkt_devs~0.base| 162) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (= 0 |c_~#pkt_devs~0.offset|) (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |ULTIMATE.start_ldv_malloc_~p~5#1.base|)) (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (not (= |ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)))) (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| 162)) (= (select .cse1 .cse6) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base|) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select .cse0 .cse6) 0))) is different from false [2021-11-22 20:55:42,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|)) (.cse2 (+ 8 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (= (select .cse0 |c_~#pkt_devs~0.offset|) 0) (= (select .cse1 |c_~#pkt_devs~0.offset|) 0) (= (select |c_#valid| 162) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) (= |c_~#pkt_devs~0.base| 162) (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (not (= |ULTIMATE.start_ldv_malloc_~p~5#1.base| 162)))) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (= 0 |c_~#pkt_devs~0.offset|) (= (select .cse1 .cse2) 0) (forall ((|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| Int)) (let ((.cse4 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1045) |c_~#pkt_devs~0.base|)) (.cse3 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| v_ArrVal_1046) |c_~#pkt_devs~0.base|))) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1044) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_54| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40|) 0)) (< 0 (mod (+ (select .cse3 |c_~#pkt_devs~0.offset|) (select .cse4 |c_~#pkt_devs~0.offset|)) 18446744073709551616)) (= (mod (let ((.cse5 (+ 8 |c_~#pkt_devs~0.offset|))) (+ (select .cse4 .cse5) (select .cse3 .cse5))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_40| |c_#StackHeapBarrier|)))) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select .cse0 .cse2) 0))) is different from false [2021-11-22 20:56:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:56:36,439 INFO L93 Difference]: Finished difference Result 35297 states and 47756 transitions. [2021-11-22 20:56:36,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-22 20:56:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.113207547169812) internal successors, (271), 52 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-11-22 20:56:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:56:36,514 INFO L225 Difference]: With dead ends: 35297 [2021-11-22 20:56:36,515 INFO L226 Difference]: Without dead ends: 27668 [2021-11-22 20:56:36,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 190 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1843 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=929, Invalid=6054, Unknown=33, NotChecked=1914, Total=8930 [2021-11-22 20:56:36,547 INFO L933 BasicCegarLoop]: 6193 mSDtfsCounter, 11464 mSDsluCounter, 93858 mSDsCounter, 0 mSdLazyCounter, 11765 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11467 SdHoareTripleChecker+Valid, 100051 SdHoareTripleChecker+Invalid, 80946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 11765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68471 IncrementalHoareTripleChecker+Unchecked, 46.2s IncrementalHoareTripleChecker+Time [2021-11-22 20:56:36,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11467 Valid, 100051 Invalid, 80946 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [710 Valid, 11765 Invalid, 0 Unknown, 68471 Unchecked, 46.2s Time] [2021-11-22 20:56:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27668 states. [2021-11-22 20:56:37,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27668 to 9289. [2021-11-22 20:56:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9289 states, 9224 states have (on average 1.3580875975715525) internal successors, (12527), 9228 states have internal predecessors, (12527), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-11-22 20:56:37,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9289 states to 9289 states and 12599 transitions. [2021-11-22 20:56:37,936 INFO L78 Accepts]: Start accepts. Automaton has 9289 states and 12599 transitions. Word has length 107 [2021-11-22 20:56:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:56:37,936 INFO L470 AbstractCegarLoop]: Abstraction has 9289 states and 12599 transitions. [2021-11-22 20:56:37,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.113207547169812) internal successors, (271), 52 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:56:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 9289 states and 12599 transitions. [2021-11-22 20:56:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-22 20:56:37,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:56:37,942 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:56:37,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-22 20:56:38,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-22 20:56:38,157 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:56:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:56:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1469089683, now seen corresponding path program 2 times [2021-11-22 20:56:38,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:56:38,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508942327] [2021-11-22 20:56:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:56:38,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:56:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 20:56:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:56:39,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 20:56:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508942327] [2021-11-22 20:56:39,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508942327] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 20:56:39,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148864406] [2021-11-22 20:56:39,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 20:56:39,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:56:39,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:56:39,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 20:56:39,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-22 20:56:50,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 20:56:50,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 20:56:50,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 133 conjunts are in the unsatisfiable core [2021-11-22 20:56:50,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 20:56:50,154 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:56:50,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 81 [2021-11-22 20:56:50,165 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:56:50,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2021-11-22 20:56:50,286 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-22 20:56:50,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-11-22 20:56:50,420 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:56:50,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 17 [2021-11-22 20:56:51,180 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-11-22 20:56:51,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 36 [2021-11-22 20:56:51,395 INFO L354 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2021-11-22 20:56:51,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2021-11-22 20:56:53,380 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:56:53,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 95 [2021-11-22 20:56:53,395 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:56:53,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 99 [2021-11-22 20:56:53,571 INFO L354 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2021-11-22 20:56:53,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 36 [2021-11-22 20:56:54,632 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-11-22 20:56:54,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 32 [2021-11-22 20:56:55,728 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:56:55,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 101 [2021-11-22 20:56:55,742 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 20:56:55,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 85 [2021-11-22 20:56:57,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-11-22 20:56:57,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2021-11-22 20:56:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:56:57,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 20:57:01,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)))) is different from false [2021-11-22 20:57:01,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:57:02,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| c_~class_pktcdvd~0.base v_ArrVal_1154) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| c_~class_pktcdvd~0.base v_ArrVal_1153) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2021-11-22 20:57:02,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_1154) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_1153) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2021-11-22 20:57:02,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_1153) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_1154) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|))) is different from false [2021-11-22 20:57:02,267 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_1153) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_1154) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2021-11-22 20:57:02,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_1153) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_1154) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2021-11-22 20:57:02,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_1153) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_1154) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2021-11-22 20:57:07,854 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_23| Int) (v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1154 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (|v_ULTIMATE.start_ldv_malloc_~p~5#1.base_224| Int) (v_ArrVal_1160 (Array Int Int)) (v_ArrVal_1152 Int) (|v_ULTIMATE.start_IS_ERR_~ptr#1.base_173| Int) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_224| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_23| 1))) (or (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_173|) (<= |c_#StackHeapBarrier| |v_ULTIMATE.start_ldv_malloc_~p~5#1.base_224|) (not (= (select (store (store (store (store .cse0 |v_ULTIMATE.start_IS_ERR_~ptr#1.base_173| v_ArrVal_1152) |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_23| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (= (mod (let ((.cse1 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_173| v_ArrVal_1154) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_173| v_ArrVal_1153) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (not (= (select .cse2 |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_23|) 0)) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (not (= (select .cse0 |v_ULTIMATE.start_IS_ERR_~ptr#1.base_173|) 0)))))) is different from false [2021-11-22 20:57:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 20:57:10,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148864406] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 20:57:10,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-22 20:57:10,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 25] total 63 [2021-11-22 20:57:10,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567307193] [2021-11-22 20:57:10,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-22 20:57:10,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-11-22 20:57:10,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 20:57:10,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-11-22 20:57:10,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2567, Unknown=36, NotChecked=1026, Total=4032 [2021-11-22 20:57:10,866 INFO L87 Difference]: Start difference. First operand 9289 states and 12599 transitions. Second operand has 64 states, 64 states have (on average 4.390625) internal successors, (281), 63 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:57:14,298 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| 162) 1)) (.cse4 (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| 162))) (.cse0 (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|)) (.cse3 (+ 16 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (= (select |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base|) 1) (= (select .cse0 (+ 24 |c_~#pkt_devs~0.offset|)) 0) (= (select .cse0 (+ 32 |c_~#pkt_devs~0.offset|)) 0) (= (select .cse0 (+ 56 |c_~#pkt_devs~0.offset|)) 0) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (v_ArrVal_1155 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (not (= (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)) (= (mod (let ((.cse1 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse1))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|))) .cse2 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) (= |c_~#pkt_devs~0.base| 162) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (= (select .cse0 (+ 40 |c_~#pkt_devs~0.offset|)) 0) (= 0 (select .cse0 .cse3)) (or (<= 163 |c_#StackHeapBarrier|) (and .cse2 .cse4)) (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (not (= |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| |ULTIMATE.start_ldv_malloc_~p~5#1.base|)) (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (< |ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_#StackHeapBarrier|))) (= 0 |c_~#pkt_devs~0.offset|) .cse4 (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select .cse0 (+ 48 |c_~#pkt_devs~0.offset|)) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0))) is different from false [2021-11-22 20:57:14,309 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| 162) 1)) (.cse1 (select |c_#memory_$Pointer$.base| |c_~#pkt_devs~0.base|)) (.cse3 (+ 16 |c_~#pkt_devs~0.offset|))) (and (not (= |c_~#ctl_mutex~0.base| |c_~#pkt_devs~0.base|)) (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1156 Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| Int) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| Int) (v_ArrVal_1160 (Array Int Int))) (or (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1160) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| v_ArrVal_1159) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0) (<= |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41| |c_#StackHeapBarrier|) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1156) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_55| 1) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_41|) 0)))) (= (select .cse1 (+ 24 |c_~#pkt_devs~0.offset|)) 0) (= (select .cse1 (+ 32 |c_~#pkt_devs~0.offset|)) 0) (= (select .cse1 (+ 56 |c_~#pkt_devs~0.offset|)) 0) .cse2 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base|) (= |c_~#pkt_devs~0.base| 162) (not (= |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| 162)) (= (select .cse1 (+ 40 |c_~#pkt_devs~0.offset|)) 0) (or (<= 163 |c_#StackHeapBarrier|) .cse2) (= 0 (select .cse1 .cse3)) (= 0 |c_~#pkt_devs~0.offset|) (exists ((|ULTIMATE.start_ldv_malloc_~p~5#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_ldv_malloc_~p~5#1.base|) 1) (< |ULTIMATE.start_ldv_malloc_~p~5#1.base| |c_#StackHeapBarrier|))) (not (= |c_~#pkt_devs~0.base| c_~class_pktcdvd~0.base)) (= (select .cse1 (+ 48 |c_~#pkt_devs~0.offset|)) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pkt_devs~0.base|) .cse3) 0))) is different from false [2021-11-22 20:58:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 20:58:04,000 INFO L93 Difference]: Finished difference Result 21620 states and 29532 transitions. [2021-11-22 20:58:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-11-22 20:58:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 4.390625) internal successors, (281), 63 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2021-11-22 20:58:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 20:58:04,034 INFO L225 Difference]: With dead ends: 21620 [2021-11-22 20:58:04,035 INFO L226 Difference]: Without dead ends: 13413 [2021-11-22 20:58:04,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 3185 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=1217, Invalid=10092, Unknown=77, NotChecked=2420, Total=13806 [2021-11-22 20:58:04,053 INFO L933 BasicCegarLoop]: 3339 mSDtfsCounter, 3536 mSDsluCounter, 73980 mSDsCounter, 0 mSdLazyCounter, 9940 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3538 SdHoareTripleChecker+Valid, 77319 SdHoareTripleChecker+Invalid, 33545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 9940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23412 IncrementalHoareTripleChecker+Unchecked, 39.3s IncrementalHoareTripleChecker+Time [2021-11-22 20:58:04,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3538 Valid, 77319 Invalid, 33545 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [193 Valid, 9940 Invalid, 0 Unknown, 23412 Unchecked, 39.3s Time] [2021-11-22 20:58:04,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13413 states. [2021-11-22 20:58:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13413 to 9364. [2021-11-22 20:58:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9364 states, 9299 states have (on average 1.3592859447252392) internal successors, (12640), 9303 states have internal predecessors, (12640), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2021-11-22 20:58:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9364 states to 9364 states and 12712 transitions. [2021-11-22 20:58:05,337 INFO L78 Accepts]: Start accepts. Automaton has 9364 states and 12712 transitions. Word has length 108 [2021-11-22 20:58:05,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 20:58:05,337 INFO L470 AbstractCegarLoop]: Abstraction has 9364 states and 12712 transitions. [2021-11-22 20:58:05,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 4.390625) internal successors, (281), 63 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 20:58:05,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9364 states and 12712 transitions. [2021-11-22 20:58:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-22 20:58:05,344 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 20:58:05,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:58:05,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-22 20:58:05,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 20:58:05,572 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 20:58:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 20:58:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2036313195, now seen corresponding path program 1 times [2021-11-22 20:58:05,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 20:58:05,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988306714] [2021-11-22 20:58:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 20:58:05,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 20:58:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 20:58:06,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 20:58:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 20:58:10,835 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 20:58:10,835 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 20:58:10,836 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-22 20:58:10,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-22 20:58:10,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-22 20:58:10,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-22 20:58:10,837 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-22 20:58:10,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-22 20:58:10,840 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 20:58:10,842 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 20:58:11,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 08:58:11 BoogieIcfgContainer [2021-11-22 20:58:11,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 20:58:11,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 20:58:11,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 20:58:11,110 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 20:58:11,110 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:50:23" (3/4) ... [2021-11-22 20:58:11,115 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 20:58:11,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 20:58:11,115 INFO L158 Benchmark]: Toolchain (without parser) took 481038.10ms. Allocated memory was 102.8MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 65.4MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-22 20:58:11,117 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:58:11,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2532.88ms. Allocated memory was 102.8MB in the beginning and 182.5MB in the end (delta: 79.7MB). Free memory was 65.2MB in the beginning and 104.3MB in the end (delta: -39.1MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2021-11-22 20:58:11,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 378.78ms. Allocated memory is still 182.5MB. Free memory was 104.3MB in the beginning and 82.0MB in the end (delta: 22.3MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2021-11-22 20:58:11,117 INFO L158 Benchmark]: Boogie Preprocessor took 503.10ms. Allocated memory is still 182.5MB. Free memory was 82.0MB in the beginning and 54.5MB in the end (delta: 27.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2021-11-22 20:58:11,118 INFO L158 Benchmark]: RCFGBuilder took 9626.31ms. Allocated memory was 182.5MB in the beginning and 729.8MB in the end (delta: 547.4MB). Free memory was 54.5MB in the beginning and 359.4MB in the end (delta: -304.9MB). Peak memory consumption was 244.3MB. Max. memory is 16.1GB. [2021-11-22 20:58:11,118 INFO L158 Benchmark]: TraceAbstraction took 467986.01ms. Allocated memory was 729.8MB in the beginning and 3.1GB in the end (delta: 2.3GB). Free memory was 358.3MB in the beginning and 1.9GB in the end (delta: -1.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2021-11-22 20:58:11,121 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 3.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 20:58:11,123 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2532.88ms. Allocated memory was 102.8MB in the beginning and 182.5MB in the end (delta: 79.7MB). Free memory was 65.2MB in the beginning and 104.3MB in the end (delta: -39.1MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 378.78ms. Allocated memory is still 182.5MB. Free memory was 104.3MB in the beginning and 82.0MB in the end (delta: 22.3MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 503.10ms. Allocated memory is still 182.5MB. Free memory was 82.0MB in the beginning and 54.5MB in the end (delta: 27.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * RCFGBuilder took 9626.31ms. Allocated memory was 182.5MB in the beginning and 729.8MB in the end (delta: 547.4MB). Free memory was 54.5MB in the beginning and 359.4MB in the end (delta: -304.9MB). Peak memory consumption was 244.3MB. Max. memory is 16.1GB. * TraceAbstraction took 467986.01ms. Allocated memory was 729.8MB in the beginning and 3.1GB in the end (delta: 2.3GB). Free memory was 358.3MB in the beginning and 1.9GB in the end (delta: -1.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 3.1GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9689]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 9418, overapproximation of bitwiseOr at line 4152, overapproximation of bitwiseAnd at line 4151, overapproximation of __builtin_object_size at line 4237. Possible FailurePath: [L4511-L4519] static struct mutex pktcdvd_mutex = {{1}, {{{{0U}, 3735899821U, 4294967295U, (void *)0x0fffffffffffffffUL, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, "pktcdvd_mutex.wait_lock", 0, 0UL}}}}, {& pktcdvd_mutex.wait_list, & pktcdvd_mutex.wait_list}, (struct task_struct *)0, (char const *)0, (void *)(& pktcdvd_mutex), {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, "pktcdvd_mutex", 0, 0UL}}; [L4520] static struct pktcdvd_device *pkt_devs[8U] ; [L4521] static struct proc_dir_entry *pkt_proc ; [L4522] static int pktdev_major ; [L4523] static int write_congestion_on = 10000; [L4524] static int write_congestion_off = 9000; [L4525] static struct mutex ctl_mutex ; [L4526] static mempool_t *psd_pool ; [L4527] static struct class *class_pktcdvd = (struct class *)0; [L4528] static struct dentry *pkt_debugfs_root = (struct dentry *)0; [L4585-L4587] static struct attribute kobj_pkt_attr_st1 = {"reset", 128U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4588-L4590] static struct attribute kobj_pkt_attr_st2 = {"packets_started", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4591-L4594] static struct attribute kobj_pkt_attr_st3 = {"packets_finished", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4595-L4597] static struct attribute kobj_pkt_attr_st4 = {"kb_written", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4598-L4600] static struct attribute kobj_pkt_attr_st5 = {"kb_read", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4601-L4603] static struct attribute kobj_pkt_attr_st6 = {"kb_read_gather", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4604-L4605] static struct attribute *kobj_pkt_attrs_stat[7U] = { & kobj_pkt_attr_st1, & kobj_pkt_attr_st2, & kobj_pkt_attr_st3, & kobj_pkt_attr_st4, & kobj_pkt_attr_st5, & kobj_pkt_attr_st6, (struct attribute *)0}; [L4606-L4607] static struct attribute kobj_pkt_attr_wq1 = {"size", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4608-L4610] static struct attribute kobj_pkt_attr_wq2 = {"congestion_off", 420U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4611-L4613] static struct attribute kobj_pkt_attr_wq3 = {"congestion_on", 420U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}; [L4614] static struct attribute *kobj_pkt_attrs_wqueue[4U] = { & kobj_pkt_attr_wq1, & kobj_pkt_attr_wq2, & kobj_pkt_attr_wq3, (struct attribute *)0}; [L4844] static struct sysfs_ops const kobj_pkt_ops = {& kobj_pkt_show, & kobj_pkt_store}; [L4845-L4846] static struct kobj_type kobj_pkt_type_stat = {& pkt_kobj_release, & kobj_pkt_ops, (struct attribute **)(& kobj_pkt_attrs_stat), (struct kobj_ns_type_operations const *(*)(struct kobject * ))0, (void const *(*)(struct kobject * ))0}; [L4847-L4848] static struct kobj_type kobj_pkt_type_wqueue = {& pkt_kobj_release, & kobj_pkt_ops, (struct attribute **)(& kobj_pkt_attrs_wqueue), (struct kobj_ns_type_operations const *(*)(struct kobject * ))0, (void const *(*)(struct kobject * ))0}; [L4986-L5010] static struct class_attribute class_pktcdvd_attrs[4U] = { {{"add", 128U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, (ssize_t (*)(struct class * , struct class_attribute * , char * ))0, & class_pktcdvd_store_add}, {{"remove", 128U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, (ssize_t (*)(struct class * , struct class_attribute * , char * ))0, & class_pktcdvd_store_remove}, {{"device_map", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, & class_pktcdvd_show_map, (ssize_t (*)(struct class * , struct class_attribute * , char const * , size_t ))0}, {{(char const *)0, 0U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, (ssize_t (*)(struct class * , struct class_attribute * , char * ))0, (ssize_t (*)(struct class * , struct class_attribute * , char const * , size_t ))0}}; [L5077-L5104] static struct file_operations const debug_fops = {& __this_module, & seq_lseek, & seq_read, (ssize_t (*)(struct file * , char const * , size_t , loff_t * ))0, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (int (*)(struct file * , void * , int (*)(void * , char const * , int , loff_t , u64 , unsigned int ) ))0, (unsigned int (*)(struct file * , struct poll_table_struct * ))0, (long (*)(struct file * , unsigned int , unsigned long ))0, (long (*)(struct file * , unsigned int , unsigned long ))0, (int (*)(struct file * , struct vm_area_struct * ))0, & pkt_debugfs_fops_open, (int (*)(struct file * , fl_owner_t ))0, & single_release, (int (*)(struct file * , int ))0, (int (*)(struct kiocb * , int ))0, (int (*)(int , struct file * , int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct file * , struct page * , int , size_t , loff_t * , int ))0, (unsigned long (*)(struct file * , unsigned long , unsigned long , unsigned long , unsigned long ))0, (int (*)(int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct pipe_inode_info * , struct file * , loff_t * , size_t , unsigned int ))0, (ssize_t (*)(struct file * , loff_t * , struct pipe_inode_info * , size_t , unsigned int ))0, (int (*)(struct file * , long , struct file_lock ** ))0, (long (*)(struct file * , int , loff_t , loff_t ))0}; [L7900-L7904] static char clv_to_speed[16U] = { (char)0, (char)2, (char)4, (char)6, (char)8, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}; [L7905-L7909] static char hs_clv_to_speed[16U] = { (char)0, (char)2, (char)4, (char)6, (char)10, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0, (char)0}; [L7910-L7914] static char us_clv_to_speed[16U] = { (char)0, (char)2, (char)4, (char)8, (char)0, (char)0, (char)16, (char)0, (char)24, (char)32, (char)40, (char)48, (char)0, (char)0, (char)0, (char)0}; [L8751-L8780] static struct file_operations const pkt_proc_fops = {(struct module *)0, & seq_lseek, & seq_read, (ssize_t (*)(struct file * , char const * , size_t , loff_t * ))0, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (int (*)(struct file * , void * , int (*)(void * , char const * , int , loff_t , u64 , unsigned int ) ))0, (unsigned int (*)(struct file * , struct poll_table_struct * ))0, (long (*)(struct file * , unsigned int , unsigned long ))0, (long (*)(struct file * , unsigned int , unsigned long ))0, (int (*)(struct file * , struct vm_area_struct * ))0, & pkt_seq_open, (int (*)(struct file * , fl_owner_t ))0, & single_release, (int (*)(struct file * , int ))0, (int (*)(struct kiocb * , int ))0, (int (*)(int , struct file * , int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct file * , struct page * , int , size_t , loff_t * , int ))0, (unsigned long (*)(struct file * , unsigned long , unsigned long , unsigned long , unsigned long ))0, (int (*)(int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct pipe_inode_info * , struct file * , loff_t * , size_t , unsigned int ))0, (ssize_t (*)(struct file * , loff_t * , struct pipe_inode_info * , size_t , unsigned int ))0, (int (*)(struct file * , long , struct file_lock ** ))0, (long (*)(struct file * , int , loff_t , loff_t ))0}; [L8976-L8983] static struct block_device_operations const pktcdvd_ops = {& pkt_open, & pkt_close, & pkt_ioctl, (int (*)(struct block_device * , fmode_t , unsigned int , unsigned long ))0, (int (*)(struct block_device * , sector_t , void ** , unsigned long * ))0, & pkt_check_events, (int (*)(struct gendisk * ))0, (void (*)(struct gendisk * ))0, (int (*)(struct gendisk * ))0, (int (*)(struct block_device * , struct hd_geometry * ))0, (void (*)(struct block_device * , unsigned long ))0, & __this_module}; [L9340-L9369] static struct file_operations const pkt_ctl_fops = {& __this_module, & no_llseek, (ssize_t (*)(struct file * , char * , size_t , loff_t * ))0, (ssize_t (*)(struct file * , char const * , size_t , loff_t * ))0, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (int (*)(struct file * , void * , int (*)(void * , char const * , int , loff_t , u64 , unsigned int ) ))0, (unsigned int (*)(struct file * , struct poll_table_struct * ))0, & pkt_ctl_ioctl, & pkt_ctl_compat_ioctl, (int (*)(struct file * , struct vm_area_struct * ))0, & nonseekable_open, (int (*)(struct file * , fl_owner_t ))0, (int (*)(struct inode * , struct file * ))0, (int (*)(struct file * , int ))0, (int (*)(struct kiocb * , int ))0, (int (*)(int , struct file * , int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct file * , struct page * , int , size_t , loff_t * , int ))0, (unsigned long (*)(struct file * , unsigned long , unsigned long , unsigned long , unsigned long ))0, (int (*)(int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct pipe_inode_info * , struct file * , loff_t * , size_t , unsigned int ))0, (ssize_t (*)(struct file * , loff_t * , struct pipe_inode_info * , size_t , unsigned int ))0, (int (*)(struct file * , long , struct file_lock ** ))0, (long (*)(struct file * , int , loff_t , loff_t ))0}; [L9370-L9372] static struct miscdevice pkt_misc = {255, "pktcdvd", & pkt_ctl_fops, {(struct list_head *)0, (struct list_head *)0}, (struct device *)0, (struct device *)0, "pktcdvd/control", 0U}; [L9455] int LDV_IN_INTERRUPT ; [L9693] int ldv_module_refcounter = 1; VAL [__this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=0, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={0:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9457] struct kobject *var_group1 ; [L9458] struct attribute *var_group2 ; [L9459] char *var_kobj_pkt_show_3_p2 ; [L9460] char const *var_kobj_pkt_store_5_p2 ; [L9461] size_t var_kobj_pkt_store_5_p3 ; [L9462] struct inode *var_group3 ; [L9463] struct file *var_group4 ; [L9464] int res_pkt_debugfs_fops_open_15 ; [L9465] int res_pkt_seq_open_80 ; [L9466] struct block_device *var_group5 ; [L9467] fmode_t var_pkt_open_73_p1 ; [L9468] int res_pkt_open_73 ; [L9469] struct gendisk *var_group6 ; [L9470] fmode_t var_pkt_close_74_p1 ; [L9471] fmode_t var_pkt_ioctl_82_p1 ; [L9472] unsigned int var_pkt_ioctl_82_p2 ; [L9473] unsigned long var_pkt_ioctl_82_p3 ; [L9474] unsigned int var_pkt_check_events_83_p1 ; [L9475] unsigned int var_pkt_ctl_ioctl_88_p1 ; [L9476] unsigned long var_pkt_ctl_ioctl_88_p2 ; [L9477] unsigned int var_pkt_ctl_compat_ioctl_89_p1 ; [L9478] unsigned long var_pkt_ctl_compat_ioctl_89_p2 ; [L9479] int ldv_s_kobj_pkt_type_stat_kobj_type ; [L9480] int ldv_s_kobj_pkt_type_wqueue_kobj_type ; [L9481] int ldv_s_debug_fops_file_operations ; [L9482] int ldv_s_pkt_proc_fops_file_operations ; [L9483] int ldv_s_pktcdvd_ops_block_device_operations ; [L9484] int tmp ; [L9485] int tmp___0 ; [L9486] int tmp___1 ; [L9489] ldv_s_kobj_pkt_type_stat_kobj_type = 0 [L9490] ldv_s_kobj_pkt_type_wqueue_kobj_type = 0 [L9491] ldv_s_debug_fops_file_operations = 0 [L9492] ldv_s_pkt_proc_fops_file_operations = 0 [L9493] ldv_s_pktcdvd_ops_block_device_operations = 0 [L9494] LDV_IN_INTERRUPT = 1 [L9495] FCALL ldv_initialize() [L9496] CALL, EXPR pkt_init() [L9374] int ret ; [L9375] struct lock_class_key __key ; [L9378] FCALL __mutex_init(& ctl_mutex, "&ctl_mutex", & __key) [L9379] CALL, EXPR mempool_create_kmalloc_pool(64, 16UL) [L4336] mempool_t *tmp ; [L4339] CALL, EXPR mempool_create(min_nr, & mempool_kmalloc, & mempool_kfree, (void *)size) [L10042] CALL, EXPR ldv_malloc(sizeof(mempool_t)) [L9833] COND FALSE !(__VERIFIER_nondet_bool()) [L9834] void *p = malloc(size); [L9835] CALL, EXPR IS_ERR(p) [L3944] long tmp ; [L3947] tmp = __builtin_expect((long )((unsigned long )ptr > 0x0ffffffffffff000UL), 0L) [L3949] return (tmp); VAL [\result=0, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={0:0}, ptr={-17293822569102708736:0}, ptr={-17293822569102708736:0}, tmp=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9835] RET, EXPR IS_ERR(p) [L9835] CALL assume_abort_if_not(IS_ERR(p) == 0) [L9829] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, cond=1, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={0:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9835] RET assume_abort_if_not(IS_ERR(p) == 0) [L9836] return p; VAL [\old(size)=192, \result={-17293822569102708736:0}, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, p={-17293822569102708736:0}, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={0:0}, size=192, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L10042] RET, EXPR ldv_malloc(sizeof(mempool_t)) [L10042] return ldv_malloc(sizeof(mempool_t)); [L4339] RET, EXPR mempool_create(min_nr, & mempool_kmalloc, & mempool_kfree, (void *)size) [L4339] tmp = mempool_create(min_nr, & mempool_kmalloc, & mempool_kfree, (void *)size) [L4341] return (tmp); VAL [\old(min_nr)=64, \old(size)=16, \result={-17293822569102708736:0}, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, min_nr=64, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={0:0}, size=16, tmp={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9379] RET, EXPR mempool_create_kmalloc_pool(64, 16UL) [L9379] psd_pool = mempool_create_kmalloc_pool(64, 16UL) [L9381] COND FALSE !((unsigned long )psd_pool == (unsigned long )((mempool_t *)0)) [L9386] CALL, EXPR register_blkdev((unsigned int )pktdev_major, "pktcdvd") [L10097] return __VERIFIER_nondet_int(); [L9386] RET, EXPR register_blkdev((unsigned int )pktdev_major, "pktcdvd") [L9386] ret = register_blkdev((unsigned int )pktdev_major, "pktcdvd") [L9388] COND FALSE !(ret < 0) VAL [__key={323:0}, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9395] COND TRUE pktdev_major == 0 [L9396] pktdev_major = ret VAL [__key={323:0}, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9400] CALL, EXPR pkt_sysfs_init() [L5012] int ret ; [L5013] void *tmp ; [L5014] struct lock_class_key __key ; [L5015] int tmp___0 ; [L5018] ret = 0 [L5019] CALL, EXPR kzalloc(128UL, 208U) [L4186] void *tmp ; [L4189] CALL, EXPR kmalloc(size, flags | 32768U) [L4159] void *tmp___2 ; [L4162] CALL, EXPR __kmalloc(size, flags) [L9839] CALL, EXPR ldv_malloc(arg0) [L9833] COND FALSE !(__VERIFIER_nondet_bool()) [L9834] void *p = malloc(size); [L9835] CALL, EXPR IS_ERR(p) [L3944] long tmp ; [L3947] tmp = __builtin_expect((long )((unsigned long )ptr > 0x0ffffffffffff000UL), 0L) [L3949] return (tmp); VAL [\result=0, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ptr={-18446744073709551615:0}, ptr={-18446744073709551615:0}, tmp=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9835] RET, EXPR IS_ERR(p) [L9835] CALL assume_abort_if_not(IS_ERR(p) == 0) [L9829] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, cond=1, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9835] RET assume_abort_if_not(IS_ERR(p) == 0) [L9836] return p; VAL [\old(size)=128, \result={-18446744073709551615:0}, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, p={-18446744073709551615:0}, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, size=128, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9839] RET, EXPR ldv_malloc(arg0) [L9839] return ldv_malloc(arg0); [L4162] RET, EXPR __kmalloc(size, flags) [L4162] tmp___2 = __kmalloc(size, flags) [L4164] return (tmp___2); VAL [\old(flags)=2, \old(size)=128, \result={-18446744073709551615:0}, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, flags=2, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, size=128, tmp___2={-18446744073709551615:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L4189] RET, EXPR kmalloc(size, flags | 32768U) [L4189] tmp = kmalloc(size, flags | 32768U) [L4191] return (tmp); VAL [\old(flags)=208, \old(size)=128, \result={-18446744073709551615:0}, __this_module={18446744073709551617:0}, class_pktcdvd={0:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, flags=208, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, size=128, tmp={-18446744073709551615:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L5019] RET, EXPR kzalloc(128UL, 208U) [L5019] tmp = kzalloc(128UL, 208U) [L5020] class_pktcdvd = (struct class *)tmp VAL [__key={324:0}, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, tmp={-18446744073709551615:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L5022] COND FALSE !((unsigned long )class_pktcdvd == (unsigned long )((struct class *)0)) [L5027] class_pktcdvd->name = "pktcdvd" [L5028] class_pktcdvd->owner = & __this_module [L5029] class_pktcdvd->class_release = & class_pktcdvd_release [L5030] class_pktcdvd->class_attrs = (struct class_attribute *)(& class_pktcdvd_attrs) [L5031] CALL, EXPR __class_register(class_pktcdvd, & __key) [L9817] return __VERIFIER_nondet_int(); [L5031] RET, EXPR __class_register(class_pktcdvd, & __key) [L5031] tmp___0 = __class_register(class_pktcdvd, & __key) [L5032] ret = tmp___0 VAL [__key={324:0}, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, tmp={-18446744073709551615:0}, tmp___0=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L5034] COND FALSE !(ret != 0) [L5043] return (0); [L5043] return (0); VAL [\result=0, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, tmp={-18446744073709551615:0}, tmp___0=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9400] RET, EXPR pkt_sysfs_init() [L9400] ret = pkt_sysfs_init() [L9402] COND FALSE !(ret != 0) [L9407] CALL pkt_debugfs_init() [L5160] long tmp ; [L5163] CALL, EXPR debugfs_create_dir("pktcdvd", (struct dentry *)0) [L9977] CALL, EXPR ldv_malloc(sizeof(struct dentry)) [L9833] COND TRUE __VERIFIER_nondet_bool() [L9833] return 0; VAL [\old(size)=256, \result={0:0}, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, size=256, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9977] RET, EXPR ldv_malloc(sizeof(struct dentry)) [L9977] return ldv_malloc(sizeof(struct dentry)); [L5163] RET, EXPR debugfs_create_dir("pktcdvd", (struct dentry *)0) [L5163] pkt_debugfs_root = debugfs_create_dir("pktcdvd", (struct dentry *)0) [L5164] CALL, EXPR IS_ERR((void const *)pkt_debugfs_root) [L3944] long tmp ; [L3947] tmp = __builtin_expect((long )((unsigned long )ptr > 0x0ffffffffffff000UL), 0L) [L3949] return (tmp); VAL [\result=0, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ptr={0:0}, ptr={0:0}, tmp=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L5164] RET, EXPR IS_ERR((void const *)pkt_debugfs_root) [L5164] tmp = IS_ERR((void const *)pkt_debugfs_root) [L5166] COND FALSE !(tmp != 0L) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9407] RET pkt_debugfs_init() [L9408] CALL, EXPR misc_register(& pkt_misc) [L10059] return __VERIFIER_nondet_int(); [L9408] RET, EXPR misc_register(& pkt_misc) [L9408] ret = misc_register(& pkt_misc) [L9410] COND FALSE !(ret != 0) [L9418] CALL, EXPR proc_mkdir("driver/pktcdvd", (struct proc_dir_entry *)0) [L10075] CALL, EXPR ldv_malloc(sizeof(struct proc_dir_entry)) [L9833] COND TRUE __VERIFIER_nondet_bool() [L9833] return 0; VAL [\old(size)=208, \result={0:0}, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, size=208, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L10075] RET, EXPR ldv_malloc(sizeof(struct proc_dir_entry)) [L10075] return ldv_malloc(sizeof(struct proc_dir_entry)); [L9418] RET, EXPR proc_mkdir("driver/pktcdvd", (struct proc_dir_entry *)0) [L9418] pkt_proc = proc_mkdir("driver/pktcdvd", (struct proc_dir_entry *)0) [L9420] return (0); [L9420] return (0); VAL [\result=0, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9496] RET, EXPR pkt_init() [L9496] tmp = pkt_init() [L9498] COND FALSE !(tmp != 0) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9652] tmp___1 = __VERIFIER_nondet_int() [L9654] COND TRUE tmp___1 != 0 VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___1=1, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9505] tmp___0 = __VERIFIER_nondet_int() [L9507] COND FALSE !(tmp___0 == 0) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=2, tmp___1=1, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9510] COND FALSE !(tmp___0 == 1) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=2, tmp___1=1, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9513] COND TRUE tmp___0 == 2 VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=2, tmp___1=1, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9556] COND TRUE ldv_s_kobj_pkt_type_stat_kobj_type == 0 [L9558] CALL pkt_kobj_release(var_group1) [L4576] struct kobject const *__mptr ; [L4579] __mptr = (struct kobject const *)kobj [L4580] CALL kfree((void const *)((struct pktcdvd_kobj *)__mptr)) [L4580] RET kfree((void const *)((struct pktcdvd_kobj *)__mptr)) [L9558] RET pkt_kobj_release(var_group1) [L9559] ldv_s_kobj_pkt_type_stat_kobj_type = 0 VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=2, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9652] tmp___1 = __VERIFIER_nondet_int() [L9654] COND TRUE tmp___1 != 0 VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=2, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9505] tmp___0 = __VERIFIER_nondet_int() [L9507] COND FALSE !(tmp___0 == 0) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9510] COND FALSE !(tmp___0 == 1) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9513] COND FALSE !(tmp___0 == 2) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9516] COND FALSE !(tmp___0 == 3) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9519] COND FALSE !(tmp___0 == 4) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9522] COND FALSE !(tmp___0 == 5) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9525] COND FALSE !(tmp___0 == 6) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9528] COND FALSE !(tmp___0 == 7) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9531] COND FALSE !(tmp___0 == 8) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9534] COND FALSE !(tmp___0 == 9) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9537] COND TRUE tmp___0 == 10 VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_debug_fops_file_operations=0, ldv_s_kobj_pkt_type_stat_kobj_type=0, ldv_s_kobj_pkt_type_wqueue_kobj_type=0, ldv_s_pkt_proc_fops_file_operations=0, ldv_s_pktcdvd_ops_block_device_operations=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, tmp=0, tmp___0=10, tmp___1=1, us_clv_to_speed={182:0}, var_group1={162:18446744073709551631}, write_congestion_off=9000, write_congestion_on=10000] [L9636] CALL pkt_ctl_ioctl(var_group4, var_pkt_ctl_ioctl_88_p1, var_pkt_ctl_ioctl_88_p2) [L9233] void *argp ; [L9234] struct pkt_ctrl_command ctrl_cmd ; [L9235] int ret ; [L9236] dev_t pkt_dev ; [L9237] unsigned long tmp ; [L9238] bool tmp___0 ; [L9239] int tmp___1 ; [L9240] dev_t tmp___2 ; [L9241] bool tmp___3 ; [L9242] int tmp___4 ; [L9243] dev_t tmp___5 ; [L9244] int tmp___6 ; [L9246] argp = (void *)arg [L9247] ret = 0 [L9248] pkt_dev = 0U VAL [\old(arg)=18446744073709551614, \old(cmd)=3222820865, __this_module={18446744073709551617:0}, arg=18446744073709551614, argp={0:-2}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, cmd=3222820865, ctl_mutex={163:0}, ctrl_cmd={189:0}, debug_fops={179:0}, file={18446744073709551629:18446744073709551634}, file={18446744073709551629:18446744073709551634}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev={162:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9249] COND FALSE !(cmd != 3222820865U) [L9254] CALL, EXPR copy_from_user((void *)(& ctrl_cmd), (void const *)argp, 24UL) [L4229] int sz ; [L4230] unsigned long tmp ; [L4231] int __ret_warn_on ; [L4232] long tmp___0 ; [L4233] long tmp___1 ; [L4234] long tmp___2 ; [L4237] tmp = __builtin_object_size((void *)((void const *)to), 0) [L4238] sz = (int )tmp [L4239] FCALL might_fault() [L4240] tmp___1 = __builtin_expect((long )(sz == -1), 1L) VAL [\old(n)=24, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, from={0:-2}, from={0:-2}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, n=24, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, sz=-1, tmp=4294967295, tmp___1=1, to={189:0}, to={189:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L4242] COND TRUE tmp___1 != 0L [L4244] CALL, EXPR _copy_from_user(to, from, (unsigned int )n) [L9858] return __VERIFIER_nondet_ulong(); [L4244] RET, EXPR _copy_from_user(to, from, (unsigned int )n) [L4244] n = _copy_from_user(to, from, (unsigned int )n) [L4271] return (n); VAL [\old(n)=24, \result=18446744073709551616, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, from={0:-2}, from={0:-2}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, n=0, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, sz=-1, tmp=4294967295, tmp___1=1, to={189:0}, to={189:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9254] RET, EXPR copy_from_user((void *)(& ctrl_cmd), (void const *)argp, 24UL) [L9254] tmp = copy_from_user((void *)(& ctrl_cmd), (void const *)argp, 24UL) [L9256] COND FALSE !(tmp != 0UL) [L9260] EXPR ctrl_cmd.command VAL [\old(arg)=18446744073709551614, \old(cmd)=3222820865, __this_module={18446744073709551617:0}, arg=18446744073709551614, argp={0:-2}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, cmd=3222820865, ctl_mutex={163:0}, ctrl_cmd={189:0}, ctrl_cmd.command=4294967297, debug_fops={179:0}, file={18446744073709551629:18446744073709551634}, file={18446744073709551629:18446744073709551634}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev={162:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, tmp=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9260] COND FALSE !((int )ctrl_cmd.command == 0) [L9263] EXPR ctrl_cmd.command VAL [\old(arg)=18446744073709551614, \old(cmd)=3222820865, __this_module={18446744073709551617:0}, arg=18446744073709551614, argp={0:-2}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, cmd=3222820865, ctl_mutex={163:0}, ctrl_cmd={189:0}, ctrl_cmd.command=4294967297, debug_fops={179:0}, file={18446744073709551629:18446744073709551634}, file={18446744073709551629:18446744073709551634}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev={162:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, tmp=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9263] COND TRUE (int )ctrl_cmd.command == 1 [L9292] CALL, EXPR capable(21) [L9964] return __VERIFIER_nondet_bool(); [L9292] RET, EXPR capable(21) [L9292] tmp___3 = capable(21) [L9294] COND TRUE \read(tmp___3) [L9295] tmp___4 = 0 VAL [\old(arg)=18446744073709551614, \old(cmd)=3222820865, __this_module={18446744073709551617:0}, arg=18446744073709551614, argp={0:-2}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, cmd=3222820865, ctl_mutex={163:0}, ctrl_cmd={189:0}, debug_fops={179:0}, file={18446744073709551629:18446744073709551634}, file={18446744073709551629:18446744073709551634}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev={162:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, tmp=0, tmp___3=1, tmp___4=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9299] COND FALSE !(\read(tmp___4)) [L9304] EXPR ctrl_cmd.pkt_dev [L9304] CALL, EXPR new_decode_dev(ctrl_cmd.pkt_dev) [L4148] unsigned int major ; [L4149] unsigned int minor ; [L4151] major = (dev & 1048320U) >> 8 [L4152] minor = (dev & 255U) | ((dev >> 12) & 1048320U) [L4153] return ((major << 20) | minor); VAL [\old(dev)=10, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, dev=10, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, major=190, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9304] RET, EXPR new_decode_dev(ctrl_cmd.pkt_dev) [L9304] tmp___5 = new_decode_dev(ctrl_cmd.pkt_dev) [L9305] CALL pkt_remove_dev(tmp___5) [L9138] struct pktcdvd_device *pd ; [L9139] int idx ; [L9140] int ret ; [L9141] long tmp ; [L9144] ret = 0 [L9145] FCALL mutex_lock_nested(& ctl_mutex, 1U) [L9146] idx = 0 VAL [\old(pkt_dev)=1, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, idx=0, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev=1, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9160] COND TRUE idx <= 7 VAL [\old(pkt_dev)=1, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, idx=0, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev=1, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9150] EXPR pkt_devs[idx] [L9150] pd = pkt_devs[idx] [L9151] COND TRUE (unsigned long )pd != (unsigned long )((struct pktcdvd_device *)0) [L9152] EXPR pd->pkt_dev VAL [\old(pkt_dev)=1, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, idx=0, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pd={187:0}, pd->pkt_dev=8589934593, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev=1, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9152] COND TRUE pd->pkt_dev == pkt_dev [L9166] COND FALSE !(idx == 8) [L9174] EXPR pd->refcnt VAL [\old(pkt_dev)=1, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, idx=0, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pd={187:0}, pd->refcnt=-3, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev=1, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9174] COND FALSE !(pd->refcnt > 0) [L9180] EXPR pd->cdrw.thread [L9180] CALL, EXPR IS_ERR((void const *)pd->cdrw.thread) [L3944] long tmp ; [L3947] tmp = __builtin_expect((long )((unsigned long )ptr > 0x0ffffffffffff000UL), 0L) [L3949] return (tmp); VAL [\result=1, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ptr={1152921504606842885:-4}, ptr={1152921504606842885:-4}, tmp=1, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9180] RET, EXPR IS_ERR((void const *)pd->cdrw.thread) [L9180] tmp = IS_ERR((void const *)pd->cdrw.thread) [L9182] COND FALSE !(tmp == 0L) VAL [\old(pkt_dev)=1, __this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, idx=0, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pd={187:0}, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_dev=1, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, ret=0, tmp=1, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9189] pkt_devs[idx] = (struct pktcdvd_device *)0 [L9190] CALL pkt_debugfs_dev_remove(pd) [L5138] COND TRUE (unsigned long )pkt_debugfs_root == (unsigned long )((struct dentry *)0) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pd={187:0}, pd={187:0}, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9190] RET pkt_debugfs_dev_remove(pd) [L9191] CALL pkt_sysfs_dev_remove(pd) [L4878] EXPR pd->kobj_stat [L4878] CALL pkt_kobj_remove(pd->kobj_stat) [L4566] COND FALSE !((unsigned long )p != (unsigned long )((struct pktcdvd_kobj *)0)) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, p={191:18446744073709551425}, p={191:18446744073709551425}, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L4878] RET pkt_kobj_remove(pd->kobj_stat) [L4879] EXPR pd->kobj_wqueue [L4879] CALL pkt_kobj_remove(pd->kobj_wqueue) [L4566] COND FALSE !((unsigned long )p != (unsigned long )((struct pktcdvd_kobj *)0)) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, p={193:18446744073709551423}, p={193:18446744073709551423}, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L4879] RET pkt_kobj_remove(pd->kobj_wqueue) [L4881] COND TRUE (unsigned long )class_pktcdvd != (unsigned long )((struct class *)0) [L4883] EXPR pd->dev [L4883] FCALL device_unregister(pd->dev) [L9191] RET pkt_sysfs_dev_remove(pd) [L9192] EXPR pd->bdev [L9192] CALL blkdev_put(pd->bdev, 65U) [L9960] return __VERIFIER_nondet_int(); [L9192] RET blkdev_put(pd->bdev, 65U) [L9193] FCALL remove_proc_entry((char const *)(& pd->name), pkt_proc) [L9195] EXPR pd->disk [L9195] FCALL del_gendisk(pd->disk) [L9196] EXPR pd->disk [L9196] EXPR (pd->disk)->queue [L9196] FCALL blk_cleanup_queue((pd->disk)->queue) [L9197] EXPR pd->disk [L9197] FCALL put_disk(pd->disk) [L9198] EXPR pd->rb_pool [L9198] FCALL mempool_destroy(pd->rb_pool) [L9199] CALL kfree((void const *)pd) [L9199] RET kfree((void const *)pd) [L9200] CALL ldv_module_put_5(& __this_module) [L9806] CALL ldv_module_put(ldv_func_arg1) [L9725] COND TRUE (unsigned long )module != (unsigned long )((struct module *)0) VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, module={18446744073709551617:0}, module={18446744073709551617:0}, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] [L9726] COND TRUE ldv_module_refcounter <= 1 [L9728] CALL ldv_blast_assert() [L9689] reach_error() VAL [__this_module={18446744073709551617:0}, class_pktcdvd={-18446744073709551615:0}, class_pktcdvd_attrs={178:0}, clv_to_speed={180:0}, ctl_mutex={163:0}, debug_fops={179:0}, hs_clv_to_speed={181:0}, kobj_pkt_attr_st1={164:0}, kobj_pkt_attr_st2={165:0}, kobj_pkt_attr_st3={166:0}, kobj_pkt_attr_st4={167:0}, kobj_pkt_attr_st5={168:0}, kobj_pkt_attr_st6={169:0}, kobj_pkt_attr_wq1={171:0}, kobj_pkt_attr_wq2={172:0}, kobj_pkt_attr_wq3={173:0}, kobj_pkt_attrs_stat={170:0}, kobj_pkt_attrs_wqueue={174:0}, kobj_pkt_ops={175:0}, kobj_pkt_type_stat={176:0}, kobj_pkt_type_wqueue={177:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, pkt_ctl_fops={185:0}, pkt_debugfs_root={0:0}, pkt_devs={162:0}, pkt_misc={186:0}, pkt_proc={0:0}, pkt_proc_fops={183:0}, pktcdvd_mutex={161:0}, pktcdvd_ops={184:0}, pktdev_major=0, psd_pool={-17293822569102708736:0}, us_clv_to_speed={182:0}, write_congestion_off=9000, write_congestion_on=10000] - UnprovableResult [Line: 9689]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 9689]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 9689]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 9689]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 1991 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 467.6s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 311.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207790 SdHoareTripleChecker+Valid, 253.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207763 mSDsluCounter, 690089 SdHoareTripleChecker+Invalid, 211.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238790 IncrementalHoareTripleChecker+Unchecked, 609942 mSDsCounter, 2686 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87771 IncrementalHoareTripleChecker+Invalid, 329247 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2686 mSolverCounterUnsat, 80147 mSDtfsCounter, 87771 mSolverCounterSat, 1.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1795 GetRequests, 1169 SyntacticMatches, 20 SemanticMatches, 606 ConstructedPredicates, 61 IntricatePredicates, 2 DeprecatedPredicates, 10024 ImplicationChecksByTransitivity, 58.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9364occurred in iteration=19, InterpolantAutomatonStates: 376, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 201564 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 18.0s SatisfiabilityAnalysisTime, 119.1s InterpolantComputationTime, 2436 NumberOfCodeBlocks, 2436 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2930 ConstructedInterpolants, 469 QuantifiedInterpolants, 61948 SizeOfPredicates, 150 NumberOfNonLiveVariables, 18711 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 0/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-22 20:58:11,342 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-22 20:58:11,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 20:58:13,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 20:58:13,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 20:58:13,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 20:58:13,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 20:58:13,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 20:58:13,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 20:58:13,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 20:58:13,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 20:58:13,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 20:58:13,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 20:58:13,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 20:58:13,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 20:58:13,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 20:58:13,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 20:58:13,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 20:58:13,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 20:58:13,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 20:58:13,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 20:58:13,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 20:58:13,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 20:58:13,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 20:58:13,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 20:58:13,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 20:58:13,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 20:58:13,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 20:58:13,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 20:58:13,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 20:58:13,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 20:58:13,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 20:58:13,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 20:58:13,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 20:58:13,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 20:58:13,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 20:58:13,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 20:58:13,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 20:58:13,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 20:58:13,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 20:58:13,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 20:58:13,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 20:58:13,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 20:58:13,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 20:58:13,373 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 20:58:13,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 20:58:13,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 20:58:13,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 20:58:13,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 20:58:13,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 20:58:13,376 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 20:58:13,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 20:58:13,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 20:58:13,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 20:58:13,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 20:58:13,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 20:58:13,378 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 20:58:13,378 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 20:58:13,378 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 20:58:13,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 20:58:13,379 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 20:58:13,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 20:58:13,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 20:58:13,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 20:58:13,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 20:58:13,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:58:13,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 20:58:13,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 20:58:13,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 20:58:13,388 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 20:58:13,388 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 20:58:13,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 20:58:13,389 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 20:58:13,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 20:58:13,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 20:58:13,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 20:58:13,389 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb [2021-11-22 20:58:13,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 20:58:13,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 20:58:13,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 20:58:13,708 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 20:58:13,709 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 20:58:13,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-11-22 20:58:13,766 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58b0d8a0/850a30c1322f49ebac6c6e18f7cf1f1d/FLAGe8c7ac08a [2021-11-22 20:58:14,568 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 20:58:14,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-11-22 20:58:14,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58b0d8a0/850a30c1322f49ebac6c6e18f7cf1f1d/FLAGe8c7ac08a [2021-11-22 20:58:14,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58b0d8a0/850a30c1322f49ebac6c6e18f7cf1f1d [2021-11-22 20:58:14,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 20:58:14,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 20:58:14,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 20:58:14,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 20:58:14,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 20:58:14,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:14" (1/1) ... [2021-11-22 20:58:14,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb1bc8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:14, skipping insertion in model container [2021-11-22 20:58:14,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:14" (1/1) ... [2021-11-22 20:58:14,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 20:58:14,930 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:58:16,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2021-11-22 20:58:17,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:58:17,041 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 20:58:17,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 20:58:17,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2021-11-22 20:58:17,404 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:58:17,424 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 20:58:17,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2021-11-22 20:58:17,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 20:58:17,941 INFO L208 MainTranslator]: Completed translation [2021-11-22 20:58:17,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17 WrapperNode [2021-11-22 20:58:17,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 20:58:17,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 20:58:17,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 20:58:17,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 20:58:17,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,342 INFO L137 Inliner]: procedures = 323, calls = 2428, calls flagged for inlining = 573, calls inlined = 887, statements flattened = 12780 [2021-11-22 20:58:18,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 20:58:18,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 20:58:18,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 20:58:18,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 20:58:18,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 20:58:18,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 20:58:18,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 20:58:18,826 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 20:58:18,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (1/1) ... [2021-11-22 20:58:18,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 20:58:18,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 20:58:18,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 20:58:18,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 20:58:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 20:58:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 20:58:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-22 20:58:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-22 20:58:18,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-22 20:58:18,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-22 20:58:18,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 20:58:18,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 20:58:18,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 20:58:18,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-22 20:58:18,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 20:58:18,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_check_events [2021-11-22 20:58:18,969 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_check_events [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~C_UINT~TO~C_UINT [2021-11-22 20:58:18,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~C_UINT~TO~C_UINT [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-22 20:58:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 20:58:18,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 20:58:19,579 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 20:58:19,580 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 20:58:19,720 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,759 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,765 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,766 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,782 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,786 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,857 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,860 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 20:58:19,894 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-22 21:00:58,077 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1046: assume false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1047: assume !false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##503: assume !false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##502: assume false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##65: assume false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##66: assume !false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##589: assume false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##590: assume !false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##627: assume !false; [2021-11-22 21:00:58,078 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##626: assume false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1663: assume false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1664: assume !false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1409: assume false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1410: assume !false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1462: assume false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##1463: assume !false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##958: assume !false; [2021-11-22 21:00:58,079 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##957: assume false; [2021-11-22 21:00:58,080 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 21:00:58,104 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 21:00:58,105 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-22 21:00:58,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:00:58 BoogieIcfgContainer [2021-11-22 21:00:58,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 21:00:58,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 21:00:58,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 21:00:58,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 21:00:58,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:58:14" (1/3) ... [2021-11-22 21:00:58,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124a70a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:00:58, skipping insertion in model container [2021-11-22 21:00:58,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:17" (2/3) ... [2021-11-22 21:00:58,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124a70a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:00:58, skipping insertion in model container [2021-11-22 21:00:58,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:00:58" (3/3) ... [2021-11-22 21:00:58,116 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2021-11-22 21:00:58,120 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 21:00:58,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 21:00:58,170 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 21:00:58,177 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 21:00:58,177 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 21:00:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 1991 states, 1980 states have (on average 1.3853535353535353) internal successors, (2743), 1985 states have internal predecessors, (2743), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-22 21:00:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-22 21:00:58,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:00:58,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:00:58,227 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:00:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:00:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1629111837, now seen corresponding path program 1 times [2021-11-22 21:00:58,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:00:58,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750356355] [2021-11-22 21:00:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:00:58,251 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:00:58,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:00:58,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:00:58,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-22 21:00:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:00:59,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:00:59,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:00:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:00:59,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:01:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:00,027 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:01:00,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750356355] [2021-11-22 21:01:00,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750356355] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:01:00,028 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:01:00,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 21:01:00,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288803866] [2021-11-22 21:01:00,030 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:01:00,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:01:00,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:01:00,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:01:00,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:01:00,063 INFO L87 Difference]: Start difference. First operand has 1991 states, 1980 states have (on average 1.3853535353535353) internal successors, (2743), 1985 states have internal predecessors, (2743), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:01:00,439 INFO L93 Difference]: Finished difference Result 5885 states and 8139 transitions. [2021-11-22 21:01:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:01:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-22 21:01:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:01:00,477 INFO L225 Difference]: With dead ends: 5885 [2021-11-22 21:01:00,478 INFO L226 Difference]: Without dead ends: 3872 [2021-11-22 21:01:00,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:01:00,499 INFO L933 BasicCegarLoop]: 2749 mSDtfsCounter, 2651 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 5329 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:01:00,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2651 Valid, 5329 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:01:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3872 states. [2021-11-22 21:01:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3872 to 3864. [2021-11-22 21:01:00,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3849 states have (on average 1.3507404520654716) internal successors, (5199), 3853 states have internal predecessors, (5199), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 21:01:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5211 transitions. [2021-11-22 21:01:00,715 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5211 transitions. Word has length 14 [2021-11-22 21:01:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:01:00,715 INFO L470 AbstractCegarLoop]: Abstraction has 3864 states and 5211 transitions. [2021-11-22 21:01:00,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5211 transitions. [2021-11-22 21:01:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-22 21:01:00,725 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:01:00,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:01:00,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 21:01:00,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:01:00,940 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:01:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:01:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash -771767355, now seen corresponding path program 1 times [2021-11-22 21:01:00,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:01:00,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049917110] [2021-11-22 21:01:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:01:00,943 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:01:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:01:00,945 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:01:00,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-22 21:01:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:01:02,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 1478 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 21:01:02,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:01:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:03,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:01:03,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:03,321 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:01:03,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049917110] [2021-11-22 21:01:03,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049917110] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:01:03,321 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:01:03,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-22 21:01:03,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980854101] [2021-11-22 21:01:03,321 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:01:03,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:01:03,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:01:03,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:01:03,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:01:03,323 INFO L87 Difference]: Start difference. First operand 3864 states and 5211 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:01:03,513 INFO L93 Difference]: Finished difference Result 7669 states and 10349 transitions. [2021-11-22 21:01:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:01:03,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-22 21:01:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:01:03,529 INFO L225 Difference]: With dead ends: 7669 [2021-11-22 21:01:03,529 INFO L226 Difference]: Without dead ends: 3864 [2021-11-22 21:01:03,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:01:03,537 INFO L933 BasicCegarLoop]: 2659 mSDtfsCounter, 2 mSDsluCounter, 7969 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10628 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:01:03,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 10628 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:01:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2021-11-22 21:01:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3864. [2021-11-22 21:01:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3849 states have (on average 1.350480644323201) internal successors, (5198), 3853 states have internal predecessors, (5198), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 21:01:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5210 transitions. [2021-11-22 21:01:03,765 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5210 transitions. Word has length 65 [2021-11-22 21:01:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:01:03,766 INFO L470 AbstractCegarLoop]: Abstraction has 3864 states and 5210 transitions. [2021-11-22 21:01:03,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5210 transitions. [2021-11-22 21:01:03,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-22 21:01:03,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:01:03,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:01:03,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-22 21:01:03,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:01:03,999 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:01:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:01:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash -998593620, now seen corresponding path program 1 times [2021-11-22 21:01:04,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:01:04,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532875898] [2021-11-22 21:01:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:01:04,003 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:01:04,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:01:04,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:01:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-22 21:01:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:01:05,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 1490 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-22 21:01:05,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:01:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:06,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:01:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:06,713 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:01:06,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532875898] [2021-11-22 21:01:06,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532875898] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:01:06,713 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:01:06,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-22 21:01:06,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624591641] [2021-11-22 21:01:06,714 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:01:06,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-22 21:01:06,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:01:06,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-22 21:01:06,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-22 21:01:06,715 INFO L87 Difference]: Start difference. First operand 3864 states and 5210 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:09,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:01:11,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:01:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:01:17,582 INFO L93 Difference]: Finished difference Result 18014 states and 24443 transitions. [2021-11-22 21:01:17,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-22 21:01:17,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-22 21:01:17,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:01:17,643 INFO L225 Difference]: With dead ends: 18014 [2021-11-22 21:01:17,643 INFO L226 Difference]: Without dead ends: 14158 [2021-11-22 21:01:17,659 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-22 21:01:17,660 INFO L933 BasicCegarLoop]: 5176 mSDtfsCounter, 12131 mSDsluCounter, 26331 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12132 SdHoareTripleChecker+Valid, 31507 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2021-11-22 21:01:17,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12132 Valid, 31507 Invalid, 1195 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [95 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2021-11-22 21:01:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2021-11-22 21:01:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 3864. [2021-11-22 21:01:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3864 states, 3849 states have (on average 1.35022083658093) internal successors, (5197), 3853 states have internal predecessors, (5197), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 21:01:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 5209 transitions. [2021-11-22 21:01:17,896 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 5209 transitions. Word has length 69 [2021-11-22 21:01:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:01:17,896 INFO L470 AbstractCegarLoop]: Abstraction has 3864 states and 5209 transitions. [2021-11-22 21:01:17,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 5209 transitions. [2021-11-22 21:01:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-22 21:01:17,899 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:01:17,900 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:01:17,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-22 21:01:18,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:01:18,123 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:01:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:01:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 128650393, now seen corresponding path program 1 times [2021-11-22 21:01:18,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:01:18,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087417221] [2021-11-22 21:01:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:01:18,127 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:01:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:01:18,131 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:01:18,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-22 21:01:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:01:19,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 1508 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 21:01:19,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:01:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:19,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:01:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:20,312 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:01:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087417221] [2021-11-22 21:01:20,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087417221] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:01:20,313 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:01:20,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-22 21:01:20,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868543565] [2021-11-22 21:01:20,313 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:01:20,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 21:01:20,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:01:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 21:01:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 21:01:20,314 INFO L87 Difference]: Start difference. First operand 3864 states and 5209 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:01:20,635 INFO L93 Difference]: Finished difference Result 7673 states and 10351 transitions. [2021-11-22 21:01:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 21:01:20,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-22 21:01:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:01:20,649 INFO L225 Difference]: With dead ends: 7673 [2021-11-22 21:01:20,650 INFO L226 Difference]: Without dead ends: 3852 [2021-11-22 21:01:20,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-22 21:01:20,658 INFO L933 BasicCegarLoop]: 2656 mSDtfsCounter, 21 mSDsluCounter, 10608 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 13264 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:01:20,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 13264 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:01:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2021-11-22 21:01:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3852. [2021-11-22 21:01:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3837 states have (on average 1.350013031013813) internal successors, (5180), 3841 states have internal predecessors, (5180), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 21:01:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 5192 transitions. [2021-11-22 21:01:20,792 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 5192 transitions. Word has length 72 [2021-11-22 21:01:20,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:01:20,793 INFO L470 AbstractCegarLoop]: Abstraction has 3852 states and 5192 transitions. [2021-11-22 21:01:20,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 5192 transitions. [2021-11-22 21:01:20,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-22 21:01:20,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:01:20,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:01:20,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-22 21:01:21,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:01:21,019 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:01:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:01:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1914168499, now seen corresponding path program 1 times [2021-11-22 21:01:21,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:01:21,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805221665] [2021-11-22 21:01:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:01:21,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:01:21,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:01:21,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:01:21,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-22 21:01:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:01:22,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 21:01:22,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:01:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:22,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:01:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:23,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:01:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805221665] [2021-11-22 21:01:23,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805221665] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:01:23,252 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:01:23,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-22 21:01:23,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249439735] [2021-11-22 21:01:23,253 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:01:23,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 21:01:23,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:01:23,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 21:01:23,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 21:01:23,254 INFO L87 Difference]: Start difference. First operand 3852 states and 5192 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:01:23,458 INFO L93 Difference]: Finished difference Result 7676 states and 10352 transitions. [2021-11-22 21:01:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:01:23,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-22 21:01:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:01:23,491 INFO L225 Difference]: With dead ends: 7676 [2021-11-22 21:01:23,491 INFO L226 Difference]: Without dead ends: 3852 [2021-11-22 21:01:23,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:01:23,502 INFO L933 BasicCegarLoop]: 2640 mSDtfsCounter, 1 mSDsluCounter, 10538 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13178 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 21:01:23,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 13178 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 21:01:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2021-11-22 21:01:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3852. [2021-11-22 21:01:23,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3837 states have (on average 1.3497524107375554) internal successors, (5179), 3841 states have internal predecessors, (5179), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 21:01:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 5191 transitions. [2021-11-22 21:01:23,640 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 5191 transitions. Word has length 91 [2021-11-22 21:01:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:01:23,641 INFO L470 AbstractCegarLoop]: Abstraction has 3852 states and 5191 transitions. [2021-11-22 21:01:23,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 5191 transitions. [2021-11-22 21:01:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-22 21:01:23,644 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:01:23,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:01:23,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-22 21:01:23,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:01:23,868 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:01:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:01:23,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1748247222, now seen corresponding path program 1 times [2021-11-22 21:01:23,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:01:23,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043153955] [2021-11-22 21:01:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:01:23,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:01:23,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:01:23,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:01:23,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-22 21:01:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:01:25,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 1637 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 21:01:25,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:01:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:26,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:01:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:01:26,750 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:01:26,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043153955] [2021-11-22 21:01:26,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043153955] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:01:26,750 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:01:26,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-22 21:01:26,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344893982] [2021-11-22 21:01:26,750 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:01:26,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 21:01:26,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:01:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 21:01:26,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-22 21:01:26,752 INFO L87 Difference]: Start difference. First operand 3852 states and 5191 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:01:31,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:01:34,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:01:35,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:01:46,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:01:48,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:01:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:01:59,344 INFO L93 Difference]: Finished difference Result 148716 states and 204742 transitions. [2021-11-22 21:01:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-22 21:01:59,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-22 21:01:59,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:01:59,843 INFO L225 Difference]: With dead ends: 148716 [2021-11-22 21:01:59,843 INFO L226 Difference]: Without dead ends: 144884 [2021-11-22 21:01:59,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=590, Invalid=2166, Unknown=0, NotChecked=0, Total=2756 [2021-11-22 21:01:59,909 INFO L933 BasicCegarLoop]: 8953 mSDtfsCounter, 73407 mSDsluCounter, 83928 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 468 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73411 SdHoareTripleChecker+Valid, 92881 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2021-11-22 21:01:59,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73411 Valid, 92881 Invalid, 3218 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [468 Valid, 2748 Invalid, 2 Unknown, 0 Unchecked, 22.5s Time] [2021-11-22 21:02:00,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144884 states. [2021-11-22 21:02:01,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144884 to 7642. [2021-11-22 21:02:01,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7642 states, 7617 states have (on average 1.3501378495470657) internal successors, (10284), 7621 states have internal predecessors, (10284), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-22 21:02:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7642 states to 7642 states and 10308 transitions. [2021-11-22 21:02:01,605 INFO L78 Accepts]: Start accepts. Automaton has 7642 states and 10308 transitions. Word has length 93 [2021-11-22 21:02:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:02:01,605 INFO L470 AbstractCegarLoop]: Abstraction has 7642 states and 10308 transitions. [2021-11-22 21:02:01,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:01,605 INFO L276 IsEmpty]: Start isEmpty. Operand 7642 states and 10308 transitions. [2021-11-22 21:02:01,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-22 21:02:01,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:02:01,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:02:01,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-22 21:02:01,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:02:01,823 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:02:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:02:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1048964680, now seen corresponding path program 1 times [2021-11-22 21:02:01,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:02:01,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477495249] [2021-11-22 21:02:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:02:01,826 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:02:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:02:01,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:02:01,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-22 21:02:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:02:03,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-22 21:02:03,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:02:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:03,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:02:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:04,353 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:02:04,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477495249] [2021-11-22 21:02:04,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477495249] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:02:04,354 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:02:04,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-22 21:02:04,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265157560] [2021-11-22 21:02:04,354 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:02:04,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 21:02:04,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:02:04,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 21:02:04,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-22 21:02:04,355 INFO L87 Difference]: Start difference. First operand 7642 states and 10308 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:08,237 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 21:02:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:02:17,449 INFO L93 Difference]: Finished difference Result 76500 states and 104298 transitions. [2021-11-22 21:02:17,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 21:02:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-11-22 21:02:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:02:17,584 INFO L225 Difference]: With dead ends: 76500 [2021-11-22 21:02:17,584 INFO L226 Difference]: Without dead ends: 68906 [2021-11-22 21:02:17,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2021-11-22 21:02:17,621 INFO L933 BasicCegarLoop]: 2603 mSDtfsCounter, 37286 mSDsluCounter, 22657 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37289 SdHoareTripleChecker+Valid, 25260 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:02:17,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37289 Valid, 25260 Invalid, 1223 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [391 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2021-11-22 21:02:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68906 states. [2021-11-22 21:02:18,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68906 to 7650. [2021-11-22 21:02:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7650 states, 7625 states have (on average 1.3497704918032787) internal successors, (10292), 7629 states have internal predecessors, (10292), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-22 21:02:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 10316 transitions. [2021-11-22 21:02:18,540 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 10316 transitions. Word has length 96 [2021-11-22 21:02:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:02:18,541 INFO L470 AbstractCegarLoop]: Abstraction has 7650 states and 10316 transitions. [2021-11-22 21:02:18,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 10316 transitions. [2021-11-22 21:02:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-22 21:02:18,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:02:18,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:02:18,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-22 21:02:18,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:02:18,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:02:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:02:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1466361286, now seen corresponding path program 1 times [2021-11-22 21:02:18,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:02:18,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688105063] [2021-11-22 21:02:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:02:18,754 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:02:18,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:02:18,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:02:18,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-22 21:02:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:02:20,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:02:20,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:02:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:20,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:02:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:20,935 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:02:20,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688105063] [2021-11-22 21:02:20,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688105063] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:02:20,935 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:02:20,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-22 21:02:20,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577500955] [2021-11-22 21:02:20,935 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:02:20,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 21:02:20,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:02:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 21:02:20,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:02:20,936 INFO L87 Difference]: Start difference. First operand 7650 states and 10316 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:02:22,915 INFO L93 Difference]: Finished difference Result 30206 states and 40798 transitions. [2021-11-22 21:02:22,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 21:02:22,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-11-22 21:02:22,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:02:22,981 INFO L225 Difference]: With dead ends: 30206 [2021-11-22 21:02:22,982 INFO L226 Difference]: Without dead ends: 22634 [2021-11-22 21:02:23,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 21:02:23,015 INFO L933 BasicCegarLoop]: 5080 mSDtfsCounter, 7664 mSDsluCounter, 5161 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7666 SdHoareTripleChecker+Valid, 10241 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:02:23,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7666 Valid, 10241 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:02:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22634 states. [2021-11-22 21:02:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22634 to 7706. [2021-11-22 21:02:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7706 states, 7681 states have (on average 1.3493034761098814) internal successors, (10364), 7685 states have internal predecessors, (10364), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-22 21:02:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7706 states to 7706 states and 10388 transitions. [2021-11-22 21:02:23,993 INFO L78 Accepts]: Start accepts. Automaton has 7706 states and 10388 transitions. Word has length 96 [2021-11-22 21:02:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:02:23,994 INFO L470 AbstractCegarLoop]: Abstraction has 7706 states and 10388 transitions. [2021-11-22 21:02:23,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 7706 states and 10388 transitions. [2021-11-22 21:02:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-22 21:02:23,998 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:02:23,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:02:24,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-22 21:02:24,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:02:24,212 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:02:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:02:24,212 INFO L85 PathProgramCache]: Analyzing trace with hash 410186623, now seen corresponding path program 1 times [2021-11-22 21:02:24,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:02:24,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985621687] [2021-11-22 21:02:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:02:24,214 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:02:24,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:02:24,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:02:24,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-22 21:02:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:02:26,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 21:02:26,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:02:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:26,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:02:27,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:27,078 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:02:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985621687] [2021-11-22 21:02:27,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985621687] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:02:27,079 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:02:27,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 21:02:27,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291062224] [2021-11-22 21:02:27,079 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:02:27,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 21:02:27,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:02:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 21:02:27,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:02:27,081 INFO L87 Difference]: Start difference. First operand 7706 states and 10388 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:02:27,961 INFO L93 Difference]: Finished difference Result 11537 states and 15543 transitions. [2021-11-22 21:02:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 21:02:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-22 21:02:27,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:02:27,972 INFO L225 Difference]: With dead ends: 11537 [2021-11-22 21:02:27,972 INFO L226 Difference]: Without dead ends: 7719 [2021-11-22 21:02:27,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 21:02:27,981 INFO L933 BasicCegarLoop]: 2795 mSDtfsCounter, 2537 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 5407 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 21:02:27,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2537 Valid, 5407 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 21:02:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7719 states. [2021-11-22 21:02:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7719 to 7706. [2021-11-22 21:02:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7706 states, 7681 states have (on average 1.3481317536779065) internal successors, (10355), 7685 states have internal predecessors, (10355), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-11-22 21:02:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7706 states to 7706 states and 10379 transitions. [2021-11-22 21:02:28,605 INFO L78 Accepts]: Start accepts. Automaton has 7706 states and 10379 transitions. Word has length 99 [2021-11-22 21:02:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:02:28,606 INFO L470 AbstractCegarLoop]: Abstraction has 7706 states and 10379 transitions. [2021-11-22 21:02:28,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 7706 states and 10379 transitions. [2021-11-22 21:02:28,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 21:02:28,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:02:28,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:02:28,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-22 21:02:28,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:02:28,836 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:02:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:02:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1234326562, now seen corresponding path program 1 times [2021-11-22 21:02:28,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:02:28,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727699188] [2021-11-22 21:02:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:02:28,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:02:28,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:02:28,838 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:02:28,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-22 21:02:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:02:30,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 1666 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 21:02:30,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:02:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:30,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:02:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:30,935 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 21:02:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727699188] [2021-11-22 21:02:30,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727699188] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 21:02:30,935 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 21:02:30,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-22 21:02:30,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019716351] [2021-11-22 21:02:30,935 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 21:02:30,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 21:02:30,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 21:02:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 21:02:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-22 21:02:30,936 INFO L87 Difference]: Start difference. First operand 7706 states and 10379 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 21:02:31,229 INFO L93 Difference]: Finished difference Result 7727 states and 10395 transitions. [2021-11-22 21:02:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 21:02:31,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-11-22 21:02:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 21:02:31,235 INFO L225 Difference]: With dead ends: 7727 [2021-11-22 21:02:31,235 INFO L226 Difference]: Without dead ends: 3883 [2021-11-22 21:02:31,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 21:02:31,240 INFO L933 BasicCegarLoop]: 2633 mSDtfsCounter, 3 mSDsluCounter, 7884 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10517 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 21:02:31,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 10517 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 21:02:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2021-11-22 21:02:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3883. [2021-11-22 21:02:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3868 states have (on average 1.3461737331954498) internal successors, (5207), 3872 states have internal predecessors, (5207), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-22 21:02:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5219 transitions. [2021-11-22 21:02:31,434 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5219 transitions. Word has length 100 [2021-11-22 21:02:31,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 21:02:31,434 INFO L470 AbstractCegarLoop]: Abstraction has 3883 states and 5219 transitions. [2021-11-22 21:02:31,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 21:02:31,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5219 transitions. [2021-11-22 21:02:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-22 21:02:31,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 21:02:31,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 21:02:31,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-22 21:02:31,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 21:02:31,637 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 21:02:31,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 21:02:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1653866999, now seen corresponding path program 1 times [2021-11-22 21:02:31,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 21:02:31,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674127583] [2021-11-22 21:02:31,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 21:02:31,639 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 21:02:31,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 21:02:31,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 21:02:31,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-22 21:02:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 21:02:35,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 1665 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-22 21:02:35,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 21:02:35,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-22 21:02:35,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-11-22 21:02:36,090 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-22 21:02:36,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-11-22 21:02:36,382 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-22 21:02:36,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2021-11-22 21:02:37,099 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-22 21:02:37,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2021-11-22 21:02:37,463 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-11-22 21:02:37,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 82 [2021-11-22 21:02:40,943 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 21:02:40,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 41 [2021-11-22 21:02:40,985 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 21:02:40,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2021-11-22 21:02:41,309 INFO L354 Elim1Store]: treesize reduction 20, result has 28.6 percent of original size [2021-11-22 21:02:41,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 64 [2021-11-22 21:02:42,586 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-11-22 21:02:42,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 35 [2021-11-22 21:02:43,261 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-22 21:02:43,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2021-11-22 21:02:43,311 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 21:02:43,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2021-11-22 21:02:43,362 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-22 21:02:43,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2021-11-22 21:02:44,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 21:02:44,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2021-11-22 21:02:44,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 21:02:44,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2021-11-22 21:02:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 21:02:44,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 21:02:44,862 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1))) (or (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select (store |c_#valid| |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:47,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (v_ArrVal_502 (_ BitVec 1))) (or (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:48,781 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_502 (_ BitVec 1))) (or (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:49,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_501 (_ BitVec 1))) (or (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:50,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_501 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))) (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.base| c_~class_pktcdvd~0.base v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| c_~class_pktcdvd~0.base v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0)))))) is different from false [2021-11-22 21:02:50,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_501 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kzalloc_#res#1.base| v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:50,598 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_501 (_ BitVec 1))) (or (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_kmalloc_#res#1.base| v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (not (= (_ bv0 1) (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:50,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_501 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start___kmalloc_#res#1.base| v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:51,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_501 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_#res#1.base| v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:51,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_501 (_ BitVec 1))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ldv_malloc_~p~5#1.base| v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0)))) (not (= (_ bv0 1) (bvneg (select (store (store (store |c_#valid| |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))) is different from false [2021-11-22 21:02:52,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (_ BitVec 1)) (v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_501 (_ BitVec 1)) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (bvugt |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| (_ bv1152921504606842880 64)) (not (= (_ bv0 1) (bvneg (bvneg (select (store (store (store (store |c_#valid| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| v_ArrVal_498) |c_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167|))))) (= (_ bv0 64) (let ((.cse0 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse0)))))) is different from false [2021-11-22 21:02:53,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (_ BitVec 1)) (v_ArrVal_497 (_ BitVec 1)) (|v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| (_ BitVec 64)) (v_ArrVal_500 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_499 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_504 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_503 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_16| (_ BitVec 64)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| (_ BitVec 64)) (v_ArrVal_505 (_ BitVec 1)) (|v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| (_ BitVec 64)) (v_ArrVal_502 (_ BitVec 1)) (v_ArrVal_501 (_ BitVec 1))) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_16| v_ArrVal_497))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select .cse0 |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167|)))))) (not (= (_ bv0 1) (bvadd (bvneg (bvneg v_ArrVal_497)) (_ bv1 1)))) (not (= (_ bv0 1) (bvadd (bvneg v_ArrVal_505) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_16|))) (bvugt |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| (_ bv1152921504606842880 64)) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select (store (store (store (store .cse0 |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| v_ArrVal_498) |v_ULTIMATE.start_pkt_sysfs_init_~#__key~0#1.base_16| v_ArrVal_501) |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_502) |v_ULTIMATE.start_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_59| v_ArrVal_505) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45|)))))))) (= (_ bv0 64) (let ((.cse1 (bvadd |c_~#pkt_devs~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv8 64))))) (bvadd (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| v_ArrVal_500) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_503) |c_~#pkt_devs~0.base|) .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_IS_ERR_~ptr#1.base_167| v_ArrVal_499) |v_ULTIMATE.start_pkt_ctl_ioctl_~#pkt_dev~0#1.base_45| v_ArrVal_504) |c_~#pkt_devs~0.base|) .cse1))))))) is different from false Killed by 15