./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.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 a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 16:41:39,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:41:40,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:41:40,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:41:40,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:41:40,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:41:40,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:41:40,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:41:40,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:41:40,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:41:40,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:41:40,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:41:40,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:41:40,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:41:40,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:41:40,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:41:40,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:41:40,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:41:40,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:41:40,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:41:40,068 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:41:40,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:41:40,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:41:40,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:41:40,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:41:40,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:41:40,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:41:40,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:41:40,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:41:40,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:41:40,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:41:40,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:41:40,080 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:41:40,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:41:40,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:41:40,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:41:40,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:41:40,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:41:40,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:41:40,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:41:40,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:41:40,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:41:40,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:41:40,107 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:41:40,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:41:40,107 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:41:40,108 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:41:40,108 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:41:40,109 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:41:40,109 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:41:40,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:41:40,109 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:41:40,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:41:40,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:41:40,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:41:40,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:41:40,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:41:40,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:41:40,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:41:40,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:41:40,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:41:40,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:41:40,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:41:40,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:41:40,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:41:40,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:41:40,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:41:40,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:41:40,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:41:40,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:41:40,113 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:41:40,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:41:40,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:41:40,114 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 -> a085124b4007f801fe01aa89940f8a8fd2be0f47b82fa59b5624e0bb2a9cdb0a [2022-07-12 16:41:40,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:41:40,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:41:40,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:41:40,325 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:41:40,326 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:41:40,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-12 16:41:40,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5555fbb02/1e8cab005f674170ba4a9550a8f5a302/FLAGfb1ef7db0 [2022-07-12 16:41:40,992 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:41:40,993 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-12 16:41:41,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5555fbb02/1e8cab005f674170ba4a9550a8f5a302/FLAGfb1ef7db0 [2022-07-12 16:41:41,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5555fbb02/1e8cab005f674170ba4a9550a8f5a302 [2022-07-12 16:41:41,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:41:41,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:41:41,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:41:41,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:41:41,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:41:41,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:41:41" (1/1) ... [2022-07-12 16:41:41,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d496b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:41, skipping insertion in model container [2022-07-12 16:41:41,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:41:41" (1/1) ... [2022-07-12 16:41:41,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:41:41,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:41:43,140 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-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i[338465,338478] [2022-07-12 16:41:43,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:41:43,195 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:41:43,498 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-challenges/linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i[338465,338478] [2022-07-12 16:41:43,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:41:43,646 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:41:43,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43 WrapperNode [2022-07-12 16:41:43,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:41:43,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:41:43,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:41:43,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:41:43,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:43,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:43,919 INFO L137 Inliner]: procedures = 396, calls = 1846, calls flagged for inlining = 235, calls inlined = 222, statements flattened = 5742 [2022-07-12 16:41:43,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:41:43,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:41:43,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:41:43,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:41:43,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:43,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:43,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:43,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:44,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:44,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:44,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:44,174 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:41:44,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:41:44,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:41:44,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:41:44,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (1/1) ... [2022-07-12 16:41:44,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:41:44,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:41:44,197 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) [2022-07-12 16:41:44,213 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 [2022-07-12 16:41:44,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 16:41:44,223 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 16:41:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:41:44,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:41:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-12 16:41:44,223 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-12 16:41:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 16:41:44,224 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 16:41:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_read [2022-07-12 16:41:44,224 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_read [2022-07-12 16:41:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_resume [2022-07-12 16:41:44,224 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_resume [2022-07-12 16:41:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 16:41:44,224 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 16:41:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_probe [2022-07-12 16:41:44,225 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_probe [2022-07-12 16:41:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure no_printk [2022-07-12 16:41:44,225 INFO L138 BoogieDeclarations]: Found implementation of procedure no_printk [2022-07-12 16:41:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:41:44,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:41:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-12 16:41:44,225 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-12 16:41:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-07-12 16:41:44,226 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-07-12 16:41:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure eth_validate_addr [2022-07-12 16:41:44,226 INFO L138 BoogieDeclarations]: Found implementation of procedure eth_validate_addr [2022-07-12 16:41:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:41:44,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:41:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 16:41:44,226 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 16:41:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_multicast_list [2022-07-12 16:41:44,227 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_multicast_list [2022-07-12 16:41:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_set_hw_mac_address [2022-07-12 16:41:44,227 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_set_hw_mac_address [2022-07-12 16:41:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure phy_write [2022-07-12 16:41:44,227 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_write [2022-07-12 16:41:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-12 16:41:44,227 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-12 16:41:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:41:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-07-12 16:41:44,228 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-07-12 16:41:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_drv_remove [2022-07-12 16:41:44,228 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_drv_remove [2022-07-12 16:41:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_multicast_update [2022-07-12 16:41:44,228 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_multicast_update [2022-07-12 16:41:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 16:41:44,229 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 16:41:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:41:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-07-12 16:41:44,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-07-12 16:41:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 16:41:44,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 16:41:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo [2022-07-12 16:41:44,229 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo [2022-07-12 16:41:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:41:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:41:44,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:41:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_irqhandler [2022-07-12 16:41:44,230 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_irqhandler [2022-07-12 16:41:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:41:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 16:41:44,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 16:41:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-12 16:41:44,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_clk1__more_at_exit [2022-07-12 16:41:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2022-07-12 16:41:44,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2022-07-12 16:41:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_resources [2022-07-12 16:41:44,231 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_resources [2022-07-12 16:41:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_get_rxstatus [2022-07-12 16:41:44,232 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_get_rxstatus [2022-07-12 16:41:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read [2022-07-12 16:41:44,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read [2022-07-12 16:41:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_getregslen [2022-07-12 16:41:44,232 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_getregslen [2022-07-12 16:41:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:41:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:41:44,232 INFO L130 BoogieDeclarations]: Found specification of procedure is_valid_ether_addr [2022-07-12 16:41:44,233 INFO L138 BoogieDeclarations]: Found implementation of procedure is_valid_ether_addr [2022-07-12 16:41:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:41:44,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:41:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-12 16:41:44,233 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-12 16:41:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:41:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:41:44,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:41:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-07-12 16:41:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-07-12 16:41:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:41:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:41:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mii_write [2022-07-12 16:41:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mii_write [2022-07-12 16:41:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_complete [2022-07-12 16:41:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_complete [2022-07-12 16:41:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-07-12 16:41:44,235 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-07-12 16:41:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-12 16:41:44,235 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-12 16:41:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-12 16:41:44,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-12 16:41:44,235 INFO L130 BoogieDeclarations]: Found specification of procedure iowrite32_rep [2022-07-12 16:41:44,236 INFO L138 BoogieDeclarations]: Found implementation of procedure iowrite32_rep [2022-07-12 16:41:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2022-07-12 16:41:44,236 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2022-07-12 16:41:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource_byname [2022-07-12 16:41:44,236 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource_byname [2022-07-12 16:41:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-12 16:41:44,236 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-12 16:41:44,236 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 16:41:44,236 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 16:41:44,237 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-12 16:41:44,237 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-12 16:41:44,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:41:44,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:41:44,237 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 16:41:44,237 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 16:41:44,237 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 16:41:44,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 16:41:44,238 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_get_txstatus [2022-07-12 16:41:44,238 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_get_txstatus [2022-07-12 16:41:44,238 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 16:41:44,238 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 16:41:44,238 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_free [2022-07-12 16:41:44,238 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_free [2022-07-12 16:41:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:41:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:41:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:41:44,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:41:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo [2022-07-12 16:41:44,239 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo [2022-07-12 16:41:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_open [2022-07-12 16:41:44,239 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_open [2022-07-12 16:41:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_unregister [2022-07-12 16:41:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_unregister [2022-07-12 16:41:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_get_eeprom_len [2022-07-12 16:41:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_get_eeprom_len [2022-07-12 16:41:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_rx_readfifo_shift [2022-07-12 16:41:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_rx_readfifo_shift [2022-07-12 16:41:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_suspend [2022-07-12 16:41:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_suspend [2022-07-12 16:41:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_read_mac_address [2022-07-12 16:41:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_read_mac_address [2022-07-12 16:41:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_write [2022-07-12 16:41:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_write [2022-07-12 16:41:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure phy_read [2022-07-12 16:41:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_read [2022-07-12 16:41:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 16:41:44,241 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 16:41:44,241 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 16:41:44,242 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 16:41:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2022-07-12 16:41:44,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2022-07-12 16:41:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write [2022-07-12 16:41:44,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write [2022-07-12 16:41:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:41:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-12 16:41:44,242 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-12 16:41:44,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:41:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_write [2022-07-12 16:41:44,243 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_write [2022-07-12 16:41:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_ethtool_nwayreset [2022-07-12 16:41:44,243 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_ethtool_nwayreset [2022-07-12 16:41:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_free_resources [2022-07-12 16:41:44,243 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_free_resources [2022-07-12 16:41:44,243 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_disable_irq_chip [2022-07-12 16:41:44,243 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_disable_irq_chip [2022-07-12 16:41:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:41:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-12 16:41:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-12 16:41:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_send_cmd [2022-07-12 16:41:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_send_cmd [2022-07-12 16:41:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 16:41:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 16:41:44,244 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_adjust_link [2022-07-12 16:41:44,244 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_adjust_link [2022-07-12 16:41:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_reg_read [2022-07-12 16:41:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_reg_read [2022-07-12 16:41:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:41:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:41:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-12 16:41:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-12 16:41:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_update_txcounters [2022-07-12 16:41:44,245 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_update_txcounters [2022-07-12 16:41:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_read_shift [2022-07-12 16:41:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_read_shift [2022-07-12 16:41:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 16:41:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 16:41:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure __smsc911x_reg_write_shift [2022-07-12 16:41:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __smsc911x_reg_write_shift [2022-07-12 16:41:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 16:41:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 16:41:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 16:41:44,247 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 16:41:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 16:41:44,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 16:41:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-12 16:41:44,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-12 16:41:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_phy_enable_external [2022-07-12 16:41:44,247 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_phy_enable_external [2022-07-12 16:41:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:41:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_mac_read [2022-07-12 16:41:44,248 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_mac_read [2022-07-12 16:41:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:41:44,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:41:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-07-12 16:41:44,248 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-07-12 16:41:44,248 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 16:41:44,248 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 16:41:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_soft_reset [2022-07-12 16:41:44,249 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_soft_reset [2022-07-12 16:41:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_eeprom_enable_access [2022-07-12 16:41:44,249 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_eeprom_enable_access [2022-07-12 16:41:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure ioread32_rep [2022-07-12 16:41:44,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ioread32_rep [2022-07-12 16:41:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure spin_is_locked [2022-07-12 16:41:44,249 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_is_locked [2022-07-12 16:41:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_stop [2022-07-12 16:41:44,250 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_stop [2022-07-12 16:41:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:41:44,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:41:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure smsc911x_tx_writefifo_shift [2022-07-12 16:41:44,250 INFO L138 BoogieDeclarations]: Found implementation of procedure smsc911x_tx_writefifo_shift [2022-07-12 16:41:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-12 16:41:44,250 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-12 16:41:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-12 16:41:44,251 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-12 16:41:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:41:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-12 16:41:44,251 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-12 16:41:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-07-12 16:41:44,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-07-12 16:41:44,251 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-12 16:41:44,251 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-12 16:41:44,928 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:41:44,930 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:41:45,223 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:41:47,335 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:41:47,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:41:47,349 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 16:41:47,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:41:47 BoogieIcfgContainer [2022-07-12 16:41:47,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:41:47,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:41:47,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:41:47,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:41:47,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:41:41" (1/3) ... [2022-07-12 16:41:47,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381be2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:41:47, skipping insertion in model container [2022-07-12 16:41:47,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:41:43" (2/3) ... [2022-07-12 16:41:47,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1381be2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:41:47, skipping insertion in model container [2022-07-12 16:41:47,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:41:47" (3/3) ... [2022-07-12 16:41:47,359 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_linux-drivers-clk1_drivers-net-ethernet-smsc-smsc911x.cil.i [2022-07-12 16:41:47,370 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:41:47,370 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 16:41:47,438 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:41:47,443 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@39978aae, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@32b079d8 [2022-07-12 16:41:47,443 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 16:41:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 1658 states have (on average 1.3299155609167672) internal successors, (2205), 1711 states have internal predecessors, (2205), 691 states have call successors, (691), 108 states have call predecessors, (691), 107 states have return successors, (683), 670 states have call predecessors, (683), 683 states have call successors, (683) [2022-07-12 16:41:47,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 16:41:47,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:41:47,471 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-12 16:41:47,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:41:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:41:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1843472669, now seen corresponding path program 1 times [2022-07-12 16:41:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:41:47,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538836658] [2022-07-12 16:41:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:41:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:41:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:47,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:41:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:47,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:41:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:47,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:41:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:47,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 16:41:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:47,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:41:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 16:41:47,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:41:47,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538836658] [2022-07-12 16:41:47,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538836658] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:41:47,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:41:47,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 16:41:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368200303] [2022-07-12 16:41:47,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:41:47,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 16:41:47,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:41:48,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 16:41:48,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 16:41:48,020 INFO L87 Difference]: Start difference. First operand has 2456 states, 1658 states have (on average 1.3299155609167672) internal successors, (2205), 1711 states have internal predecessors, (2205), 691 states have call successors, (691), 108 states have call predecessors, (691), 107 states have return successors, (683), 670 states have call predecessors, (683), 683 states have call successors, (683) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 16:41:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:41:48,332 INFO L93 Difference]: Finished difference Result 4885 states and 7351 transitions. [2022-07-12 16:41:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 16:41:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-12 16:41:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:41:48,369 INFO L225 Difference]: With dead ends: 4885 [2022-07-12 16:41:48,369 INFO L226 Difference]: Without dead ends: 2436 [2022-07-12 16:41:48,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:41:48,398 INFO L413 NwaCegarLoop]: 3426 mSDtfsCounter, 3415 mSDsluCounter, 6849 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3417 SdHoareTripleChecker+Valid, 10275 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:41:48,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3417 Valid, 10275 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:41:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-07-12 16:41:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2022-07-12 16:41:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1648 states have (on average 1.2439320388349515) internal successors, (2050), 1694 states have internal predecessors, (2050), 681 states have call successors, (681), 108 states have call predecessors, (681), 106 states have return successors, (678), 665 states have call predecessors, (678), 678 states have call successors, (678) [2022-07-12 16:41:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 3409 transitions. [2022-07-12 16:41:48,566 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 3409 transitions. Word has length 48 [2022-07-12 16:41:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:41:48,568 INFO L495 AbstractCegarLoop]: Abstraction has 2436 states and 3409 transitions. [2022-07-12 16:41:48,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 16:41:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 3409 transitions. [2022-07-12 16:41:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 16:41:48,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:41:48,570 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-12 16:41:48,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:41:48,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:41:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:41:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2135049724, now seen corresponding path program 1 times [2022-07-12 16:41:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:41:48,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235709513] [2022-07-12 16:41:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:41:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:41:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:41:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:41:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:41:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 16:41:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:41:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:41:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 16:41:48,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:41:48,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235709513] [2022-07-12 16:41:48,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235709513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:41:48,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:41:48,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 16:41:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721870380] [2022-07-12 16:41:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:41:48,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 16:41:48,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:41:48,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 16:41:48,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 16:41:48,756 INFO L87 Difference]: Start difference. First operand 2436 states and 3409 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 16:41:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:41:48,961 INFO L93 Difference]: Finished difference Result 4853 states and 6839 transitions. [2022-07-12 16:41:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:41:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-07-12 16:41:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:41:48,995 INFO L225 Difference]: With dead ends: 4853 [2022-07-12 16:41:48,996 INFO L226 Difference]: Without dead ends: 4754 [2022-07-12 16:41:49,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:41:49,001 INFO L413 NwaCegarLoop]: 5147 mSDtfsCounter, 3411 mSDsluCounter, 13688 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3411 SdHoareTripleChecker+Valid, 18835 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:41:49,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3411 Valid, 18835 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:41:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2022-07-12 16:41:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4754. [2022-07-12 16:41:49,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4754 states, 3219 states have (on average 1.2454178316247282) internal successors, (4009), 3305 states have internal predecessors, (4009), 1323 states have call successors, (1323), 213 states have call predecessors, (1323), 211 states have return successors, (1368), 1296 states have call predecessors, (1368), 1320 states have call successors, (1368) [2022-07-12 16:41:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4754 states to 4754 states and 6700 transitions. [2022-07-12 16:41:49,220 INFO L78 Accepts]: Start accepts. Automaton has 4754 states and 6700 transitions. Word has length 53 [2022-07-12 16:41:49,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:41:49,221 INFO L495 AbstractCegarLoop]: Abstraction has 4754 states and 6700 transitions. [2022-07-12 16:41:49,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 16:41:49,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4754 states and 6700 transitions. [2022-07-12 16:41:49,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-12 16:41:49,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:41:49,239 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:41:49,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:41:49,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:41:49,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:41:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash 970042127, now seen corresponding path program 1 times [2022-07-12 16:41:49,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:41:49,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916009900] [2022-07-12 16:41:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:41:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:41:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:41:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:41:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:41:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:41:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:41:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:41:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:41:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:41:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:41:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:41:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:41:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:41:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:41:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:41:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:41:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:41:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 16:41:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 16:41:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:41:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:41:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:41:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:41:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:41:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:41:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 16:41:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 16:41:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:41:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 16:41:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 16:41:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 16:41:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 16:41:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:41:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:41:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:41:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-12 16:41:50,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 16:41:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:41:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 16:41:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-12 16:41:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-12 16:41:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-12 16:41:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-12 16:41:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-12 16:41:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-12 16:41:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:41:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-12 16:41:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-12 16:41:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-12 16:41:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:41:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2022-07-12 16:41:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:41:50,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916009900] [2022-07-12 16:41:50,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916009900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:41:50,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:41:50,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 16:41:50,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264286823] [2022-07-12 16:41:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:41:50,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 16:41:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:41:50,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 16:41:50,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:41:50,356 INFO L87 Difference]: Start difference. First operand 4754 states and 6700 transitions. Second operand has 12 states, 12 states have (on average 13.5) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (57), 8 states have call predecessors, (57), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2022-07-12 16:42:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:42:03,602 INFO L93 Difference]: Finished difference Result 12573 states and 18366 transitions. [2022-07-12 16:42:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 16:42:03,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (57), 8 states have call predecessors, (57), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 423 [2022-07-12 16:42:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:42:03,670 INFO L225 Difference]: With dead ends: 12573 [2022-07-12 16:42:03,670 INFO L226 Difference]: Without dead ends: 7834 [2022-07-12 16:42:03,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-12 16:42:03,698 INFO L413 NwaCegarLoop]: 3492 mSDtfsCounter, 5390 mSDsluCounter, 13292 mSDsCounter, 0 mSdLazyCounter, 12675 mSolverCounterSat, 3521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6063 SdHoareTripleChecker+Valid, 16784 SdHoareTripleChecker+Invalid, 16196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3521 IncrementalHoareTripleChecker+Valid, 12675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:42:03,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6063 Valid, 16784 Invalid, 16196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3521 Valid, 12675 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-07-12 16:42:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2022-07-12 16:42:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 5504. [2022-07-12 16:42:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5504 states, 3743 states have (on average 1.2492652952177399) internal successors, (4676), 3844 states have internal predecessors, (4676), 1543 states have call successors, (1543), 213 states have call predecessors, (1543), 217 states have return successors, (1637), 1515 states have call predecessors, (1637), 1540 states have call successors, (1637) [2022-07-12 16:42:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5504 states to 5504 states and 7856 transitions. [2022-07-12 16:42:04,092 INFO L78 Accepts]: Start accepts. Automaton has 5504 states and 7856 transitions. Word has length 423 [2022-07-12 16:42:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:42:04,093 INFO L495 AbstractCegarLoop]: Abstraction has 5504 states and 7856 transitions. [2022-07-12 16:42:04,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.5) internal successors, (162), 6 states have internal predecessors, (162), 2 states have call successors, (57), 8 states have call predecessors, (57), 2 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2022-07-12 16:42:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 5504 states and 7856 transitions. [2022-07-12 16:42:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-12 16:42:04,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:42:04,106 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:42:04,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:42:04,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:42:04,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:42:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1308329677, now seen corresponding path program 1 times [2022-07-12 16:42:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:42:04,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587273754] [2022-07-12 16:42:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:04,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:42:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:42:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:42:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:42:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:42:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:42:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:42:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:42:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:42:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:42:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:42:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 16:42:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 16:42:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:42:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:42:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:42:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 16:42:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 16:42:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:42:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 16:42:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 16:42:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 16:42:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 16:42:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:42:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-12 16:42:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 16:42:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:42:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 16:42:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-12 16:42:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-12 16:42:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-12 16:42:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-12 16:42:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-12 16:42:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-12 16:42:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-12 16:42:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-12 16:42:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:05,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-12 16:42:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2022-07-12 16:42:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:42:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587273754] [2022-07-12 16:42:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587273754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:42:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697931068] [2022-07-12 16:42:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:42:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:42:05,012 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) [2022-07-12 16:42:05,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 16:42:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:06,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 3586 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 16:42:06,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:42:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2022-07-12 16:42:06,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:42:06,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697931068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:42:06,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:42:06,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-12 16:42:06,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051929388] [2022-07-12 16:42:06,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:42:06,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 16:42:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:42:06,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 16:42:06,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 16:42:06,230 INFO L87 Difference]: Start difference. First operand 5504 states and 7856 transitions. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 3 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2022-07-12 16:42:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:42:06,694 INFO L93 Difference]: Finished difference Result 11049 states and 15862 transitions. [2022-07-12 16:42:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 16:42:06,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 3 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) Word has length 423 [2022-07-12 16:42:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:42:06,749 INFO L225 Difference]: With dead ends: 11049 [2022-07-12 16:42:06,750 INFO L226 Difference]: Without dead ends: 5560 [2022-07-12 16:42:06,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-07-12 16:42:06,792 INFO L413 NwaCegarLoop]: 3426 mSDtfsCounter, 39 mSDsluCounter, 10172 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 13598 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:42:06,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 13598 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 16:42:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2022-07-12 16:42:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 5541. [2022-07-12 16:42:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 3770 states have (on average 1.2480106100795756) internal successors, (4705), 3872 states have internal predecessors, (4705), 1552 states have call successors, (1552), 213 states have call predecessors, (1552), 218 states have return successors, (1648), 1524 states have call predecessors, (1648), 1549 states have call successors, (1648) [2022-07-12 16:42:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 7905 transitions. [2022-07-12 16:42:07,180 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 7905 transitions. Word has length 423 [2022-07-12 16:42:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:42:07,182 INFO L495 AbstractCegarLoop]: Abstraction has 5541 states and 7905 transitions. [2022-07-12 16:42:07,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 3 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 3 states have call predecessors, (57), 3 states have call successors, (57) [2022-07-12 16:42:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 7905 transitions. [2022-07-12 16:42:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2022-07-12 16:42:07,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:42:07,197 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:42:07,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 16:42:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:42:07,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:42:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:42:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1554137551, now seen corresponding path program 1 times [2022-07-12 16:42:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:42:07,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537918823] [2022-07-12 16:42:07,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:07,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:42:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:42:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:42:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:42:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:42:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:42:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:42:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:42:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:42:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:42:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:42:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 16:42:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 16:42:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:07,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:42:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:42:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:42:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 16:42:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 16:42:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:42:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 16:42:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 16:42:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 16:42:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 16:42:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:42:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-12 16:42:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 16:42:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:42:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 16:42:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2022-07-12 16:42:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-12 16:42:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 369 [2022-07-12 16:42:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-12 16:42:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-12 16:42:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 390 [2022-07-12 16:42:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 402 [2022-07-12 16:42:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2022-07-12 16:42:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 414 [2022-07-12 16:42:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2022-07-12 16:42:08,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:42:08,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537918823] [2022-07-12 16:42:08,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537918823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:42:08,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778032196] [2022-07-12 16:42:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:42:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:42:08,365 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) [2022-07-12 16:42:08,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 16:42:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:09,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 3587 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 16:42:09,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:42:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-12 16:42:09,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:42:09,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778032196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:42:09,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:42:09,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-12 16:42:09,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416097470] [2022-07-12 16:42:09,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:42:09,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 16:42:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:42:09,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 16:42:09,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2022-07-12 16:42:09,448 INFO L87 Difference]: Start difference. First operand 5541 states and 7905 transitions. Second operand has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2022-07-12 16:42:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:42:12,050 INFO L93 Difference]: Finished difference Result 14010 states and 20303 transitions. [2022-07-12 16:42:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 16:42:12,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 423 [2022-07-12 16:42:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:42:12,110 INFO L225 Difference]: With dead ends: 14010 [2022-07-12 16:42:12,111 INFO L226 Difference]: Without dead ends: 8484 [2022-07-12 16:42:12,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2022-07-12 16:42:12,140 INFO L413 NwaCegarLoop]: 4110 mSDtfsCounter, 7697 mSDsluCounter, 23946 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 2731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7917 SdHoareTripleChecker+Valid, 28056 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2731 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:42:12,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7917 Valid, 28056 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2731 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 16:42:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2022-07-12 16:42:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 5558. [2022-07-12 16:42:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 3785 states have (on average 1.2472919418758257) internal successors, (4721), 3887 states have internal predecessors, (4721), 1554 states have call successors, (1554), 213 states have call predecessors, (1554), 218 states have return successors, (1650), 1526 states have call predecessors, (1650), 1551 states have call successors, (1650) [2022-07-12 16:42:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7925 transitions. [2022-07-12 16:42:12,736 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7925 transitions. Word has length 423 [2022-07-12 16:42:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:42:12,737 INFO L495 AbstractCegarLoop]: Abstraction has 5558 states and 7925 transitions. [2022-07-12 16:42:12,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 9 states have internal predecessors, (183), 2 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2022-07-12 16:42:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7925 transitions. [2022-07-12 16:42:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2022-07-12 16:42:12,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:42:12,759 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 11, 11, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:42:12,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 16:42:12,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:42:12,976 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:42:12,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:42:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2022471282, now seen corresponding path program 1 times [2022-07-12 16:42:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:42:12,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121295960] [2022-07-12 16:42:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:12,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:42:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:42:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:42:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:42:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:42:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:42:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:42:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:42:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:42:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:42:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:42:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 16:42:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 16:42:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:42:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:42:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:42:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 16:42:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 16:42:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:42:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 16:42:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 16:42:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 16:42:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 16:42:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-12 16:42:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-12 16:42:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-12 16:42:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-12 16:42:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 16:42:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-12 16:42:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2022-07-12 16:42:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2022-07-12 16:42:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2022-07-12 16:42:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 411 [2022-07-12 16:42:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 416 [2022-07-12 16:42:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2022-07-12 16:42:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-12 16:42:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 444 [2022-07-12 16:42:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 450 [2022-07-12 16:42:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:14,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2022-07-12 16:42:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2022-07-12 16:42:14,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:42:14,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121295960] [2022-07-12 16:42:14,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121295960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:42:14,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794412916] [2022-07-12 16:42:14,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:14,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:42:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:42:14,008 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) [2022-07-12 16:42:14,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 16:42:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:14,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 3796 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 16:42:14,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:42:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 31 proven. 27 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2022-07-12 16:42:15,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:42:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 33 proven. 27 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2022-07-12 16:42:15,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794412916] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:42:15,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:42:15,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 29 [2022-07-12 16:42:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215203795] [2022-07-12 16:42:15,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:42:15,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 16:42:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:42:15,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 16:42:15,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2022-07-12 16:42:15,766 INFO L87 Difference]: Start difference. First operand 5558 states and 7925 transitions. Second operand has 29 states, 28 states have (on average 10.035714285714286) internal successors, (281), 20 states have internal predecessors, (281), 7 states have call successors, (104), 9 states have call predecessors, (104), 6 states have return successors, (98), 8 states have call predecessors, (98), 7 states have call successors, (98) [2022-07-12 16:42:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:42:38,060 INFO L93 Difference]: Finished difference Result 11957 states and 17458 transitions. [2022-07-12 16:42:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 16:42:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 10.035714285714286) internal successors, (281), 20 states have internal predecessors, (281), 7 states have call successors, (104), 9 states have call predecessors, (104), 6 states have return successors, (98), 8 states have call predecessors, (98), 7 states have call successors, (98) Word has length 465 [2022-07-12 16:42:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:42:38,094 INFO L225 Difference]: With dead ends: 11957 [2022-07-12 16:42:38,094 INFO L226 Difference]: Without dead ends: 6413 [2022-07-12 16:42:38,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1112 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=338, Invalid=2314, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 16:42:38,114 INFO L413 NwaCegarLoop]: 3767 mSDtfsCounter, 6377 mSDsluCounter, 44131 mSDsCounter, 0 mSdLazyCounter, 48280 mSolverCounterSat, 5669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6943 SdHoareTripleChecker+Valid, 47898 SdHoareTripleChecker+Invalid, 53949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 5669 IncrementalHoareTripleChecker+Valid, 48280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:42:38,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6943 Valid, 47898 Invalid, 53949 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [5669 Valid, 48280 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2022-07-12 16:42:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2022-07-12 16:42:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 5563. [2022-07-12 16:42:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5563 states, 3791 states have (on average 1.2466367713004485) internal successors, (4726), 3888 states have internal predecessors, (4726), 1552 states have call successors, (1552), 213 states have call predecessors, (1552), 219 states have return successors, (1667), 1530 states have call predecessors, (1667), 1550 states have call successors, (1667) [2022-07-12 16:42:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5563 states to 5563 states and 7945 transitions. [2022-07-12 16:42:38,625 INFO L78 Accepts]: Start accepts. Automaton has 5563 states and 7945 transitions. Word has length 465 [2022-07-12 16:42:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:42:38,626 INFO L495 AbstractCegarLoop]: Abstraction has 5563 states and 7945 transitions. [2022-07-12 16:42:38,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 10.035714285714286) internal successors, (281), 20 states have internal predecessors, (281), 7 states have call successors, (104), 9 states have call predecessors, (104), 6 states have return successors, (98), 8 states have call predecessors, (98), 7 states have call successors, (98) [2022-07-12 16:42:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5563 states and 7945 transitions. [2022-07-12 16:42:38,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-12 16:42:38,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:42:38,646 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:42:38,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 16:42:38,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:42:38,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:42:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:42:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -107417767, now seen corresponding path program 1 times [2022-07-12 16:42:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:42:38,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174110241] [2022-07-12 16:42:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:42:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:42:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:42:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:42:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:42:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:42:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:42:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:42:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:42:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:42:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:42:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:42:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 16:42:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 16:42:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:42:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 16:42:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:42:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:42:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:42:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:42:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 16:42:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 16:42:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 16:42:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 16:42:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:42:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-12 16:42:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-12 16:42:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 16:42:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-12 16:42:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-12 16:42:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-12 16:42:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-12 16:42:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-12 16:42:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2022-07-12 16:42:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 421 [2022-07-12 16:42:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 427 [2022-07-12 16:42:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 432 [2022-07-12 16:42:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 438 [2022-07-12 16:42:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-12 16:42:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 460 [2022-07-12 16:42:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 466 [2022-07-12 16:42:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 471 [2022-07-12 16:42:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 485 [2022-07-12 16:42:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2022-07-12 16:42:39,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:42:39,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174110241] [2022-07-12 16:42:39,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174110241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:42:39,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:42:39,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 16:42:39,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70170998] [2022-07-12 16:42:39,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:42:39,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 16:42:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:42:39,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 16:42:39,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:42:39,904 INFO L87 Difference]: Start difference. First operand 5563 states and 7945 transitions. Second operand has 12 states, 12 states have (on average 15.583333333333334) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (66), 9 states have call predecessors, (66), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2022-07-12 16:42:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:42:52,252 INFO L93 Difference]: Finished difference Result 11954 states and 17458 transitions. [2022-07-12 16:42:52,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 16:42:52,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 15.583333333333334) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (66), 9 states have call predecessors, (66), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 494 [2022-07-12 16:42:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:42:52,298 INFO L225 Difference]: With dead ends: 11954 [2022-07-12 16:42:52,298 INFO L226 Difference]: Without dead ends: 6406 [2022-07-12 16:42:52,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-07-12 16:42:52,318 INFO L413 NwaCegarLoop]: 3786 mSDtfsCounter, 3633 mSDsluCounter, 12049 mSDsCounter, 0 mSdLazyCounter, 12297 mSolverCounterSat, 2466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4103 SdHoareTripleChecker+Valid, 15835 SdHoareTripleChecker+Invalid, 14763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2466 IncrementalHoareTripleChecker+Valid, 12297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:42:52,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4103 Valid, 15835 Invalid, 14763 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2466 Valid, 12297 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-07-12 16:42:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6406 states. [2022-07-12 16:42:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6406 to 5569. [2022-07-12 16:42:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5569 states, 3797 states have (on average 1.24624703713458) internal successors, (4732), 3894 states have internal predecessors, (4732), 1552 states have call successors, (1552), 213 states have call predecessors, (1552), 219 states have return successors, (1667), 1530 states have call predecessors, (1667), 1550 states have call successors, (1667) [2022-07-12 16:42:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5569 states to 5569 states and 7951 transitions. [2022-07-12 16:42:52,664 INFO L78 Accepts]: Start accepts. Automaton has 5569 states and 7951 transitions. Word has length 494 [2022-07-12 16:42:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:42:52,665 INFO L495 AbstractCegarLoop]: Abstraction has 5569 states and 7951 transitions. [2022-07-12 16:42:52,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.583333333333334) internal successors, (187), 5 states have internal predecessors, (187), 2 states have call successors, (66), 9 states have call predecessors, (66), 2 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2022-07-12 16:42:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5569 states and 7951 transitions. [2022-07-12 16:42:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2022-07-12 16:42:52,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:42:52,677 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 14, 14, 9, 9, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:42:52,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 16:42:52,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_assert_linux_drivers_clk1__more_at_exitErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 16:42:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:42:52,678 INFO L85 PathProgramCache]: Analyzing trace with hash -519392329, now seen corresponding path program 1 times [2022-07-12 16:42:52,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:42:52,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291080200] [2022-07-12 16:42:52,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:52,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:42:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 16:42:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:42:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:42:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:52,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:42:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:42:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:42:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:42:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:42:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:42:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:42:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:42:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 16:42:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 16:42:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 16:42:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:42:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 16:42:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 16:42:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:42:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:42:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:42:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:42:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 16:42:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 16:42:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 16:42:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-12 16:42:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-07-12 16:42:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 16:42:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 16:42:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 16:42:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-12 16:42:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-12 16:42:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 16:42:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:42:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-07-12 16:42:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2022-07-12 16:42:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-12 16:42:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-07-12 16:42:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2022-07-12 16:42:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 430 [2022-07-12 16:42:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2022-07-12 16:42:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 448 [2022-07-12 16:42:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 453 [2022-07-12 16:42:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2022-07-12 16:42:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 469 [2022-07-12 16:42:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:42:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 481 [2022-07-12 16:42:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 487 [2022-07-12 16:42:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 492 [2022-07-12 16:42:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 506 [2022-07-12 16:42:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:53,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2022-07-12 16:42:53,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:42:53,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291080200] [2022-07-12 16:42:53,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291080200] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:42:53,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376269423] [2022-07-12 16:42:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:42:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:42:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:42:53,723 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) [2022-07-12 16:42:53,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 16:42:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:42:54,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 4001 conjuncts, 514 conjunts are in the unsatisfiable core [2022-07-12 16:42:54,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:42:54,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 16:42:55,084 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 16:42:55,092 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 16:42:55,110 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 16:42:55,207 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 16:42:55,252 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 16:42:55,304 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 16:42:55,375 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 16:42:55,747 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 16:42:55,747 INFO L390 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 33 treesize of output 37 [2022-07-12 16:42:56,132 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-12 16:42:56,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2022-07-12 16:42:56,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 16:42:56,165 INFO L356 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-07-12 16:42:56,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 70 [2022-07-12 16:42:56,186 INFO L356 Elim1Store]: treesize reduction 15, result has 54.5 percent of original size [2022-07-12 16:42:56,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2022-07-12 16:42:56,209 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-07-12 16:42:56,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 73 [2022-07-12 16:42:56,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 16:42:56,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 16:42:56,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 16:42:56,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 16:42:56,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 16:42:56,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2022-07-12 16:42:56,351 INFO L356 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2022-07-12 16:42:56,352 INFO L390 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 53 [2022-07-12 16:42:56,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2022-07-12 16:42:56,375 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-12 16:42:56,376 INFO L390 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 2 case distinctions, treesize of input 23 treesize of output 3 [2022-07-12 16:42:56,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 16:42:56,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 53 treesize of output 36 [2022-07-12 16:42:56,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 20 [2022-07-12 16:42:56,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 16:42:56,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 90 treesize of output 63 [2022-07-12 16:42:56,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:42:56,449 INFO L390 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 29 treesize of output 33 [2022-07-12 16:42:56,835 INFO L356 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2022-07-12 16:42:56,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 66 [2022-07-12 16:42:56,854 INFO L356 Elim1Store]: treesize reduction 62, result has 10.1 percent of original size [2022-07-12 16:42:56,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 138 [2022-07-12 16:42:58,863 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (not (let ((.cse1 (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse1))) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) .cse1))))))) (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int) (v_DerPreprocessor_5 Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (and (= v_DerPreprocessor_5 (select (store (store (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) |ldv_dev_set_drvdata_~tmp~122#1.offset| v_DerPreprocessor_5) (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21) |ldv_dev_set_drvdata_~tmp~122#1.offset|) |ldv_dev_set_drvdata_~tmp~122#1.offset|)) (not (= |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) |ldv_dev_set_drvdata_~tmp~122#1.offset|)))))) is different from true [2022-07-12 16:43:06,983 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 16:43:15,077 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 16:43:23,962 WARN L233 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 44 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 16:43:34,659 INFO L356 Elim1Store]: treesize reduction 26, result has 21.2 percent of original size [2022-07-12 16:43:34,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 66 [2022-07-12 16:43:34,679 INFO L356 Elim1Store]: treesize reduction 62, result has 10.1 percent of original size [2022-07-12 16:43:34,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 178 [2022-07-12 16:43:36,695 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int) (v_DerPreprocessor_5 Int) (|v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| Int)) (and (= v_DerPreprocessor_5 (select (store (store (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) |ldv_dev_set_drvdata_~tmp~122#1.offset| v_DerPreprocessor_5) (+ |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.offset_BEFORE_CALL_1| 21) |ldv_dev_set_drvdata_~tmp~122#1.offset|) |ldv_dev_set_drvdata_~tmp~122#1.offset|)) (not (= |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1| (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_smsc911x_request_resources_~pdev#1.base_BEFORE_CALL_1|) |ldv_dev_set_drvdata_~tmp~122#1.offset|))))) (or (exists ((|v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3| Int) (|v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12| Int) (|ldv_dev_set_drvdata_~tmp~122#1.offset| Int) (v_DerPreprocessor_5 Int)) (and (= v_DerPreprocessor_5 (select (store (store (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) |ldv_dev_set_drvdata_~tmp~122#1.offset| v_DerPreprocessor_5) (+ 21 |v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3|) |ldv_dev_set_drvdata_~tmp~122#1.offset|) |ldv_dev_set_drvdata_~tmp~122#1.offset|)) (not (= (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) |ldv_dev_set_drvdata_~tmp~122#1.offset|) |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|)))) (exists ((|v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3| Int) (|v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12| Int)) (not (let ((.cse1 (+ 21 |v_smsc911x_drv_probe_~pdev#1.offset_BEFORE_CALL_3|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) .cse1))) (= (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |v_smsc911x_drv_probe_#in~pdev#1.base_BEFORE_CALL_12|) .cse1)) .cse0))))))) is different from true [2022-07-12 16:43:48,975 WARN L233 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 16:44:01,300 WARN L233 SmtUtils]: Spent 11.96s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 16:44:01,465 INFO L356 Elim1Store]: treesize reduction 62, result has 72.3 percent of original size [2022-07-12 16:44:01,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 361 [2022-07-12 16:44:01,614 INFO L356 Elim1Store]: treesize reduction 60, result has 74.5 percent of original size [2022-07-12 16:44:01,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 375 treesize of output 506 [2022-07-12 16:44:01,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 5 [2022-07-12 16:44:01,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 16:44:02,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 22 [2022-07-12 16:44:02,966 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 16:44:02,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:02,998 INFO L390 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 47 treesize of output 51 [2022-07-12 16:44:04,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 16:44:05,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 16:44:13,598 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 16:44:13,598 INFO L390 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 100 treesize of output 88 [2022-07-12 16:44:16,036 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 16:44:16,036 INFO L390 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 100 treesize of output 88 [2022-07-12 16:44:16,409 INFO L356 Elim1Store]: treesize reduction 4, result has 93.4 percent of original size [2022-07-12 16:44:16,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 215 [2022-07-12 16:44:17,394 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 16:44:17,394 INFO L390 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 100 treesize of output 88 [2022-07-12 16:44:18,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 76 [2022-07-12 16:44:18,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 76 [2022-07-12 16:44:18,832 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:18,833 INFO L390 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 151 treesize of output 143 [2022-07-12 16:44:18,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 76 [2022-07-12 16:44:19,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 76 [2022-07-12 16:44:19,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 94 treesize of output 76 [2022-07-12 16:44:19,772 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 16:44:19,773 INFO L390 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 100 treesize of output 88 [2022-07-12 16:44:30,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 16:44:30,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:31,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 16:44:31,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:31,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:31,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 78 [2022-07-12 16:44:37,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:37,187 INFO L390 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 68 treesize of output 72 [2022-07-12 16:44:37,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:37,453 INFO L390 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 68 treesize of output 72 [2022-07-12 16:44:37,704 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:37,707 INFO L390 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 72 treesize of output 76 [2022-07-12 16:44:40,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:40,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:40,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:40,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:40,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:40,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:40,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:44,339 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 16:44:45,425 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 16:44:50,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:50,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:50,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:53,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:54,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:54,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:54,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:44:58,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:58,346 INFO L390 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 72 treesize of output 76 [2022-07-12 16:44:58,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:58,793 INFO L390 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 68 treesize of output 72 [2022-07-12 16:44:59,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:44:59,294 INFO L390 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 68 treesize of output 72 [2022-07-12 16:45:04,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 16:45:04,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8 [2022-07-12 16:45:04,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 16:45:04,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 78 [2022-07-12 16:45:05,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-07-12 16:45:05,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 8